Decoding up to 4 errors in hyperbolic-like abelian codes by the Sakata algorithm

DOI10.1007/978-3-030-68869-1_7zbMath1490.94076arXiv2007.09039OpenAlexW3134150517MaRDI QIDQ2232215

Juan Jacobo Simón, José Joaquín Bernal

Publication date: 4 October 2021

Full work available at URL: https://arxiv.org/abs/2007.09039

zbMATH Keywords

decodingabelian codesBerlekamp-Massey-Sakata algorithm, Gröbner basis

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Decoding (94B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
• Finding a Gröbner basis for the ideal of recurrence relations on m-dimensional periodic arrays
• Apparent Distance and a Notion of BCH Multivariate Codes
• Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm
• The BMS Algorithm
• The BMS Algorithm and Decoding of AG Codes
• A theory of two-dimensional cyclic codes