Complete ML Decoding orf the (73,45) PG Code

Jørn Justesen, Tom Høholdt, Johan Hjaltason

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    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 languageEnglish
    Title of host publicationProceedings of the 45th Allerton Conference on Communication, Control and Computing
    Place of PublicationAllerton, USA
    Publication date2005
    Publication statusPublished - 2005
    Event45th Allerton Conference on Communication, Control and Computing - Monticello, United States
    Duration: 26 Sept 200728 Sept 2007
    Conference number: 45

    Conference

    Conference45th Allerton Conference on Communication, Control and Computing
    Number45
    Country/TerritoryUnited States
    CityMonticello
    Period26/09/200728/09/2007

    Cite this