## Fast decoding of codes from algebraic plane curves

Publication: Research - peer-review › Journal 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.

Publication: Research - peer-review › Journal article – Annual report year: 1992

### Harvard

*I E E E Transactions on Information Theory*, vol 38, no. 1, pp. 111-119. DOI: 10.1109/18.108255

### APA

*Fast decoding of codes from algebraic plane curves*.

*I E E E Transactions on Information Theory*,

*38*(1), 111-119. DOI: 10.1109/18.108255

### CBE

### MLA

*I E E E Transactions on Information Theory*. 1992, 38(1). 111-119. Available: 10.1109/18.108255

### Vancouver

### Author

### Bibtex

}

### RIS

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

VL - 38

SP - 111

EP - 119

JO - I E E E Transactions on Information Theory

T2 - I E E E Transactions on Information Theory

JF - I E E E Transactions on Information Theory

SN - 0018-9448

IS - 1

ER -