Pages that link to "Item:Q656544"
From MaRDI portal
The following pages link to Encoding through generalized polynomial codes (Q656544):
Displaying 21 items.
- A method for improving the code rate and error correction capability of a cyclic code (Q361981) (← links)
- Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding (Q660789) (← links)
- Generalized Shannon codes (Q1065754) (← links)
- Polynomials generating Hamming codes (Q1336018) (← links)
- Variants of Jacobi polynomials in coding theory (Q2109384) (← links)
- Maximal cyclic subgroups of the groups of units of Galois rings: a computational approach (Q2403110) (← links)
- On codes over quaternion integers (Q2441443) (← links)
- Codes from symmetric polynomials (Q2692950) (← links)
- A decoding method of an \(n\) length binary BCH code through \((n+1)n\) length binary cyclic code (Q2863727) (← 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)
- A new class of cyclic codes using ordered power product of polynomials (Q2925914) (← links)
- (Q3347325) (← links)
- Polyadic Codes Revisited (Q3547281) (← links)
- (Q3589495) (← links)
- Primitive to non-primitive BCH codes: An instantaneous path shifting scheme for data transmission (Q4628712) (← links)
- Extensions of the method of poles for code construction (Q4680113) (← links)
- CYCLIC CODES THROUGH $B[X;\frac{a}{b}{\mathbb Z}_{0}]$, WITH $\frac{a}{b}\in {\mathbb Q}^{+}$ AND b = a+1, AND ENCODING (Q4903645) (← links)
- (Q4997798) (← links)
- A coding theoretical interpretation of Gaussian-Pell polynomials (Q5041000) (← links)
- Redundant residue polynomial codes (Q5550270) (← links)
- Decoding of cyclic codes over quaternion integers by modified Berlekamp–Massey algorithm (Q6495468) (← links)
