A symmetric Roos bound for linear codes

DOI10.1016/J.JCTA.2006.03.020MaRDI QIDQ855868zbMATH OpenOpenAlexFDO

Authors Iwan Duursma, Ruud Pellikaan

Publication date 7 December 2006

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcta.2006.03.020

zbMATH Keywords

cyclic codeminimum distance bounddual BCH codeRoos bound

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15) Bounds on codes (94B65)

Recommendations

• New bounds on the minimum distance of cyclic codes
• A new bound for cyclic codes beating the Roos bound
• Roos bound for skew cyclic codes in Hamming and rank metric
• scientific article; zbMATH DE number 3873229
• A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set

Cites work

• scientific article; zbMATH DE number 3147923 (Why is no real title available?)
• scientific article; zbMATH DE number 1284417 (Why is no real title available?)
• scientific article; zbMATH DE number 1009715 (Why is no real title available?)
• A code decomposition approach for decoding cyclic and algebraic-geometric codes
• A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound
• A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
• A new lower bound for the minimum distance of a cyclic code
• A new procedure for decoding cyclic and BCH codes up to actual minimum distance
• Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations
• Error-locating pairs for cyclic codes
• Further results on error correcting binary group codes
• Generalizations of the BCH bound
• Generation of matrices for determining minimum distance and decoding of cyclic codes
• Monomial embeddings of the Klein curve
• On a class of error correcting binary group codes
• On decoding by error location and dependent sets of error positions
• On the existence of error-correcting pairs
• On the minimum distance of cyclic codes

Cited in

(5)

• Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
• Roos bound for skew cyclic codes in Hamming and rank metric
• Rank error-correcting pairs
• Evaluation codes from smooth quadric surfaces and twisted Segre varieties
• On the roots and minimum rank distance of skew cyclic codes

This page was built for publication: A symmetric Roos bound for linear codes

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