On the covering radius of long binary BCH codes

DOI10.1016/0166-218X(87)90055-2MaRDI QIDQ1093616zbMATH OpenOpenAlexFDO

Authors Aimo Tietäväinen

Publication date 1987

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(87)90055-2

zbMATH Keywords

covering radiuslong binary BCH codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Review text

The author has proved in this paper that the covering radius of long binary BCH codes with designed distance \(2t+1\) is at most 2t.

Cites work

• Bounds for exponential sums
• On the covering radius of cyclic linear codes and arithmetic codes

Cited in

(8)

• The number of solutions of certain diagonal equations over finite fields
• Long binary narrow-sense BCH codes are normal
• The covering radii of a class of binary cyclic codes and some BCH codes
• scientific article; zbMATH DE number 1057770 (Why is no real title available?)
• On (n, k, l, Δ)-systems
• scientific article; zbMATH DE number 2124960 (Why is no real title available?)
• The third generalized covering radius for binary primitive double-error-correcting BCH codes
• On the second generalized covering radius for binary primitive triple-error-correcting BCH codes

This page was built for publication: On the covering radius of long binary BCH codes

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