DocumentCode
2929196
Title
Tree decoding of BCH codes
Author
Moore, Torrie G R ; Gulliver, T. Aaron
Author_Institution
Dept. of Electr. & Electron. Eng., Canterbury Univ., Christchurch, New Zealand
Volume
6
fYear
1998
fDate
1998
Firstpage
3521
Abstract
The most time consuming step in the decoding of BCH codes is the calculation of the error locator polynomial. This is done using an iterative algorithm or direct solution which is often computationally expensive. By performing a simple check on which syndromes are zero, many decoding failures can be detected before the polynomial is calculated. In this paper, tree diagrams for decoding are constructed based on these checks
Keywords
BCH codes; block codes; decoding; error correction codes; iterative methods; linear codes; polynomials; trees (mathematics); BCH codes; decoding failures; error locator polynomial; iterative algorithm; tree decoding; Closed-form solution; Decision trees; Equations; Error correction; Error correction codes; Iterative algorithms; Iterative decoding; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 1998. GLOBECOM 1998. The Bridge to Global Integration. IEEE
Conference_Location
Sydney,NSW
Print_ISBN
0-7803-4984-9
Type
conf
DOI
10.1109/GLOCOM.1998.775854
Filename
775854
Link To Document