Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

Longer titles found: Guruswami–Sudan list decoding algorithm (view)

searching for List decoding 5 found (19 total)

alternate case: list decoding

Polar code (coding theory) (1,308 words) [view diff] exact match in snippet view article

code. Polar performance can be improved with successive cancellation list decoding, but its usability in real applications is still questionable due to
Judy L. Walker (648 words) [view diff] exact match in snippet view article find links to article
Alice; Staddon, Jessica; Walker, Judy L. (2003), "Applications of list decoding to tracing traitors", IEEE Transactions on Information Theory, 49 (5):
McEliece cryptosystem (2,092 words) [view diff] exact match in snippet view article find links to article
1632 , k = 1269 , t = 34 {\displaystyle n=1632,k=1269,t=34} when using list decoding for the Goppa code, giving rise to public key sizes of 520047 and 460647 bits
Binary Goppa code (1,154 words) [view diff] exact match in snippet view article find links to article
Previous version: http://eprint.iacr.org/2006/162/ Daniel J. Bernstein. "List decoding for binary Goppa codes." http://cr.yp.to/codes/goppalist-20110303.pdf
Locally decodable code (3,060 words) [view diff] exact match in snippet view article find links to article
Local list decoders are another interesting subset of local decoders. List decoding is useful when a codeword is corrupted in more than δ / 2 {\displaystyle