High speed decoding of the binary \((47, 24, 11)\) quadratic residue code
From MaRDI portal
Publication:2638202
DOI10.1016/j.ins.2010.06.022zbMath1194.94203OpenAlexW2017388932MaRDI QIDQ2638202
Shao-I Chu, Hsin-Chiu Chang, Hung-Peng Lee, Trieu-Kien Truong, Tsung-Ching Lin
Publication date: 15 September 2010
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2010.06.022
Related Items
On the decoding of the \((24, 12, 8)\) Golay code, Cyclic codes over \(R = F_p + uF_p + \cdots + u^{k - 1}F_p\) with length \(p^sn\), Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Algebraic decoding of the \((41, 21, 9)\) quadratic residue code
- A lookup table decoding of systematic \((47, 24, 11)\) quadratic residue code
- Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)
- Algebraic decoding of the (23,12,7) Golay code (Corresp.)
- 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
- Decoding the (47,24,11) quadratic residue code