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

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

doi:10.1109/ISIT.2005.1523731

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 proceeding › Article in proceedings › Research › peer-review

693 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 language	English
Title of host publication	Proceedings of the 2005 IEEE International Symposium on Information Theory
Place of Publication	Adelaide, Australia
Publisher	IEEE
Publication date	2005
ISBN (Print)	0-7803-9151-9
DOIs	https://doi.org/10.1109/ISIT.2005.1523731
Publication status	Published - 2005
Event	2005 IEEE International Symposium on Information Theory - Adelaide, Australia Duration: 4 Sept 2005 → 9 Sept 2005 http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=10215

Conference

Conference	2005 IEEE International Symposium on Information Theory
Country/Territory	Australia
City	Adelaide
Period	04/09/2005 → 09/09/2005
Internet address	http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=10215

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

Access to Document

10.1109/ISIT.2005.1523731

HøholdtFinal published version, 191 KB

OpenUrl availability

Full text

Cite this

@inproceedings{ed4be4ee788543b1bdc8bc0c424e055c,

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

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.",

author = "Tom H{\o}holdt and J{\o}rn Justesen and Bergtor Jonsson",

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; 2005 IEEE International Symposium on Information Theory, ISIT 2005 ; Conference date: 04-09-2005 Through 09-09-2005",

year = "2005",

doi = "10.1109/ISIT.2005.1523731",

language = "English",

isbn = "0-7803-9151-9",

booktitle = "Proceedings of the 2005 IEEE International Symposium on Information Theory",

publisher = "IEEE",

address = "United States",

url = "http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=10215",

}

Høholdt, T, Justesen, J & Jonsson, B 2005, Euclidean Geometry Codes, minimum weight words and decodable error-patterns using bit-flipping. in Proceedings of the 2005 IEEE International Symposium on Information Theory. IEEE, Adelaide, Australia, 2005 IEEE International Symposium on Information Theory, Adelaide, South Australia, Australia, 04/09/2005. https://doi.org/10.1109/ISIT.2005.1523731

Euclidean Geometry Codes, minimum weight words and decodable error-patterns using bit-flipping. / Høholdt, Tom; Justesen, Jørn; Jonsson, Bergtor.
Proceedings of the 2005 IEEE International Symposium on Information Theory. Adelaide, Australia: IEEE, 2005.

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

TY - GEN

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

AU - Høholdt, Tom

AU - Justesen, Jørn

AU - Jonsson, Bergtor

N1 - 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

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

U2 - 10.1109/ISIT.2005.1523731

DO - 10.1109/ISIT.2005.1523731

M3 - Article in proceedings

SN - 0-7803-9151-9

BT - Proceedings of the 2005 IEEE International Symposium on Information Theory

PB - IEEE

CY - Adelaide, Australia

T2 - 2005 IEEE International Symposium on Information Theory

Y2 - 4 September 2005 through 9 September 2005

ER -

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

Abstract

Conference

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this