Linear programming decoding of spatially coupled codes

Author

Bazzi, Louay ; Ghazi, Badih ; Urbanke, Rudiger

Author_Institution

Dept. of Electr. & Comput. Eng., American Univ. of Beirut, Beirut, Lebanon

fYear

2013

fDate

7-12 July 2013

Firstpage

1486

Lastpage

1490

Abstract

For a given family of spatially coupled codes, we prove that the LP threshold on the BSC of the tail-biting graph cover ensemble is the same as the LP threshold on the BSC of the derived spatially coupled ensemble. This result is in contrast with the fact that the BP threshold of the derived spatially coupled ensemble is believed to be larger than the BP threshold of the tail-biting graph cover ensemble [1], [2].

Keywords

binary codes; graph theory; linear codes; linear programming; BP threshold; BSC; LP threshold; binary linear code; linear programming decoding; spatially coupled codes; spatially coupled ensemble; tail-biting graph cover ensemble; Iterative decoding; Linear codes; Linear programming; Maximum likelihood decoding;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on

Conference_Location

Istanbul

ISSN

2157-8095

Type

conf

DOI

10.1109/ISIT.2013.6620474

Filename

6620474

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=640136