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.
|Number of pages||1|
|Journal||IEEE International Symposium on Information Theory - Proceedings|
|State||Published - Oct 20 2003|
|Event||Proceedings 2003 IEEE International Symposium on Information Theory (ISIT) - Yokohama, Japan|
Duration: Jun 29 2003 → Jul 4 2003