Pages that link to "Item:Q2466021"
From MaRDI portal
The following pages link to Algorithms for computing parameters of graph-based extensions of BCH codes (Q2466021):
Displaying 8 items.
- Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding (Q660789) (← links)
- An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings (Q871618) (← links)
- A coding scheme that increases the code rate (Q2514072) (← 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)
- Primitive to non-primitive BCH codes: An instantaneous path shifting scheme for data transmission (Q4628712) (← 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)
- (Q5506328) (← links)
