A note on linear codes over semigroup rings
From MaRDI portal
Recommendations
Cited in
(14)- Structure of linear codes over the ring \(B_k\)
- Some remarks on non projective Frobenius algebras and linear codes
- Construction and decoding of BCH codes over chain of commutative rings
- Maximal cyclic subgroups of the groups of units of Galois rings: a computational approach
- On codes over quaternion integers
- A semigroup approach to complete decoding
- Cyclic codes through a semigroup ring
- Primitive to non-primitive BCH codes: an instantaneous path shifting scheme for data transmission
- Alternant and BCH codes over certain rings
- Decoding of cyclic codes over quaternion integers by modified Berlekamp–Massey algorithm
- Encoding through generalized polynomial codes
- Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding
- 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: A note on linear codes over semigroup rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4920521)
