CiteULike is a free online bibliography manager. Register and you can start organising your references online.
Tags

On Tanner Codes: Minimum Distance and Decoding

by: H. Janwa, A. K. Lal
In Applicable Algebra in Engineering, Communication and Computing, Vol. 13, No. 5. (2003), pp. 335-347, doi:10.1007/s00200-003-0098-4  Key: citeulike:12007641

Formatted Citation


Show HTML

Likes (beta)

This copy of the article hasn't been liked by anyone yet.

View FullText article


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.


bhemen's tags for this article

Citations (CiTO)

No CiTO relationships defined

X There are no reviews yet

X Find related articles with these CiteULike tags

X Posting History


X Export records

Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.