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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
APA
Kaufman, T., & Litsyn, S. (2006). Long extended BCH codes are spanned by minimum weight words. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3857 LNCS, pp. 285–294). https://doi.org/10.1007/11617983_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free