Fast decoding of codes from algebraic plane curves

Publication: Research - peer-reviewJournal article – Annual report year: 1992

Standard

Fast decoding of codes from algebraic plane curves. / Justesen, Jørn; Larsen, Knud J.; Jensen, Helge Elbrønd; Høholdt, Tom.

In: I E E E Transactions on Information Theory, Vol. 38, No. 1, 1992, p. 111-119.

Publication: Research - peer-reviewJournal article – Annual report year: 1992

Harvard

APA

CBE

MLA

Vancouver

Author

Justesen, Jørn; Larsen, Knud J.; Jensen, Helge Elbrønd; Høholdt, Tom / Fast decoding of codes from algebraic plane curves.

In: I E E E Transactions on Information Theory, Vol. 38, No. 1, 1992, p. 111-119.

Publication: Research - peer-reviewJournal article – Annual report year: 1992

Bibtex

@article{c361cd4ef23b4481ae2b484c072621ce,
title = "Fast decoding of codes from algebraic plane curves",
publisher = "I E E E",
author = "Jørn Justesen and Larsen, {Knud J.} and Jensen, {Helge Elbrønd} and Tom Hø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",
volume = "38",
number = "1",
pages = "111--119",
journal = "I E E E Transactions on Information Theory",
issn = "0018-9448",

}

RIS

TY - JOUR

T1 - Fast decoding of codes from algebraic plane curves

A1 - Justesen,Jørn

A1 - Larsen,Knud J.

A1 - Jensen,Helge Elbrønd

A1 - Høholdt,Tom

AU - Justesen,Jørn

AU - Larsen,Knud J.

AU - Jensen,Helge Elbrønd

AU - Høholdt,Tom

PB - I E E E

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

JO - I E E E Transactions on Information Theory

JF - I E E E Transactions on Information Theory

SN - 0018-9448

IS - 1

VL - 38

SP - 111

EP - 119

ER -