Fast decoding of codes from algebraic plane curves

Jørn Justesen; Knud J. Larsen; Helge Elbrønd Jensen; Tom Høholdt

doi:10.1109/18.108255

Fast decoding of codes from algebraic plane curves

Jørn Justesen, Knud J. Larsen, Helge Elbrønd Jensen, Tom Høholdt

Research output: Contribution to journal › Journal article › Research › peer-review

716 Downloads (Pure)

Abstract

Improvement to an earlier decoding algorithm for codes from algebraic geometry is presented. For codes from an arbitrary regular plane curve the authors correct up to d*/2-m2 /8+m/4-9/8 errors, where d* is the designed distance of the code and m is the degree of the curve. The complexity of finding the error locator is O(n7/3 ), where n is the length of the code. For codes from Hermitian curves the complexity of finding the error values, given the error locator, is O(n2), and the same complexity can be obtained in the general case if only d*/2-m2/2 errors are corrected

Original language	English
Journal	I E E E Transactions on Information Theory
Volume	38
Issue number	1
Pages (from-to)	111-119
ISSN	0018-9448
DOIs	https://doi.org/10.1109/18.108255
Publication status	Published - 1992

Bibliographical note

Copyright: 1992 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/18.108255

JustesenFinal published version, 751 KB

OpenUrl availability

Full text

Cite this

@article{c361cd4ef23b4481ae2b484c072621ce,

title = "Fast decoding of codes from algebraic plane curves",

abstract = "Improvement to an earlier decoding algorithm for codes from algebraic geometry is presented. For codes from an arbitrary regular plane curve the authors correct up to d*/2-m2 /8+m/4-9/8 errors, where d* is the designed distance of the code and m is the degree of the curve. The complexity of finding the error locator is O(n7/3 ), where n is the length of the code. For codes from Hermitian curves the complexity of finding the error values, given the error locator, is O(n2), and the same complexity can be obtained in the general case if only d*/2-m2/2 errors are corrected",

author = "J{\o}rn Justesen and Larsen, {Knud J.} and Jensen, {Helge Elbr{\o}nd} and Tom H{\o}holdt",

note = "Copyright: 1992 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",

year = "1992",

doi = "10.1109/18.108255",

language = "English",

volume = "38",

pages = "111--119",

journal = "I E E E Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "1",

}

TY - JOUR

T1 - Fast decoding of codes from algebraic plane curves

AU - Justesen, Jørn

AU - Larsen, Knud J.

AU - Jensen, Helge Elbrønd

AU - Høholdt, Tom

N1 - Copyright: 1992 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 - 1992

Y1 - 1992

N2 - Improvement to an earlier decoding algorithm for codes from algebraic geometry is presented. For codes from an arbitrary regular plane curve the authors correct up to d*/2-m2 /8+m/4-9/8 errors, where d* is the designed distance of the code and m is the degree of the curve. The complexity of finding the error locator is O(n7/3 ), where n is the length of the code. For codes from Hermitian curves the complexity of finding the error values, given the error locator, is O(n2), and the same complexity can be obtained in the general case if only d*/2-m2/2 errors are corrected

AB - Improvement to an earlier decoding algorithm for codes from algebraic geometry is presented. For codes from an arbitrary regular plane curve the authors correct up to d*/2-m2 /8+m/4-9/8 errors, where d* is the designed distance of the code and m is the degree of the curve. The complexity of finding the error locator is O(n7/3 ), where n is the length of the code. For codes from Hermitian curves the complexity of finding the error values, given the error locator, is O(n2), and the same complexity can be obtained in the general case if only d*/2-m2/2 errors are corrected

U2 - 10.1109/18.108255

DO - 10.1109/18.108255

M3 - Journal article

SN - 0018-9448

VL - 38

SP - 111

EP - 119

JO - I E E E Transactions on Information Theory

JF - I E E E Transactions on Information Theory

IS - 1

ER -

Fast decoding of codes from algebraic plane curves

Abstract

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this