More on the covering radius of BCH codes

Françoise Levy-dit-Vehel, Simon Litsyn

Research output: Contribution to journalArticlepeer-review

Abstract

New lower bounds on the minimum length of (-errorcorrecting BCH codes with covering radius at most 2t arc derived.

Original languageEnglish
Pages (from-to)1023-1028
Number of pages6
JournalIEEE Transactions on Information Theory
Volume42
Issue number3
DOIs
StatePublished - 1996

Keywords

  • BCH codes
  • Covering radius
  • Systems of equations over unite fields

Cite this