Pages that link to "Item:Q871618"
From MaRDI portal
The following pages link to An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings (Q871618):
Displayed 18 items.
- A method for improving the code rate and error correction capability of a cyclic code (Q361981) (← links)
- Optimization of classifiers for data mining based on combinatorial semigroups (Q535243) (← links)
- Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding (Q660789) (← links)
- A formula for multiple classifiers in data mining based on Brandt semigroups (Q1014262) (← links)
- Construction of high rate \(\mathcal {T}\)-direct codes (Q1715650) (← links)
- Classification systems based on combinatorial semigroups (Q1955590) (← 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}Z_{0}]$ AND $B[X;\frac{1}{p^{k}}Z_{0}]$: A COMPARISON (Q2909809) (← links)
- INTERNET SECURITY APPLICATIONS OF GRÖBNER-SHIRSHOV BASES (Q3056434) (← links)
- A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA (Q3624606) (← links)
- Primitive to non-primitive BCH codes: An instantaneous path shifting scheme for data transmission (Q4628712) (← links)
- <i>ℛ</i>-unipotent semigroup algebras (Q4643662) (← links)
- The automorphisms of Petit’s algebras (Q4643670) (← 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)
- 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)
- OPTIMIZATION OF MULTIPLE CLASSIFIERS IN DATA MINING BASED ON STRING REWRITING SYSTEMS (Q5324144) (← links)
- REES MATRIX CONSTRUCTIONS FOR CLUSTERING OF DATA (Q5852040) (← links)
- Internet security applications of the Munn rings (Q5962333) (← links)
