Long binary narrow-sense BCH codes are normal

DOI10.1007/s002000050052zbMath0870.94045OpenAlexW3157366187WikidataQ112879320 ScholiaQ112879320MaRDI QIDQ1352424

Yrjö Kaipainen, Aimo Tietäväinen, Iiro S. Honkala

Publication date: 3 August 1997

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002000050052

zbMATH Keywords

covering radiuscharacter sumsBCH code

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Other character sums and Gauss sums (11T24) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering radius for long BCH codes
• On the covering radius of cyclic linear codes and arithmetic codes
• On the covering radius of long binary BCH codes
• Covering bounds for codes
• Covering machines
• Equations over finite fields. An elementary approach
• On \((p,1)\)-subnormal \(q\)-ary covering codes
• La conjecture de Weil. I
• An asymptotic bound on the covering radii of binary BCH codes
• On the covering radius of codes
• Further results on the covering radius of codes
• Lower bounds for binary covering codes
• Modified bounds for covering codes
• On Some Exponential Sums
• Number of Points of Varieties in Finite Fields