A symmetric Roos bound for linear codes

DOI10.1016/J.JCTA.2006.03.020zbMATH Open1105.94026OpenAlexW2073685531MaRDI QIDQ855868FDOQ855868

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

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

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)

Cites Work

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

Cited In (5)

• Rank error-correcting pairs
• Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance
• Roos bound for skew cyclic codes in Hamming and rank metric
• 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)