Pages that link to "Item:Q660789"
From MaRDI portal
The following pages link to Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding (Q660789):
Displaying 8 items.
- A method for improving the code rate and error correction capability of a cyclic code (Q361981) (← links)
- Encoding through generalized polynomial codes (Q656544) (← links)
- An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings (Q871618) (← links)
- Maximal cyclic subgroups of the groups of units of Galois rings: a computational approach (Q2403110) (← links)
- On codes over quaternion integers (Q2441443) (← links)
- 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 (Q2909809) (← links)
- Characterization of cyclic codes over {ℬ[<i>X</i>;(1/<i>m</i>)<i>Z</i><sub>0</sub>]}<sub><i>m > 1</i></sub>and efficient encoding decoding algorithm for cyclic codes (Q4976304) (← links)
- Decoding of cyclic codes over quaternion integers by modified Berlekamp–Massey algorithm (Q6495468) (← links)
