On a decoding algorithm for codes on maximal curves

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

41 Citaten (Scopus)

Samenvatting

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.
Originele taal-2Engels
Pagina's (van-tot)1228-1232
TijdschriftIEEE Transactions on Information Theory
Volume35
Nummer van het tijdschrift6
DOI's
StatusGepubliceerd - 1989

Vingerafdruk

Duik in de onderzoeksthema's van 'On a decoding algorithm for codes on maximal curves'. Samen vormen ze een unieke vingerafdruk.

Citeer dit