This refers to Reeda#39;s elegant Majority Logic Decoder, which solves the unique- decoding problem up to error rate ... up to error rate 2_(r+1) _ Ap_ Following the seminal work of Goldreich-Levin [11], other list-decoders for Hadamard codes wereanbsp;...
Title | : | 40th Acm International Symposium on Theory of Computing (Stoc 08) |
Author | : | Association for Computing Machinery (Acm) |
Publisher | : | Curran Associates Inc - 2008-11-08 |
You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.
Once you have finished the sign-up process, you will be redirected to your download Book page.
How it works: