Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm
From MaRDI portal
Publication:3360806
DOI10.1109/18.86974zbMath0733.94024OpenAlexW2081094787MaRDI QIDQ3360806
Publication date: 1991
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.86974
Related Items
Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences, In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants, 2-D skew-cyclic codes over \(\mathbb F_q[x,y;\rho ,\theta\)], A relation between quasi-cyclic codes and 2-D cyclic codes, Decoding up to 4 errors in hyperbolic-like abelian codes by the Sakata algorithm, Multidimensional cyclic codes and Artin-Schreier type hypersurfaces over finite fields, Characterizations of some two-dimensional cyclic codes correspond to the ideals of \(\mathbb{F} [x, y / < x^s - 1, y^{2^k} - 1 >\)], At the dawn of the theory of codes