Non-linear codes for belief propagation

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

Research output: Contribution to journalConference article

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.

Original languageEnglish (US)
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - Oct 20 2003
EventProceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan
Duration: Jun 29 2003Jul 4 2003

Fingerprint

Iterative decoding
Belief Propagation
Polynomials
Sparse Polynomials
Iterative Decoding
LDPC Codes
Linear Codes
Parity
Encoding

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Non-linear codes for belief propagation. / Byrne, E.; Kelley, Christine A; Monico, C.; Rosenthal, J.

In: IEEE International Symposium on Information Theory - Proceedings, 20.10.2003.

Research output: Contribution to journalConference article

@article{b82e462be42740a8abcdcc6dba0bd34f,
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 Kelley, {Christine A} and C. Monico and J. Rosenthal",
year = "2003",
month = "10",
day = "20",
language = "English (US)",
journal = "IEEE International Symposium on Information Theory - Proceedings",
issn = "2157-8097",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Non-linear codes for belief propagation

AU - Byrne, E.

AU - Kelley, Christine A

AU - Monico, C.

AU - Rosenthal, J.

PY - 2003/10/20

Y1 - 2003/10/20

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

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

M3 - Conference article

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8097

ER -