On graphical representations of algebraic codes suitable for iterative decoding

Vidya Kumar; Olgica Milenkovic

doi:10.1109/LCOMM.2005.1496597

On graphical representations of algebraic codes suitable for iterative decoding

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

Abstract

In this paper, we describe two novel modifications of an algorithm for deriving sparse parity-check matrix representations of classical binary and non-binary algebraic codes. The proposed sparse representations are obtained by introducing a small number of auxiliary variables and check-equations that lead to Tanner graphs without four-cycles. When used with iterative decoding, the developed code representations show significant gain in performance when compared to other known description techniques.

Original language	English (US)
Pages (from-to)	729-731
Number of pages	3
Journal	IEEE Communications Letters
Volume	9
Issue number	8
DOIs	https://doi.org/10.1109/LCOMM.2005.1496597
State	Published - Aug 1 2005
Externally published	Yes

Keywords

Algebraic codes
Four-cycles
Iterative decoding

ASJC Scopus subject areas

Modeling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2005.1496597

Fingerprint Dive into the research topics of 'On graphical representations of algebraic codes suitable for iterative decoding'. Together they form a unique fingerprint.

Cite this

@article{1d5b639097bb49008d7dd19d074d5fac,

title = "On graphical representations of algebraic codes suitable for iterative decoding",

abstract = "In this paper, we describe two novel modifications of an algorithm for deriving sparse parity-check matrix representations of classical binary and non-binary algebraic codes. The proposed sparse representations are obtained by introducing a small number of auxiliary variables and check-equations that lead to Tanner graphs without four-cycles. When used with iterative decoding, the developed code representations show significant gain in performance when compared to other known description techniques.",

keywords = "Algebraic codes, Four-cycles, Iterative decoding",

author = "Vidya Kumar and Olgica Milenkovic",

year = "2005",

month = aug,

day = "1",

doi = "10.1109/LCOMM.2005.1496597",

language = "English (US)",

volume = "9",

pages = "729--731",

journal = "IEEE Communications Letters",

issn = "1089-7798",

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

number = "8",

}

TY - JOUR

T1 - On graphical representations of algebraic codes suitable for iterative decoding

AU - Kumar, Vidya

AU - Milenkovic, Olgica

PY - 2005/8/1

Y1 - 2005/8/1

N2 - In this paper, we describe two novel modifications of an algorithm for deriving sparse parity-check matrix representations of classical binary and non-binary algebraic codes. The proposed sparse representations are obtained by introducing a small number of auxiliary variables and check-equations that lead to Tanner graphs without four-cycles. When used with iterative decoding, the developed code representations show significant gain in performance when compared to other known description techniques.

AB - In this paper, we describe two novel modifications of an algorithm for deriving sparse parity-check matrix representations of classical binary and non-binary algebraic codes. The proposed sparse representations are obtained by introducing a small number of auxiliary variables and check-equations that lead to Tanner graphs without four-cycles. When used with iterative decoding, the developed code representations show significant gain in performance when compared to other known description techniques.

KW - Algebraic codes

KW - Four-cycles

KW - Iterative decoding

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

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

U2 - 10.1109/LCOMM.2005.1496597

DO - 10.1109/LCOMM.2005.1496597

M3 - Article

AN - SCOPUS:27644543256

VL - 9

SP - 729

EP - 731

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 8

ER -