Published August 1998
| public
Book Section - Chapter
The Trellis Evolution Algorithm for Nonlinear Block Codes
- Creators
- Lin, Wei
- McEliece, Robert J.
- Kiely, Aaron B.
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.
Additional Information
© 1998 IEEE. Issue Date: Aug 1998. Date of Current Version: 06 August 2002. This work was partially supported by NSF Grant NCR-9505975 and a grant from Pacific Bell.Additional details
- Eprint ID
- 28852
- DOI
- 10.1109/ISIT.1998.708859
- Resolver ID
- CaltechAUTHORS:20120119-094316404
- NCR-9505975
- NSF
- Pacific Bell
- Created
-
2012-01-19Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 6175231