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 language | English (US) |
---|---|
Pages (from-to) | 43 |
Number of pages | 1 |
Journal | IEEE International Symposium on Information Theory - Proceedings |
DOIs | |
State | Published - 2003 |
Externally published | Yes |
Event | Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan Duration: Jun 29 2003 → Jul 4 2003 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics