Euclidean Geometry Codes, minimum weight words and decodable error-patterns using bit-flipping

Tom Høholdt, Jørn Justesen, Bergtor Jonsson

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

488 Downloads (Pure)

Abstract

We determine the number of minimum wigth words in a class of Euclidean Geometry codes and link the performance of the bit-flipping decoding algorithm to the geometry of the error patterns.
Original languageEnglish
Title of host publicationProceedings of the 2005 IEEE International Symposium on Information Theory
Place of PublicationAdelaide, Australia
PublisherIEEE
Publication date2005
ISBN (Print)0-7803-9151-9
DOIs
Publication statusPublished - 2005
Event2005 IEEE International Symposium on Information Theory - Adelaide, Australia
Duration: 4 Sep 20059 Sep 2005
http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=10215

Conference

Conference2005 IEEE International Symposium on Information Theory
CountryAustralia
CityAdelaide
Period04/09/200509/09/2005
Internet address

Bibliographical note

Copyright: 2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

Fingerprint Dive into the research topics of 'Euclidean Geometry Codes, minimum weight words and decodable error-patterns using bit-flipping'. Together they form a unique fingerprint.

Cite this