.png){kind=icon}
.png){kind=icon}
Return
Algebraic Soft Decoding of Elliptic Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2022.3146278.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes the algebraic soft decoding (ASD) for one-point elliptic codes, where the interpolation problem is solved from the perspective of module basis reduction. In ASD, the interpolation polynomial Q(x, y, z) is the minimum candidate of a Grobner basis. Based on a multiplicity matrix, an interpolation ideal can be defined. With the decoding output list size, an equivalent interpolation module can be led to. By further defining the set of interpolation points, a sequence of modules from the elliptic curve coordinate ring can be obtained. Based on the Lagrange interpolation functions over elliptic function field, a basis of the interpolation module can be constructed. The desired Grobner basis that contains Q can be determined by reducing the module basis. Re-encoding transform (ReT) is further introduced to reduce the basis reduction complexity. It is also shown that the interpolation can be facilitated by assessing the degree of the Lagrange interpolation polynomials. The decoding complexity is analyzed, which is verified by numerical results. That shows the advantage of this interpolation technique over the conventional Kotter's interpolation. The ASD performance of elliptic codes is also presented.
Keywords:
Interpolation
Codes
Decoding
Complexity theory
Elliptic curves
Transforms
Reliability
Algebraic soft decoding
basis reduction
elliptic codes
Grobner basis
interpolation
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W