An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
From MaRDI portal
Publication:871618
DOI10.1007/S00233-006-0647-9zbMATH Open1145.94023OpenAlexW2017758698MaRDI QIDQ871618FDOQ871618
Dirk Vertigan, Stephen J. Quinn, Jilyana Cazaran, A. V. Kelarev
Publication date: 20 March 2007
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00233-006-0647-9
Cited In (20)
- ℛ-unipotent semigroup algebras
- 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
- A decoding method of an \(n\) length binary BCH code through \((n+1)n\) length binary cyclic code
- Optimization of classifiers for data mining based on combinatorial semigroups
- REES MATRIX CONSTRUCTIONS FOR CLUSTERING OF DATA
- Internet security applications of the Munn rings
- Construction of high rate \(\mathcal {T}\)-direct codes
- A formula for multiple classifiers in data mining based on Brandt semigroups
- The minimum distance of codes in an array coming from telescopic semigroups
- OPTIMIZATION OF MULTIPLE CLASSIFIERS IN DATA MINING BASED ON STRING REWRITING SYSTEMS
- Classification systems based on combinatorial semigroups
- The automorphisms of Petit’s algebras
- Title not available (Why is that?)
- A method for improving the code rate and error correction capability of a cyclic code
- 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
- INTERNET SECURITY APPLICATIONS OF GRÖBNER-SHIRSHOV BASES
- A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA
- Characterization of cyclic codes over {ℬ[X;(1/m)Z0]}m > 1and efficient encoding decoding algorithm for cyclic codes
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)
