A method for improving the code rate and error correction capability of a cyclic code
From MaRDI portal
(Redirected from Publication:361981)
Recommendations
Cites work
- scientific article; zbMATH DE number 3902926 (Why is no real title available?)
- scientific article; zbMATH DE number 1332357 (Why is no real title available?)
- An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
- Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding
- Divisibility properties in semigroup rings
- Encoding through generalized polynomial codes
- Error-correcting codes as ideals in group rings
- Generators and weights of polynomial codes
- Linear Codes over Finite Rings
- Ring constructions and applications
- Topics in applied abstract algebra
Cited in
(3)- Characterization of cyclic codes over \(\{\mathcal B[X; (1/m)Z_0]\}_{m>1}\) and efficient encoding decoding algorithm for cyclic codes
- Primitive to non-primitive BCH codes: an instantaneous path shifting scheme for data transmission
- A novel coding scheme for generating sixteen codes from quaternary codes with applications
This page was built for publication: A method for improving the code rate and error correction capability of a cyclic code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q361981)
