Long Extended BCH Codes Are Spanned by Minimum Weight Words

Tali Kaufman, Simon Litsyn. Long Extended BCH Codes Are Spanned by Minimum Weight Words. In Marc P. C. Fossorier, Hideki Imai, Shu Lin, Alain Poli, editors, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 16th International Symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006, Proceedings. Volume 3857 of Lecture Notes in Computer Science, pages 285-294, Springer, 2006. [doi]

@inproceedings{KaufmanL06,
  title = {Long Extended BCH Codes Are Spanned by Minimum Weight Words},
  author = {Tali Kaufman and Simon Litsyn},
  year = {2006},
  doi = {10.1007/11617983_28},
  url = {http://dx.doi.org/10.1007/11617983_28},
  researchr = {https://researchr.org/publication/KaufmanL06},
  cites = {0},
  citedby = {0},
  pages = {285-294},
  booktitle = {Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 16th International Symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006, Proceedings},
  editor = {Marc P. C. Fossorier and Hideki Imai and Shu Lin and Alain Poli},
  volume = {3857},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-31423-7},
}