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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 45th Allerton Conference on Communication, Control and Computing |
| Place of Publication | Allerton, USA |
| Publication date | 2005 |
| Publication status | Published - 2005 |
| Event | 45th Allerton Conference on Communication, Control and Computing - Allerton. USA Duration: 1 Jan 2005 → … Conference number: 45 |
Conference
| Conference | 45th Allerton Conference on Communication, Control and Computing |
|---|---|
| Number | 45 |
| City | Allerton. USA |
| Period | 01/01/2005 → … |