Majority coset decoding
- 1 May 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 39 (3) , 1067-1070
- https://doi.org/10.1109/18.256518
Abstract
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 algorithmKeywords
This publication has 8 references indexed in Scilit:
- Algebraic decoding using special divisorsIEEE Transactions on Information Theory, 1993
- Decoding algebraic-geometric codes up to the designed minimum distanceIEEE Transactions on Information Theory, 1993
- Algebraic-Geometric CodesPublished by Springer Nature ,1991
- On the decoding of algebraic-geometric codesIEEE Transactions on Information Theory, 1990
- On the decoding of algebraic-geometric codes over F/sub q/ for q<or=16IEEE Transactions on Information Theory, 1990
- Construction and decoding of a class of algebraic geometry codesIEEE Transactions on Information Theory, 1989
- On a decoding algorithm for codes on maximal curvesIEEE Transactions on Information Theory, 1989
- Introduction to Coding Theory and Algebraic GeometryPublished by Springer Nature ,1988