Inference of unknown syndrome values in the implementation of the Berlekamp-Massey-Sakata algorithm

2025/09/18 by José Joaquín Bernal, Juan Jacobo Simón, Bernal, J. J. +1
Computer Science · #Coding theory and cryptography #Polynomial and algebraic computation #Cryptography and Residue Arithmetic

paper · pdf · doi:10.48550/arxiv.2509.14835

Abstract

We study the problem of finding those missing syndrome values that are needed to implment the Berlekamp-Massey-Sakata algorithm as the Feng-Rao Majority Voting for algebraic geometric codes. We apply our results to solve syndrome correction in abelian codes.

Citations

• Apparent Distance and a Notion of BCH Multivariate Codes

Related

• Decoding up to 4 errors in Hyperbolic-like Abelian Codes by the Sakata\n Algorithm
• Inverse-free Berlekamp-Massey-Sakata Algorithm and Small Decoders for Algebraic-Geometric Codes
• The Berlekamp-Massey Algorithm and the Euclidean Algorithm: a Closer Link
• On Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes
• A Dynamical System-based Key Equation for Decoding One-Point Algebraic-Geometry Codes