An asymptotic bound on the covering radii of binary BCH codes

DOI10.1109/18.50395zbMATH Open0702.94016OpenAlexW2084553348MaRDI QIDQ3481645FDOQ3481645

Authors: Aimo Tietäväinen 

Publication date: 1990

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.50395

Recommendations

• The length of primitive BCH codes with minimal covering radius
• An upper bound on the covering radius as a function of the dual distance
• On the covering radius of long 5-ary BCH codes with minimum distance 7
• Asymptotic bounds on the covering radius of binary codes
• scientific article; zbMATH DE number 2124960

zbMATH Keywords

covering radiusprimitive binary BCH codeDeligne's theorem

Mathematics Subject Classification ID

Cyclic codes (94B15)

Cited In (4)

• The covering radii of a class of binary cyclic codes and some BCH codes
• Finite Fields and Applications
• Title not available (Why is that?)
• Long binary narrow-sense BCH codes are normal

This page was built for publication: An asymptotic bound on the covering radii of binary BCH codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3481645)