CaltechAUTHORS
  A Caltech Library Service

Junction tree representations for linear block codes

McEliece, Robert J. and Xu, Meina (1998) Junction tree representations for linear block codes. In: 1998 IEEE International Symposium on Information Theory. IEEE , Piscataway, NJ, p. 253. ISBN 0-7803-5000-6 http://resolver.caltech.edu/CaltechAUTHORS:20111222-140131828

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

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20111222-140131828

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.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1109/ISIT.1998.708858 DOIUNSPECIFIED
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=708858PublisherUNSPECIFIED
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.
Funders:
Funding AgencyGrant Number
NSFNCR-9505975
Air Force Office of Scientific Research (AFOSR)5F49620-97-1-0313
Qualcomm, IncUNSPECIFIED
Other Numbering System:
Other Numbering System NameOther Numbering System ID
INSPEC Accession Number6175230
Record Number:CaltechAUTHORS:20111222-140131828
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:20111222-140131828
Official Citation:McEliece, R.J.; Xu, M.; , "Junction tree representations for linear block codes," Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on , vol., no., pp.253, 16-21 Aug 1998 doi: 10.1109/ISIT.1998.708858 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=708858&isnumber=15310
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:28575
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:22 Dec 2011 22:54
Last Modified:22 Dec 2011 22:54

Repository Staff Only: item control page