An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
From MaRDI portal
(Redirected from Publication:871618)
Recommendations
- A note on linear codes over semigroup rings
- Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding
- Algorithms for computing parameters of graph-based extensions of BCH codes
- On minimum distance bounds for abelian codes
- Some algorithms for computing the minimum distance of evaluation codes
Cited in
(22)- The automorphisms of Petit's algebras
- Computation of minimum Hamming weight for linear codes
- Optimization of classifiers for data mining based on combinatorial semigroups
- A decoding method of an \(n\) length binary BCH code through \((n+1)n\) length binary cyclic code
- Algorithms for computing parameters of graph-based extensions of BCH codes
- Construction of high rate \(\mathcal {T}\)-direct codes
- Internet security applications of the Munn rings
- A formula for multiple classifiers in data mining based on Brandt semigroups
- Characterization of cyclic codes over \(\{\mathcal B[X; (1/m)Z_0]\}_{m>1}\) and efficient encoding decoding algorithm for cyclic codes
- The minimum distance of codes in an array coming from telescopic semigroups
- Rees matrix constructions for clustering of data.
- Classification systems based on combinatorial semigroups
- \(\mathcal R\)-unipotent semigroup algebras
- Internet security applications of Gröbner-Shirshov bases
- OPTIMIZATION OF MULTIPLE CLASSIFIERS IN DATA MINING BASED ON STRING REWRITING SYSTEMS
- Cyclic codes through \(B[X; \frac {a}{b}\mathbb Z_0]\), with \(\frac {a}{b}\in \mathbb Q^+\) and \(b=a+1\), and encoding
- Primitive to non-primitive BCH codes: an instantaneous path shifting scheme for data transmission
- A method for improving the code rate and error correction capability of a cyclic code
- scientific article; zbMATH DE number 5499321 (Why is no real title available?)
- 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
- A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA
This page was built for publication: An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q871618)
