Referenced Items are not available for this document.
A low-density parity-check (LDPC) code whose parity-check matrix consists of weight-2 columns is known as a cycle code. In this letter, we propose a construction of nonbinary quasi-cyclic (QC) LDPC cycle codes based on Singer perfect difference set. The Tanner graph has girth 12 and the code length achieves the Gallager lower bound. We further show that constructed codes have exactly a minimum symbol Hamming distance 6. Simulation results show that the proposed codes perform better than random nonbinary LDPC cycle codes.
Published in:
Communications Letters, IEEE
(Volume:14
,
Issue:
2
)
Date of Publication: February 2010
- Page(s):
- 181 - 183
- ISSN :
- 1089-7798
- INSPEC Accession Number:
- 11135902
- Digital Object Identifier :
- 10.1109/LCOMM.2010.02.092121
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 05 February 2010
- Issue Date :
- February 2010
- Sponsored by :
- IEEE Communications Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
