Pages that link to "Item:Q3360806"
From MaRDI portal
The following pages link to Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm (Q3360806):
Displaying 8 items.
- Characterizations of some two-dimensional cyclic codes correspond to the ideals of \(\mathbb{F} [x, y] / < x^s - 1, y^{2^k} - 1 >\) (Q530399) (← links)
- A relation between quasi-cyclic codes and 2-D cyclic codes (Q661981) (← links)
- At the dawn of the theory of codes (Q1209799) (← links)
- In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants (Q2188986) (← links)
- Decoding up to 4 errors in hyperbolic-like abelian codes by the Sakata algorithm (Q2232215) (← links)
- 2-D skew-cyclic codes over \(\mathbb F_q[x,y;\rho ,\theta]\) (Q2434390) (← links)
- Multidimensional cyclic codes and Artin-Schreier type hypersurfaces over finite fields (Q2469468) (← links)
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences (Q2628309) (← links)