Non-linear codes for belief propagation

E. Byrne; C. Kelley; C. Monico; J. Rosenthal

doi:10.1109/isit.2003.1228057

Non-linear codes for belief propagation

E. Byrne, C. Kelley, C. Monico, J. Rosenthal

Mathematics and Statistics

Research output: Contribution to journal › Conference article › peer-review

Abstract

We consider codes defined by a system of sparse polynomial parity check equations in F₂[x₁,⋯,X_n]. We suggest that, defined in the right way, such codes admit an encoding comparable in efficiency with their linear counterparts (LDPC codes), and are suitable for iterative decoding.

Original language	English
Pages (from-to)	43
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
DOIs	https://doi.org/10.1109/isit.2003.1228057
State	Published - 2003
Event	Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan Duration: Jun 29 2003 → Jul 4 2003

Access to Document

10.1109/isit.2003.1228057

Cite this

@article{ebcc8293bbae49cb8a2d843a21ccee9a,

title = "Non-linear codes for belief propagation",

abstract = "We consider codes defined by a system of sparse polynomial parity check equations in F2[x1,⋯,Xn]. We suggest that, defined in the right way, such codes admit an encoding comparable in efficiency with their linear counterparts (LDPC codes), and are suitable for iterative decoding.",

author = "E. Byrne and C. Kelley and C. Monico and J. Rosenthal",

year = "2003",

doi = "10.1109/isit.2003.1228057",

language = "English",

pages = "43",

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

issn = "2157-8096",

note = "Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) ; Conference date: 29-06-2003 Through 04-07-2003",

}

TY - JOUR

T1 - Non-linear codes for belief propagation

AU - Byrne, E.

AU - Kelley, C.

AU - Monico, C.

AU - Rosenthal, J.

PY - 2003

Y1 - 2003

N2 - We consider codes defined by a system of sparse polynomial parity check equations in F2[x1,⋯,Xn]. We suggest that, defined in the right way, such codes admit an encoding comparable in efficiency with their linear counterparts (LDPC codes), and are suitable for iterative decoding.

AB - We consider codes defined by a system of sparse polynomial parity check equations in F2[x1,⋯,Xn]. We suggest that, defined in the right way, such codes admit an encoding comparable in efficiency with their linear counterparts (LDPC codes), and are suitable for iterative decoding.

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

U2 - 10.1109/isit.2003.1228057

DO - 10.1109/isit.2003.1228057

M3 - Conference article

AN - SCOPUS:0141973890

SN - 2157-8096

SP - 43

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

T2 - Proceedings 2003 IEEE International Symposium on Information Theory (ISIT)

Y2 - 29 June 2003 through 4 July 2003

ER -

Non-linear codes for belief propagation

Abstract

Access to Document

Other files and links

Fingerprint

Cite this