Cyclic codes through B[X], B[X;1kp Z₀] and B[X;1p^k Z₀]: a comparison
From MaRDI portal
Publication:2909809
Recommendations
- Cyclic codes through \(B[X; \frac {a}{b}\mathbb Z_0]\), with \(\frac {a}{b}\in \mathbb Q^+\) and \(b=a+1\), and encoding
- Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding
- Encoding through generalized polynomial codes
- Cyclic codes through a semigroup ring
- Codes over certain rings
Cites work
- 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 3392596 (Why is no real title available?)
- 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
- Codes over certain rings
- Codes over integer residue rings
- Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding
- Generators and weights of polynomial codes
- Modular and \(p\)-adic cyclic codes
- Srivastava codes
Cited in
(5)- scientific article; zbMATH DE number 6874923 (Why is no real title available?)
- Cyclic codes through \(B[X; \frac {a}{b}\mathbb Z_0]\), with \(\frac {a}{b}\in \mathbb Q^+\) and \(b=a+1\), and encoding
- Primitive to non-primitive BCH codes: an instantaneous path shifting scheme for data transmission
- Maximal cyclic subgroups of the groups of units of Galois rings: a computational approach
- Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909809)
