On a decoding algorithm for codes on maximal curves

G.R. Pellikaan

doi:10.1109/18.45279

On a decoding algorithm for codes on maximal curves

G.R. Pellikaan

Discrete Mathematics

Research output: Contribution to journal › Article › Academic › peer-review

41 Citations (Scopus)

Abstract

A decoding algorithm for algebraic geometric codes that was given by A.N. Skorobogatov and S.G. Vladut (preprint, Inst. Problems of Information Transmission, 1988) is considered. The author gives a modified algorithm, with improved performance, which he obtains by applying the above algorithm a number of times in parallel. He proves the existence of the decoding algorithm on maximal curves by showing the existence of certain divisors. However, he has so far been unable to give an efficient procedure of finding these divisors.

Original language	English
Pages (from-to)	1228-1232
Journal	IEEE Transactions on Information Theory
Volume	35
Issue number	6
DOIs	https://doi.org/10.1109/18.45279
Publication status	Published - 1989

Access to Document

10.1109/18.45279

Cite this

@article{854f59b2aa80406e95d7330547208435,

title = "On a decoding algorithm for codes on maximal curves",

abstract = "A decoding algorithm for algebraic geometric codes that was given by A.N. Skorobogatov and S.G. Vladut (preprint, Inst. Problems of Information Transmission, 1988) is considered. The author gives a modified algorithm, with improved performance, which he obtains by applying the above algorithm a number of times in parallel. He proves the existence of the decoding algorithm on maximal curves by showing the existence of certain divisors. However, he has so far been unable to give an efficient procedure of finding these divisors.",

author = "G.R. Pellikaan",

year = "1989",

doi = "10.1109/18.45279",

language = "English",

volume = "35",

pages = "1228--1232",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "6",

}

TY - JOUR

T1 - On a decoding algorithm for codes on maximal curves

AU - Pellikaan, G.R.

PY - 1989

Y1 - 1989

N2 - A decoding algorithm for algebraic geometric codes that was given by A.N. Skorobogatov and S.G. Vladut (preprint, Inst. Problems of Information Transmission, 1988) is considered. The author gives a modified algorithm, with improved performance, which he obtains by applying the above algorithm a number of times in parallel. He proves the existence of the decoding algorithm on maximal curves by showing the existence of certain divisors. However, he has so far been unable to give an efficient procedure of finding these divisors.

AB - A decoding algorithm for algebraic geometric codes that was given by A.N. Skorobogatov and S.G. Vladut (preprint, Inst. Problems of Information Transmission, 1988) is considered. The author gives a modified algorithm, with improved performance, which he obtains by applying the above algorithm a number of times in parallel. He proves the existence of the decoding algorithm on maximal curves by showing the existence of certain divisors. However, he has so far been unable to give an efficient procedure of finding these divisors.

U2 - 10.1109/18.45279

DO - 10.1109/18.45279

M3 - Article

SN - 0018-9448

VL - 35

SP - 1228

EP - 1232

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 6

ER -

On a decoding algorithm for codes on maximal curves

Abstract

Access to Document

Fingerprint

Cite this