The algebraic decoding of the (41, 21, 9) quadratic residue code
From MaRDI portal
Publication:4008330
DOI10.1109/18.135639zbMath0749.94020OpenAlexW2135061293MaRDI QIDQ4008330
Xuemin Chen, Xiaowei Yin, Irving S. Reed, Trieu-Kien Truong
Publication date: 27 September 1992
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.135639
BCH codescyclic codedecodingReed-Solomon codesquadratic residue codeNewton identitieserror-correction coding theorySylvester resultant methodZech's logarithms
Related Items (9)
High speed decoding of the binary \((47, 24, 11)\) quadratic residue code ⋮ Quadratic-residue codes and cyclotomic fields ⋮ A lookup table decoding of systematic \((47, 24, 11)\) quadratic residue code ⋮ On a Class of Reversible Binary Cyclic Codes and their Algebraic Decoding ⋮ On the decoding of the \((24, 12, 8)\) Golay code ⋮ A cyclic weight algorithm of decoding the \((47, 24, 11)\) quadratic residue code ⋮ Unnamed Item ⋮ Algebraic decoding of the \((41, 21, 9)\) quadratic residue code ⋮ On the decoding of binary cyclic codes with the Newton identities
This page was built for publication: The algebraic decoding of the (41, 21, 9) quadratic residue code