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

Seyed Mehrdad Khatami, Ludovic Danjean, Dung V. Nguyen, Bane V Vasic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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)
Title of host publication2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings
Pages401-410
Number of pages10
DOIs
StatePublished - 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

Fingerprint

Topology

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Khatami, S. M., Danjean, L., Nguyen, D. V., & Vasic, B. V. (2013). An efficient exhaustive low-weight codeword search for structured LDPC codes. In 2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings (pp. 401-410). [6502981] https://doi.org/10.1109/ITA.2013.6502981

An efficient exhaustive low-weight codeword search for structured LDPC codes. / Khatami, Seyed Mehrdad; Danjean, Ludovic; Nguyen, Dung V.; Vasic, Bane V.

2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings. 2013. p. 401-410 6502981.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Khatami, SM, Danjean, L, Nguyen, DV & Vasic, BV 2013, An efficient exhaustive low-weight codeword search for structured LDPC codes. in 2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings., 6502981, pp. 401-410, 2013 Information Theory and Applications Workshop, ITA 2013, San Diego, CA, United States, 2/10/13. https://doi.org/10.1109/ITA.2013.6502981
Khatami SM, Danjean L, Nguyen DV, Vasic BV. An efficient exhaustive low-weight codeword search for structured LDPC codes. In 2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings. 2013. p. 401-410. 6502981 https://doi.org/10.1109/ITA.2013.6502981
Khatami, Seyed Mehrdad ; Danjean, Ludovic ; Nguyen, Dung V. ; Vasic, Bane V. / An efficient exhaustive low-weight codeword search for structured LDPC codes. 2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings. 2013. pp. 401-410
@inproceedings{90484e8f4c3a46329695f20c0cbd1d59,
title = "An efficient exhaustive low-weight codeword search for structured LDPC codes",
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.",
author = "Khatami, {Seyed Mehrdad} and Ludovic Danjean and Nguyen, {Dung V.} and Vasic, {Bane V}",
year = "2013",
doi = "10.1109/ITA.2013.6502981",
language = "English (US)",
pages = "401--410",
booktitle = "2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings",

}

TY - GEN

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

AU - Khatami, Seyed Mehrdad

AU - Danjean, Ludovic

AU - Nguyen, Dung V.

AU - Vasic, Bane V

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84877650437&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84877650437&partnerID=8YFLogxK

U2 - 10.1109/ITA.2013.6502981

DO - 10.1109/ITA.2013.6502981

M3 - Conference contribution

AN - SCOPUS:84877650437

SP - 401

EP - 410

BT - 2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings

ER -