Published August 1998
| public
Book Section - Chapter
Junction tree representations for linear block codes
- Creators
- McEliece, Robert J.
- Xu, Meina
Abstract
We introduce a combinatorial representation for linear block codes, called the junction tree representation, which generalizes the notion of code trellis. We first present an algorithm for finding a minimum complexity junction tree. We then show by example that the minimum complexity junction tree can be less complex than the minimal trellis. One implication of this is that one can sometimes devise exact decoding algorithms which have lower complexity than those associated with the minimal trellis.
Additional Information
© 1998 IEEE. Date of Current Version: 06 August 2002. This work was partially supported by NSF grant no. NCR-9505975, AFOSR grant no. 5F49620-97-1-0313, and a grant from Qualcomm, Inc. A portion of McEliece's contribution was performed at the Sony Corporation in Tokyo, while he was a holder of a Sony Sabbatical Chair.Additional details
- Eprint ID
- 28575
- Resolver ID
- CaltechAUTHORS:20111222-140131828
- NCR-9505975
- NSF
- 5F49620-97-1-0313
- Air Force Office of Scientific Research (AFOSR)
- Qualcomm, Inc
- Created
-
2011-12-22Created 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
- 6175230