Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes

David Burshtein; Idan Goldenberg

doi:https://doi.org/10.1109/ISIT.2011.6033739

Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes

David Burshtein, Idan Goldenberg

School of Electrical Engineering

Tel Aviv University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

A method which obtains a tight lower bound on the fractional distance of LDPC codes is proposed. This algorithm exhibits complexity which scales quadratically with the block length, and thus less than currently-known methods. We also show how the fundamental LP polytope for generalized LDPC codes and nonbinary LDPC codes can be obtained.

Original language	English
Title of host publication	2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Pages	1263-1267
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2011.6033739
State	Published - 2011
Event	2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation Duration: 31 Jul 2011 → 5 Aug 2011

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings

Conference

Conference	2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Country/Territory	Russian Federation
City	St. Petersburg
Period	31/07/11 → 5/08/11

Keywords

Linear programming decoding
fractional distance
fundamental polytope
low-density parity-check (LDPC) codes

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

https://doi.org/10.1109/ISIT.2011.6033739

Cite this

Burshtein, D., & Goldenberg, I. (2011). Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes. In 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 (pp. 1263-1267). Article 6033739 (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2011.6033739

@inproceedings{79d1f1fb60c543ba94d740f46fdc4d83,

title = "Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes",

abstract = "A method which obtains a tight lower bound on the fractional distance of LDPC codes is proposed. This algorithm exhibits complexity which scales quadratically with the block length, and thus less than currently-known methods. We also show how the fundamental LP polytope for generalized LDPC codes and nonbinary LDPC codes can be obtained.",

keywords = "Linear programming decoding, fractional distance, fundamental polytope, low-density parity-check (LDPC) codes",

author = "David Burshtein and Idan Goldenberg",

year = "2011",

doi = "https://doi.org/10.1109/ISIT.2011.6033739",

language = "الإنجليزيّة",

isbn = "9781457705953",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1263--1267",

booktitle = "2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011",

note = "2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 ; Conference date: 31-07-2011 Through 05-08-2011",

}

Burshtein, D & Goldenberg, I 2011, Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes. in 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011., 6033739, IEEE International Symposium on Information Theory - Proceedings, pp. 1263-1267, 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, Russian Federation, 31/07/11. https://doi.org/10.1109/ISIT.2011.6033739

Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes. / Burshtein, David; Goldenberg, Idan.
2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011. 2011. p. 1263-1267 6033739 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes

AU - Burshtein, David

AU - Goldenberg, Idan

PY - 2011

Y1 - 2011

N2 - A method which obtains a tight lower bound on the fractional distance of LDPC codes is proposed. This algorithm exhibits complexity which scales quadratically with the block length, and thus less than currently-known methods. We also show how the fundamental LP polytope for generalized LDPC codes and nonbinary LDPC codes can be obtained.

AB - A method which obtains a tight lower bound on the fractional distance of LDPC codes is proposed. This algorithm exhibits complexity which scales quadratically with the block length, and thus less than currently-known methods. We also show how the fundamental LP polytope for generalized LDPC codes and nonbinary LDPC codes can be obtained.

KW - Linear programming decoding

KW - fractional distance

KW - fundamental polytope

KW - low-density parity-check (LDPC) codes

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

U2 - https://doi.org/10.1109/ISIT.2011.6033739

DO - https://doi.org/10.1109/ISIT.2011.6033739

M3 - منشور من مؤتمر

SN - 9781457705953

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1263

EP - 1267

BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

Y2 - 31 July 2011 through 5 August 2011

ER -

Burshtein D, Goldenberg I. Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes. In 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011. 2011. p. 1263-1267. 6033739. (IEEE International Symposium on Information Theory - Proceedings). doi: https://doi.org/10.1109/ISIT.2011.6033739

Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this