A symmetric Roos bound for linear codes

DOI10.1016/j.jcta.2006.03.020zbMath1105.94026OpenAlexW2073685531MaRDI QIDQ855868

Iwan M. Duursma, Pellikaan, Ruud

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) Bounds on codes (94B65) Cyclic codes (94B15)

Related Items (4)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound
• On decoding by error location and dependent sets of error positions
• Monomial embeddings of the Klein curve
• On the existence of error-correcting pairs
• On a class of error correcting binary group codes
• Further results on error correcting binary group codes
• 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
• Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations
• A new procedure for decoding cyclic and BCH codes up to actual minimum distance
• Error-locating pairs for cyclic codes
• On the minimum distance of cyclic codes
• A code decomposition approach for decoding cyclic and algebraic-geometric codes
• Generation of matrices for determining minimum distance and decoding of cyclic codes
• Generalizations of the BCH bound

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