Non-linear codes for belief propagation

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

Research output: Contribution to journalConference articlepeer-review

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)
Pages (from-to)43
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
DOIs
StatePublished - 2003
EventProceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan
Duration: Jun 29 2003Jul 4 2003

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Non-linear codes for belief propagation'. Together they form a unique fingerprint.

Cite this