By Topic

A maximum likelihood polynomial time syndrome decoder to correct linearly independent errors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Horn, G.B. ; Digital Fountain, Fremont, CA, USA ; Karp, Richard M.

It is shown for a linear code over F2L, 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 F2L

Published in:

Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on

Date of Conference:

2001