A Caltech Library Service

The Trellis Evolution Algorithm for Nonlinear Block Codes

Lin, Wei and McEliece, Robert J. and Kiely, Aaron B. (1998) The Trellis Evolution Algorithm for Nonlinear Block Codes. In: 1998 IEEE International Symposium on Information Theory. IEEE , Piscataway, N.J., p. 254. ISBN 0-7803-5000-6.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


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.

Item Type:Book Section
Related URLs:
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.
Funding AgencyGrant Number
Other Numbering System:
Other Numbering System NameOther Numbering System ID
INSPEC Accession Number6175231
Record Number:CaltechAUTHORS:20120119-094316404
Persistent URL:
Official Citation:Wei Lin; McEliece, R.J.; Kiely, A.B.; , "The trellis evolution algorithm for nonlinear block codes," Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on , vol., no., pp.254, 16-21 Aug 1998 doi: 10.1109/ISIT.1998.708859 URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:28852
Deposited By: Ruth Sustaita
Deposited On:19 Jan 2012 18:17
Last Modified:09 Nov 2021 17:01

Repository Staff Only: item control page