Show simple item record

dc.contributor.authorNguyen, Dung Viet
dc.contributor.authorChilappagari, Shashi Kiran
dc.contributor.authorMarcellin, Michael W.
dc.contributor.authorVasic, Bane
dc.date.accessioned2020-08-01T01:11:25Z
dc.date.available2020-08-01T01:11:25Z
dc.date.issued2012-03-15
dc.identifier.citationD. V. Nguyen, S. K. Chilappagari, M. W. Marcellin and B. Vasic, "On the Construction of Structured LDPC Codes Free of Small Trapping Sets," in IEEE Transactions on Information Theory, vol. 58, no. 4, pp. 2280-2302, April 2012, doi: 10.1109/TIT.2011.2173733.en_US
dc.identifier.issn0018-9448
dc.identifier.doi10.1109/tit.2011.2173733
dc.identifier.urihttp://hdl.handle.net/10150/641976
dc.description.abstractWe present a method to construct low-density parity-check (LDPC) codes with low error floors on the binary symmetric channel. Codes are constructed so that their Tanner graphs are free of certain small trapping sets. These trapping sets are selected from the trapping set ontology for the Gallager A/B decoder. They are selected based on their relative harmfulness for a given decoding algorithm. We evaluate the relative harmfulness of different trapping sets for the sum-product algorithm by using the topological relations among them and by analyzing the decoding failures on one trapping set in the presence or absence of other trapping sets. We apply this method to construct structured LDPC codes. To facilitate the discussion, we give a new description of structured LDPC codes whose parity-check matrices are arrays of permutation matrices. This description uses Latin squares to define a set of permutation matrices that have disjoint support and to derive a simple necessary and sufficient condition for the Tanner graph of a code to be free of four cycles.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.rightsCopyright © 2012 IEEEen_US
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en_US
dc.subjecterror flooren_US
dc.subjectLatin squaresen_US
dc.subjectstructured low-density parity-check codesen_US
dc.subjecttrapping setsen_US
dc.titleOn the Construction of Structured LDPC Codes Free of Small Trapping Setsen_US
dc.typeArticleen_US
dc.contributor.departmentUniv Arizona, Dept Elect & Comp Engnen_US
dc.identifier.journalIEEE Transactions on Information Theoryen_US
dc.description.collectioninformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at repository@u.library.arizona.edu.en_US
dc.eprint.versionFinal accepted manuscripten_US
dc.source.journaltitleIEEE Transactions on Information Theory
dc.source.volume58
dc.source.issue4
dc.source.beginpage2280
dc.source.endpage2302
refterms.dateFOA2020-08-01T01:11:26Z


Files in this item

Thumbnail
Name:
On the Construction Of Structured ...
Size:
1016.Kb
Format:
PDF
Description:
Final Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record