DocumentCode
3274989
Title
A maximum likelihood polynomial time syndrome decoder to correct linearly independent errors
Author
Horn, Gavin B. ; Karp, Richard M.
Author_Institution
Digital Fountain, Fremont, CA, USA
fYear
2001
fDate
2001
Firstpage
87
Abstract
It is shown for a linear code over F 2L, defined by a binary parity matrix H, that the minimum weight error vector e associated with a syndrome s can be computed in polynomial time if the nonzero elements of the error vector are linearly independent over F 2L
Keywords
error correction; linear codes; maximum likelihood decoding; polynomials; binary parity matrix; error correction; linear code; linearly independent errors; maximum likelihood syndrome decoder; minimum weight error vector; polynomial time; Error correction; Error correction codes; Hamming weight; Helium; Linear code; Maximum likelihood decoding; Parity check codes; Polynomials; Symmetric matrices; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location
Washington, DC
Print_ISBN
0-7803-7123-2
Type
conf
DOI
10.1109/ISIT.2001.935950
Filename
935950
Link To Document