Constructions of codes through the semigroup ring B[X;12² Z₀] and encoding
From MaRDI portal
Publication:660789
Recommendations
- Cyclic codes through a semigroup ring
- Encoding through generalized polynomial codes
- A note on linear codes over semigroup rings
- Cyclic codes through \(B[X; \frac {a}{b}\mathbb Z_0]\), with \(\frac {a}{b}\in \mathbb Q^+\) and \(b=a+1\), and encoding
- Cyclic codes through \(B[X]\), \(B[X;\frac{1}{kp} \mathbb Z_0]\) and \(B[X;\frac{1}{p^k}\mathbb Z_0]\): a comparison
Cites work
- Algorithms for computing parameters of graph-based extensions of BCH codes
- An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
- Encoding through generalized polynomial codes
- Generators and weights of polynomial codes
- scientific article; zbMATH DE number 3902926 (Why is no real title available?)
- scientific article; zbMATH DE number 3460471 (Why is no real title available?)
- scientific article; zbMATH DE number 1332357 (Why is no real title available?)
- scientific article; zbMATH DE number 5499321 (Why is no real title available?)
- scientific article; zbMATH DE number 3392596 (Why is no real title available?)
- Linear Codes over Finite Rings
- Ring constructions and applications
- Srivastava codes
Cited in
(12)- Maximal cyclic subgroups of the groups of units of Galois rings: a computational approach
- On codes over quaternion integers
- Cyclic codes through \(B[X]\), \(B[X;\frac{1}{kp} \mathbb Z_0]\) and \(B[X;\frac{1}{p^k}\mathbb Z_0]\): a comparison
- Cyclic codes through a semigroup ring
- A method for improving the code rate and error correction capability of a cyclic code
- Cyclic codes through \(B[X; \frac {a}{b}\mathbb Z_0]\), with \(\frac {a}{b}\in \mathbb Q^+\) and \(b=a+1\), and encoding
- A note on linear codes over semigroup rings
- Characterization of cyclic codes over \(\{\mathcal B[X; (1/m)Z_0]\}_{m>1}\) and efficient encoding decoding algorithm for cyclic codes
- Decoding of cyclic codes over quaternion integers by modified Berlekamp–Massey algorithm
- Encoding through generalized polynomial codes
- The impact of alternant codes over Eisenstein integers on modern technology
- An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
This page was built for publication: Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q660789)
