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
Authors: Jilyana Cazaran, A. V. Kelarev, Stephen J. Quinn, Dirk Vertigan 
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
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 (21)
- The automorphisms of Petit's algebras
- Primitive to non-primitive BCH codes: An instantaneous path shifting scheme for data transmission
- 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
- Algorithms for computing parameters of graph-based extensions of BCH codes
- Internet security applications of the Munn rings
- Construction of high rate \(\mathcal {T}\)-direct codes
- Characterization of cyclic codes over \(\{\mathcal B[X; (1/m)Z_0]\}_{m>1}\) and efficient encoding decoding algorithm for cyclic 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
- Rees matrix constructions for clustering of data.
- \(\mathcal R\)-unipotent semigroup algebras
- OPTIMIZATION OF MULTIPLE CLASSIFIERS IN DATA MINING BASED ON STRING REWRITING SYSTEMS
- Classification systems based on combinatorial semigroups
- Internet security applications of Gröbner-Shirshov bases
- Cyclic codes through \(B[X; \frac {a}{b}\mathbb Z_0]\), with \(\frac {a}{b}\in \mathbb Q^+\) and \(b=a+1\), and encoding
- 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
- 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)
