Majority coset decoding

I.M. Duursma

Research output: Contribution to journalArticleAcademicpeer-review

39 Citations (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.
Original languageEnglish
Pages (from-to)1067-1070
JournalIEEE Transactions on Information Theory
Issue number3
Publication statusPublished - 1993


Dive into the research topics of 'Majority coset decoding'. Together they form a unique fingerprint.

Cite this