@inproceedings{4fb41f425e354b2e91b00fbbc5cdb42b,
title = "Long extended BCH codes are spanned by minimum weight words",
abstract = "It is shown that long enough extended t-error correcting BCH codes B t are spanned by its lightest words of weight 2t + 2. The proof follows from an upper bound on the number of words of weight 2t + 2 in any subcode of Bt of codimension 1.",
author = "Tali Kaufman and Simon Litsyn",
year = "2006",
doi = "10.1007/11617983_28",
language = "אנגלית",
isbn = "3540314237",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "285--294",
booktitle = "Applied Algebra, Algebraic Algorithms and Error-Correcting Codes - 16th International Symposium, AAECC-16, Proceedings",
note = "16th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-16 ; Conference date: 20-02-2006 Through 24-02-2006",
}