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 | |
Publication status | Published - 1989 |