Decoding of cyclic codes over quaternion integers by modified Berlekamp–Massey algorithm
From MaRDI portal
Recommendations
- On codes over quaternion integers
- Large quaternary cyclic codes of length 85 and related quantum error-correcting
- Algebraic decoding of negacyclic codes over \({\mathbb Z_4}\)
- On the decoding of Reed-Solomon and BCH codes over integer residue rings
- 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>
Cites work
- A note on linear codes over semigroup rings
- Algebraic coding theory
- Codes over Gaussian integers
- Codes over Hurwitz integers
- Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding
- Cyclic codes over some finite quaternion integer rings
- Encoding through generalized polynomial codes
- High-rate codes with sublinear-time decoding
- scientific article; zbMATH DE number 5944420 (Why is no real title available?)
- scientific article; zbMATH DE number 6516526 (Why is no real title available?)
- scientific article; zbMATH DE number 5788539 (Why is no real title available?)
- scientific article; zbMATH DE number 1849959 (Why is no real title available?)
- scientific article; zbMATH DE number 6418825 (Why is no real title available?)
- scientific article; zbMATH DE number 5878931 (Why is no real title available?)
- Linear Codes over Finite Rings
- On codes over quaternion integers
- On decoding BCH codes
- Perfect 1-error-correcting Lipschitz weight codes
- The MacWilliams theorem for two-dimensional modulo metrics
This page was built for publication: Decoding of cyclic codes over quaternion integers by modified Berlekamp–Massey algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6495468)
