The length of primitive BCH codes with minimal covering radius
From MaRDI portal
Publication:676684
DOI10.1023/A:1008299101833zbMath0868.94049MaRDI QIDQ676684
Publication date: 17 August 1997
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Cyclic codes (94B15) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items (2)
The covering radii of a class of binary cyclic codes and some BCH codes ⋮ Polynomial factorisation and an application to regular directed graphs
This page was built for publication: The length of primitive BCH codes with minimal covering radius
