Algebraic decoding of the (41, 21, 9) Quadratic Residue code
Authors:
- 1 September 2009
- journal article
- Published by Elsevier in Information Sciences
- Vol. 179 (19) , 3451-3459
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Is there a need for fuzzy logic?Information Sciences, 2008
- Erratum to “Fast, prime factor, discrete Fourier transform algorithms over GF(2m) for 8⩽m⩽10” [Informat. Sci. 176 (1) (2006) 1–26]Information Sciences, 2007
- Fast, prime factor, discrete Fourier transform algorithms over GF(2 ) for 8 ⩽m⩽ 10Information Sciences, 2006
- Toward a generalized theory of uncertainty (GTU)––an outlineInformation Sciences, 2005
- Decoding the (47,24,11) quadratic residue codeIEEE Transactions on Information Theory, 2001
- A new procedure for decoding cyclic and BCH codes up to actual minimum distanceIEEE Transactions on Information Theory, 1994
- Error-locating pairs for cyclic codesIEEE Transactions on Information Theory, 1994
- The algebraic decoding of the (41, 21, 9) quadratic residue codeIEEE Transactions on Information Theory, 1992
- Algebraic decoding of the (32, 16, 8) quadratic residue codeIEEE Transactions on Information Theory, 1990
- VLSI Architectures for Computing Multiplications and Inverses in GF(2m)IEEE Transactions on Computers, 1985