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-9zbMath1145.94023OpenAlexW2017758698MaRDI QIDQ871618
Dirk Vertigan, Stephen Quinn, Jilyana Cazaran, Andrei 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
Related Items
CYCLIC CODES THROUGH B[X, $B[X;\frac{1}{kp}Z_{0}]$ AND $B[X;\frac{1}{p^{k}}Z_{0}]$: A COMPARISON] ⋮ A method for improving the code rate and error correction capability of a cyclic code ⋮ OPTIMIZATION OF MULTIPLE CLASSIFIERS IN DATA MINING BASED ON STRING REWRITING SYSTEMS ⋮ Classification systems based on combinatorial semigroups ⋮ Construction of high rate \(\mathcal {T}\)-direct codes ⋮ Primitive to non-primitive BCH codes: An instantaneous path shifting scheme for data transmission ⋮ Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0\) and encoding] ⋮ CYCLIC CODES THROUGH $B[X;\frac{a}{b}{\mathbb Z}_{0}$, WITH $\frac{a}{b}\in {\mathbb Q}^{+}$ AND b = a+1, AND ENCODING] ⋮ ℛ-unipotent semigroup algebras ⋮ The automorphisms of Petit’s algebras ⋮ Optimization of classifiers for data mining based on combinatorial semigroups ⋮ INTERNET SECURITY APPLICATIONS OF GRÖBNER-SHIRSHOV BASES ⋮ Internet security applications of the Munn rings ⋮ A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA ⋮ A formula for multiple classifiers in data mining based on Brandt semigroups ⋮ Characterization of cyclic codes over {ℬ[X;(1/m)Z0}m > 1and efficient encoding decoding algorithm for cyclic codes] ⋮ REES MATRIX CONSTRUCTIONS FOR CLUSTERING OF DATA ⋮ A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code
This page was built for publication: An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
