MacKay, DJC and Postol, MS (2003) Weaknesses of margulis and ramanujan-margulis low-density parity-check codes. Electronic Notes in Theoretical Computer Science, 74. pp. 97-104. ISSN 1571-0661Full text not available from this repository.
We report weaknesses in two algebraic constructions of low-density parity-check codes based on expander graphs. The Margulis construction gives a code with near-codewords, which cause problems for the sum-product decoder; The Ramanujan-Margulis construction gives a code with low-weight codewords, which produce an error-floor. ©2003 Published by Elsevier Science B. V.
|Divisions:||Div F > Machine Intelligence|
|Depositing User:||Unnamed user with email email@example.com|
|Date Deposited:||16 Jul 2015 13:39|
|Last Modified:||03 Sep 2015 22:19|