2000 character limit reached
A new approach to the Berlekamp-Massey-Sakata Algorithm. Improving Locator Decoding
Published 19 Jan 2024 in cs.IT and math.IT | (2401.10527v1)
Abstract: We study the problem of the computation of Groebner basis for the ideal of linear recurring relations of a doubly periodic array. We find a set of indexes such that, along with some conditions, guarantees that the set of polynomials obtained at the last iteration in the Berlekamp-Massey-Sakata algorithm is exactly a Groebner basis for the mentioned ideal. Then, we apply these results to improve locator decoding in abelian codes.
- J.J. Bernal, D.H. Bueno-Carreño, J.J. Simón, “Apparent distance and a notion of BCH multivariate codes,” IEEE Trans. Inf. Theory, vol. 62, no. 2, pp. 655–668, 2016.
- J.J. Bernal, M. Guerreiro, J.J. Simón, “From ds-bounds for cyclic codes to true minimum distance for abelian codes,” IEEE Trans. Inf. Theory, vol. 65, no. 3, pp. 1752–1763, 2019.
- J. Berthomieu and J. Faugère, “In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants,” J. Symbolic Computation, vol. 101, pp. 270–303. Online version 2019.
- R.E. Blahut, “Decoding of cyclic codes and codes on curves,” in Handbook of Coding Theory, vol. II, W.C. Huffman and V. Pless (eds.), Amsterdam: North-Holland, 1998, pp. 1569–1633.
- P. Camion, “Abelian Codes,” MCR Tech. Sum. Rep. 1059, University of Wisconsin, Madison, 1970.
- J. Faugère and Chenqi Mou, “Sparse FGLM algorithms,” J. Symbolic Computation, vol. 80, pp. 538-569, 2017.
- H. Imai, “A theory of two-dimensional cyclic codes,” Information and Control, vol. 34, no. 1, pp. 1–21, 1977.
- I. M. Rubio, M. Sweelder, C. Heegard, “Finding a Gröbner Basis for the Ideal of Recurrence Relations on m-Dimensional Periodic Arrays,” 12th International Conference on Finite Fields and Their Applications, Contemporary Developments in Finite Fields and Applications, World Scientific, 2016, pp. 296–320.
- K. Saints, C. Heegard, “Algebraic-Geometric Codes and Multidimesional Cyclic Codes: A Unified Theory and Algorithms for Decoding Using Gröebner basis,” IEEE Trans. Inf. Theory vol. 41, no. 6, pp. 1733–1751, 1995.
- S. Sakata,“On determining the independent point set for doubly periodic and encoding two-dimensional cyclic codes and their duals,” IEEE Trans. Inf. Theory, vol. 37, no. 4, pp. 1200-1203, 1991.
- S. Sakata, “Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array,” J. Symbolic Computation, vol. 5, pp. 321–337, 1988.
- S. Sakata, “Decoding binary cyclic 2-D codes by the 2-D Berlekamp-Massey algorithm,” IEEE Trans. Inf. Theory, vol. 37, no. 4, pp. 1200–1203, 1991.
- S. Sakata, M. Fujisawa, “Fast decoding of dual multipoint codes from algebraic curves up to the Kirfel-Pellican bound,” IEEE Trans. Inf. Theory, vol. 64, no. 6, pp. 4452–4466, 2018.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.