DSpace Repository

On the minimum weight of simple full-length array LDPC codes

Show simple item record

dc.contributor.author Sugiyama, Kenji en
dc.contributor.author Kaji, Yuichi en
dc.date.accessioned 2009-02-12T06:23:31Z en
dc.date.available 2009-02-12T06:23:31Z en
dc.date.issued 2008-06-01 en
dc.identifier.issn 0916-8508 en
dc.identifier.uri http://hdl.handle.net/10061/4985 en
dc.description.abstract We investigate the minimum weights of simple full-length array LDPC codes (SFA-LDPC codes). The SFA-LDPC codes are a subclass of LDPC codes, and constructed algebraically according to two integer parameters p and j. Mittelholzer and Yang et al. have studied the minimum weights of SFA-LDPC codes, but the exact minimum weights of the codes are not known except for some small p and j. In this paper, we show that the minimum weights of the SFA-LDPC codes with j=4 and j=5 are upper-bounded by 10 and 12, respectively, independent from the prime number p. By combining the results with Yangs lower-bound limits, we can conclude that the minimum weights of the SFA-LDPC codes with j=4 and p>7 are exactly 10 and those of the SFA-LDPC codes with j=5 are 10 or 12. en
dc.language.iso en en
dc.publisher Institute of Electronics, Information and Communication Engineers en
dc.rights Copyright (C)2008 IEICE en
dc.title On the minimum weight of simple full-length array LDPC codes en
dc.type.nii Journal Article en
dc.textversion publisher en
dc.identifier.ncid AA10826239 en
dc.identifier.jtitle IEICE transactions on fundamentals of electronics, communications and computer sciences en
dc.identifier.volume E91-A en
dc.identifier.issue 6 en
dc.identifier.spage 1502 en
dc.identifier.epage 1508 en
dc.relation.doi 10.1093/ietfec/e91-a.6.1502 en
dc.identifier.NAIST-ID 73292336 en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account