Skip to main content
SpringerLink
Log in

On Tanner Codes: Minimum Distance and Decoding

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

  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

    H. Janwa & A. K. Lal

Authors
  1. H. Janwa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. K. Lal
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

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.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Janwa, H., Lal, A. On Tanner Codes: Minimum Distance and Decoding. AAECC 13, 335–347 (2003). https://doi.org/10.1007/s00200-003-0098-4

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-003-0098-4

Keywords

Search

Navigation