An efficient exhaustive low-weight codeword search for structured LDPC codes

Seyed Mehrdad Khatami, Ludovic Danjean, Dung V. Nguyen, Bane Vasić

Research output: Contribution to conferencePaper

2 Scopus citations

Abstract

In this paper, we present an algorithm to find all low-weight codewords in a given quasi-cyclic (QC) low-density parity-check (LDPC) code with a fixed column-weight and girth. The main idea is to view a low-weight codeword as an (a, 0) trapping sets, and then show that each topologically different (a, 0) trapping set can be dissected into smaller trapping sets. The proposed search method relies on the knowledge of possible topologies of such smaller trapping sets present in a code ensemble, which enables an efficient search. Combined with the high-rate QC LDPC code construction which successively adds blocks of permutation matrices, the algorithm ensures that in the code construction procedure all codewords up to a certain weight are avoided, which leads to a code with the desired minimum distance. The algorithm can be also used to determine the multiplicity of the low-weight codewords with different trapping set structure.

Original languageEnglish (US)
Pages401-410
Number of pages10
DOIs
StatePublished - May 16 2013
Event2013 Information Theory and Applications Workshop, ITA 2013 - San Diego, CA, United States
Duration: Feb 10 2013Feb 15 2013

Other

Other2013 Information Theory and Applications Workshop, ITA 2013
CountryUnited States
CitySan Diego, CA
Period2/10/132/15/13

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Fingerprint Dive into the research topics of 'An efficient exhaustive low-weight codeword search for structured LDPC codes'. Together they form a unique fingerprint.

  • Cite this

    Khatami, S. M., Danjean, L., Nguyen, D. V., & Vasić, B. (2013). An efficient exhaustive low-weight codeword search for structured LDPC codes. 401-410. Paper presented at 2013 Information Theory and Applications Workshop, ITA 2013, San Diego, CA, United States. https://doi.org/10.1109/ITA.2013.6502981