Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > OSCAR SPRUMONT:
All reports by Author Oscar Sprumont:

TR22-012 | 2nd February 2022
Anup Rao, Oscar Sprumont

On List Decoding Transitive Codes From Random Errors

We study the error resilience of transitive linear codes over $F_2$. We give tight bounds on the weight distribution of every such code $C$, and we show how these bounds can be used to infer bounds on the error rates that $C$ can tolerate on the binary symmetric channel. Using ... more >>>




ISSN 1433-8092 | Imprint