An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings

DOI10.1007/s00233-006-0647-9zbMath1145.94023MaRDI 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

zbMATH Keywords

extensions of cyclic codes

Mathematics Subject Classification ID

94B60: Other types of codes

16S35: Twisted and skew group rings, crossed products

Related Items

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