Algebraic decoding of the \((41, 21, 9)\) quadratic residue code
From MaRDI portal
Publication:730938
DOI10.1016/J.INS.2009.06.002zbMath1172.94645OpenAlexW2009064721MaRDI QIDQ730938
Hsin-Chiu Chang, Hung-Peng Lee, Tsung-Ching Lin, Trieu-Kien Truong
Publication date: 1 October 2009
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2009.06.002
Related Items (3)
High speed decoding of the binary \((47, 24, 11)\) quadratic residue code ⋮ On the decoding of the \((24, 12, 8)\) Golay code ⋮ A cyclic weight algorithm of decoding the \((47, 24, 11)\) quadratic residue code
Cites Work
- Unnamed Item
- Unnamed Item
- Is there a need for fuzzy logic?
- Toward a generalized theory of uncertainty (GTU) -- an outline
- Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)
- Algebraic decoding of the (32, 16, 8) quadratic residue code
- Algebraic Decoding of the $(89, 45, 17)$ Quadratic Residue Code
- VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
- The algebraic decoding of the (41, 21, 9) quadratic residue code
- Decoding the (73, 37, 13) quadratic residue code
- A new procedure for decoding cyclic and BCH codes up to actual minimum distance
- Error-locating pairs for cyclic codes
- Decoding the (47,24,11) quadratic residue code
This page was built for publication: Algebraic decoding of the \((41, 21, 9)\) quadratic residue code