A new lower bound for the minimum distance of a cyclic code

DOI10.1109/TIT.1983.1056672zbMATH Open0519.94010MaRDI QIDQ3671045FDOQ3671045

Authors: C. Roos 

Publication date: 1983

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

zbMATH Keywords

cyclic codeslower boundminimum distance

Mathematics Subject Classification ID

Cyclic codes (94B15)

Cited In (15)

• A symmetric Roos bound for linear codes
• Sum-rank product codes and bounds on the minimum distance
• On some bounds on the minimum distance of cyclic codes over finite fields
• Rank error-correcting pairs
• Monomial codes seen as invariant subspaces
• Linear codes invariant under cyclic endomorphisms
• A commutative algebra approach to linear codes
• New bounds on the minimum distance of cyclic codes
• On the Triple-Error-Correcting Cyclic Codes with Zero Set {1, 2 i  + 1, 2 j  + 1}
• Four infinite families of ternary cyclic codes with a square-root-like lower bound
• A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
• Constacyclic codes as invariant subspaces
• Power error locating pairs
• Roos bound for skew cyclic codes in Hamming and rank metric
• Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\)

This page was built for publication: A new lower bound for the minimum distance of a cyclic code

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