Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published August 1998 | metadata_only
Book Section - Chapter

Junction tree representations for linear block codes


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

August 19, 2023
August 19, 2023