Conference paper
Complete ML Decoding orf the (73,45) PG Code
In
Proceedings of the 45th Allerton Conference on Communication, Control and Computing
—
2005
Abstract
Our recent proof of the completeness of decoding by list bit flipping is reviewed. The proof is based on an enumeration of all cosets of low weight in terms of their minimum weight and syndrome weight. By using a geometric description of the error patterns we characterize all remaining cosets.
| Language: | English |
|---|---|
| Year: | 2005 |
| Proceedings: | 45th Allerton Conference on Communication, Control and Computing |
| Types: | Conference paper |
