Encoding through generalized polynomial codes
From MaRDI portal
Recommendations
- Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding
- Cyclic codes through a semigroup ring
- 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
- Characterization of cyclic codes over \(\{\mathcal B[X; (1/m)Z_0]\}_{m>1}\) and efficient encoding decoding algorithm for cyclic codes
Cited in
(24)- Codes from symmetric polynomials
- Redundant residue polynomial codes
- Generalized Shannon codes
- A coding theoretical interpretation of Gaussian-Pell polynomials
- Decoding of cyclic codes over quaternion integers by modified Berlekamp–Massey algorithm
- Maximal cyclic subgroups of the groups of units of Galois rings: a computational approach
- Primitive to non-primitive BCH codes: an instantaneous path shifting scheme for data transmission
- Cyclic codes through \(B[X; \frac {a}{b}\mathbb Z_0]\), with \(\frac {a}{b}\in \mathbb Q^+\) and \(b=a+1\), and encoding
- On codes over quaternion integers
- A method for improving the code rate and error correction capability of a cyclic code
- scientific article; zbMATH DE number 7365014 (Why is no real title available?)
- Extensions of the method of poles for code construction
- Cyclic codes through a semigroup ring
- Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) 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
- Polynomials generating Hamming codes
- scientific article; zbMATH DE number 5788539 (Why is no real title available?)
- A new class of cyclic codes using ordered power product of polynomials
- Characterization of cyclic codes over \(\{\mathcal B[X; (1/m)Z_0]\}_{m>1}\) and efficient encoding decoding algorithm for cyclic codes
- Polyadic Codes Revisited
- A decoding method of an \(n\) length binary BCH code through \((n+1)n\) length binary cyclic code
- Variants of Jacobi polynomials in coding theory
- A note on linear codes over semigroup rings
- scientific article; zbMATH DE number 3890761 (Why is no real title available?)
This page was built for publication: Encoding through generalized polynomial codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656544)
