Braided Block Codes

Alberto Jimenez Feltström; Dmitri Truhachev; Michael Lentmaier; Kamil Zigangirov

doi:10.1109/TIT.2009.2018350

Braided Block Codes

Alberto Jimenez Feltström, Dmitri Truhachev, Michael Lentmaier, Kamil Zigangirov

Department of Electrical and Information Technology

Research output: Contribution to journal › Article › peer-review

53 Citations (SciVal)

Abstract

A new class of binary iteratively decodable codes with good decoding performance is presented. These codes, called braided block codes (BBCs), operate on continuous data streams and are constructed by interconnection of two component block codes. BBCs can be considered as convolutional (or sliding) version of either Elias' product codes or expander codes. In this paper, we define BBCs, describe methods of their construction, analyze code properties, and study asymptotic iterative decoding performance.

Original language	English
Pages (from-to)	2640-2658
Journal	IEEE Transactions on Information Theory
Volume	55
Issue number	6
DOIs	https://doi.org/10.1109/TIT.2009.2018350
Publication status	Published - 2009

Subject classification (UKÄ)

Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

spatial coupling
braided codes
braided block codes
generalized LDPC codes
GLDPC codes

Access to Document

10.1109/TIT.2009.2018350

Cite this

@article{9b6fdc341448460e9df7589c7fa1c0b7,

title = "Braided Block Codes",

abstract = "A new class of binary iteratively decodable codes with good decoding performance is presented. These codes, called braided block codes (BBCs), operate on continuous data streams and are constructed by interconnection of two component block codes. BBCs can be considered as convolutional (or sliding) version of either Elias' product codes or expander codes. In this paper, we define BBCs, describe methods of their construction, analyze code properties, and study asymptotic iterative decoding performance.",

keywords = "spatial coupling, braided codes, braided block codes, generalized LDPC codes, GLDPC codes",

author = "{Jimenez Feltstr{\"o}m}, Alberto and Dmitri Truhachev and Michael Lentmaier and Kamil Zigangirov",

year = "2009",

doi = "10.1109/TIT.2009.2018350",

language = "English",

volume = "55",

pages = "2640--2658",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "IEEE - Institute of Electrical and Electronics Engineers Inc.",

number = "6",

}

TY - JOUR

T1 - Braided Block Codes

AU - Jimenez Feltström, Alberto

AU - Truhachev, Dmitri

AU - Lentmaier, Michael

AU - Zigangirov, Kamil

PY - 2009

Y1 - 2009

N2 - A new class of binary iteratively decodable codes with good decoding performance is presented. These codes, called braided block codes (BBCs), operate on continuous data streams and are constructed by interconnection of two component block codes. BBCs can be considered as convolutional (or sliding) version of either Elias' product codes or expander codes. In this paper, we define BBCs, describe methods of their construction, analyze code properties, and study asymptotic iterative decoding performance.

AB - A new class of binary iteratively decodable codes with good decoding performance is presented. These codes, called braided block codes (BBCs), operate on continuous data streams and are constructed by interconnection of two component block codes. BBCs can be considered as convolutional (or sliding) version of either Elias' product codes or expander codes. In this paper, we define BBCs, describe methods of their construction, analyze code properties, and study asymptotic iterative decoding performance.

KW - spatial coupling

KW - braided codes

KW - braided block codes

KW - generalized LDPC codes

KW - GLDPC codes

U2 - 10.1109/TIT.2009.2018350

DO - 10.1109/TIT.2009.2018350

M3 - Article

VL - 55

SP - 2640

EP - 2658

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 6

ER -

Braided Block Codes

Abstract

Subject classification (UKÄ)

Keywords

Access to Document

Fingerprint

Cite this