More on the covering radius of BCH codes

  • Authors:

  • F. Levy-dit-Vehel;S. Litsyn

  • Affiliations:

  • Inst. Nat. de Recherche en Inf. et Autom., Le Chesnay;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 1996

Quantified Score

Hi-index 754.84

Visualization

Abstract

New lower bounds on the minimum length of t-error-correcting BCH codes with covering radius at most 2t are derived