Majority coset decoding

I.M. Duursma

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

37 Citaten (Scopus)


A majority coset decoding (MCD) procedure that can be applied to an arbitrary geometric code is discussed. In general, the basic algorithm for decoding of algebraic-geometric codes does not correct up to the designed minimum distance. In MCD, a reduction step is added to the basic algorithm. In case the basic algorithm fails, a majority scheme is used to obtain an additional syndrome for the error vector. Thus a strictly smaller cost containing the error vector is obtained. In this way, the basic algorithm is applied to a decreasing chain of cosets and after finitely many steps the coset will be small enough for successful application of the basic algorithm.
Originele taal-2Engels
Pagina's (van-tot)1067-1070
TijdschriftIEEE Transactions on Information Theory
Nummer van het tijdschrift3
StatusGepubliceerd - 1993

Vingerafdruk Duik in de onderzoeksthema's van 'Majority coset decoding'. Samen vormen ze een unieke vingerafdruk.

Citeer dit