Long extended BCH codes are spanned by minimum weight words

Tali Kaufman, Simon Litsyn

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationApplied Algebra, Algebraic Algorithms and Error-Correcting Codes - 16th International Symposium, AAECC-16, Proceedings
Pages285-294
Number of pages10
DOIs
StatePublished - 2006
Event16th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-16 - Las Vegas, NV, United States
Duration: 20 Feb 200624 Feb 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3857 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-16
Country/TerritoryUnited States
CityLas Vegas, NV
Period20/02/0624/02/06

Fingerprint

Dive into the research topics of 'Long extended BCH codes are spanned by minimum weight words'. Together they form a unique fingerprint.

Cite this