Covering Radius Computations for Binary Cyclic Codes
From MaRDI portal
Recommendations
Cited in
(14)- On the covering radius of some binary cyclic codes
- Additive cyclic codes over mixed alphabets and the football pool problem
- Divisibility properties for covering radius of certain cyclic codes
- scientific article; zbMATH DE number 5543120 (Why is no real title available?)
- The covering radius of cyclic codes of length up to 31 (Corresp.)
- scientific article; zbMATH DE number 721640 (Why is no real title available?)
- scientific article; zbMATH DE number 729916 (Why is no real title available?)
- On the covering radii of a class of binary primitive cyclic codes
- Resolution of a conjecture on the covering radius of linear codes
- The covering radius of the cycle code of a graph
- The third generalized covering radius for binary primitive double-error-correcting BCH codes
- Constructions of covering sequences and 2D-sequences
- On the second generalized covering radius for binary primitive triple-error-correcting BCH codes
- Some optimal codes from algebraic geometry and their covering radii
This page was built for publication: Covering Radius Computations for Binary Cyclic Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202628)