Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 493099
- On Blahut's decoding algorithms for two-dimensional BCH codes
- General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n < 63$</tex></formula>
- Decoding binary two-error correcting cyclic codes with Zech logarithms
- ON THE BERLEKAMP — MASSEY ALGORITHM AND ITS APPLICATION FOR DECODING ALGORITHMS
Cited in
(15)- Two decyclical lengthening methods for block codes
- At the dawn of the theory of codes
- In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants
- Decoding up to 4 errors in hyperbolic-like abelian codes by the Sakata algorithm
- 2-D skew-cyclic codes over \(\mathbb F_q[x,y;\rho ,\theta]\)
- Multidimensional cyclic codes and Artin-Schreier type hypersurfaces over finite fields
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
- Decoding binary two-error correcting cyclic codes with Zech logarithms
- A theory of two-dimensional cyclic codes
- scientific article; zbMATH DE number 493099 (Why is no real title available?)
- On Blahut's decoding algorithms for two-dimensional BCH codes
- ON THE BERLEKAMP — MASSEY ALGORITHM AND ITS APPLICATION FOR DECODING ALGORITHMS
- Characterizations of some two-dimensional cyclic codes correspond to the ideals of \(\mathbb{F} [x, y] / < x^s - 1, y^{2^k} - 1 >\)
- A relation between quasi-cyclic codes and 2-D cyclic codes
- Two dimensional double cyclic codes over finite fields
This page was built for publication: Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3360806)
