On Tanner Codes: Minimum Distance and Decoding |
| |
| Authors: | H Janwa A K Lal |
| |
| Affiliation: | (1) Department of Mathematics and Computer Science, University of Puerto Rico, Rio Piedras Campus, PO Box: 23355, San Juan, PR 00931-3355, USA (e-mail: {\hjanwa,arlal}@rrpac.upr.clu.edu), US |
| |
| Abstract: | A bound on the minimum distance of Tanner codes / expander codes of Sipser and Spielman is obtained. Furthermore, a generalization
of a decoding algorithm of Zémor to Tanner codes is presented. The algorithm can be implemented using the same complexity
as that of Zémor and has a similar error-correction capability. Explicit families of Tanner codes are presented for which
the decoding algorithm is applicable.
Received: March 2, 2001; revised version: November 28, 2001
Key words: Tanner codes, Expander codes, LDPC codes, Decoding, Minimum distance, Expander graphs, Ramanujan graphs, N-gons, Multi-partite
graphs. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
