DocumentCode
2470547
Title
The trellis evolution algorithm for nonlinear block codes
Author
Lin, Wei ; Mceliece, Robert J. ; Kiely, Aaron B.
Author_Institution
Dept. of Electr. & Comput. Eng., Cincinnati Univ., OH, USA
fYear
1998
fDate
16-21 Aug 1998
Firstpage
254
Abstract
An algorithm is proposed to search the desired trellis structure for block codes. It consists of a sequence of vertex mergings (evolutions) on a code graph. Any sequence of evolutions will result in the BCJR trellis (McEliece 1996) for linear codes. By searching all possible evolution paths, the desired trellis structure for nonlinear codes can be obtained. Vertex mergeability is examined to reduce the number of searches to a minimum, and lead to the progressive vertex set partition algorithm
Keywords
block codes; graph theory; nonlinear codes; search problems; trellis codes; BCJR trellis; code graph; linear codes; nonlinear block codes; progressive vertex set partition algorithm; trellis evolution algorithm; vertex mergeability; vertex mergings; Algorithm design and analysis; Binary codes; Block codes; Decoding; Encoding; Joining processes; Linear code; Merging; Partitioning algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-5000-6
Type
conf
DOI
10.1109/ISIT.1998.708859
Filename
708859
Link To Document