|
Problemy Peredachi Informatsii, 1997, Volume 33, Issue 3, Pages 29–39
(Mi ppi376)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Information Theory and Coding Theory
Decoding of Codes on an Elliptic Curve with Number of Errors Greater than Half the Designed Code Distance
A. Yu. Serebryakov
Abstract:
The problem of decoding algebraic-geometric codes over an elliptic curve is considered, where the number of errors may exceed half the designed code distance (in particular, it may exceed half the minimum distance as well). This problem can be reduced to that of finding zeroes of a multivariate polynomial. A syndrome probabilistic decoding algorithm of depth $t$ is constructed.
Received: 22.10.1996
Citation:
A. Yu. Serebryakov, “Decoding of Codes on an Elliptic Curve with Number of Errors Greater than Half the Designed Code Distance”, Probl. Peredachi Inf., 33:3 (1997), 29–39; Problems Inform. Transmission, 33:3 (1997), 214–223
Linking options:
https://www.mathnet.ru/eng/ppi376 https://www.mathnet.ru/eng/ppi/v33/i3/p29
|
Statistics & downloads: |
Abstract page: | 294 | Full-text PDF : | 140 |
|