Error-locating pairs for cyclic codes
From MaRDI portal
Publication:4324171
DOI10.1109/18.335964zbMath0817.94025OpenAlexW2143717559MaRDI QIDQ4324171
Publication date: 1 March 1995
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.335964
Related Items (14)
Rank error-correcting pairs ⋮ A characterization of MDS codes that have an error correcting pair ⋮ A symmetric Roos bound for linear codes ⋮ On the existence of error-correcting pairs ⋮ Systems of MDS codes from units and idempotents ⋮ The error-correcting pair for TGRS codes ⋮ The properties and the error-correcting pair for lengthened GRS codes ⋮ On the error-correcting pair for MDS linear codes with even minimum distance ⋮ A subclass of \(q^m\)-ary Reed-Solomon codes and decoding of some rational GAG-codes ⋮ A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes ⋮ Algebraic decoding of the \((41, 21, 9)\) quadratic residue code ⋮ Squares of matrix-product codes ⋮ Power error locating pairs ⋮ Reed-Muller Codes
This page was built for publication: Error-locating pairs for cyclic codes