A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA
DOI10.1017/S0004972708001111zbMath1181.16024MaRDI QIDQ3624606
Peter Vamplew, J. L. Yearwood, Andrei V. Kelarev
Publication date: 30 April 2009
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
group ringsclassification of dataerror-correcting capabilityring constructionscombined multiple classifiersvisible sets of generators
Formal languages and automata (68Q45) Ordinary and skew polynomial rings and semigroup rings (16S36) Group rings (16S34) Pattern recognition, speech recognition (68T10) Other types of codes (94B60) Semigroup rings, multiplicative semigroups of rings (20M25) Ideals in associative algebras (16D25)
Related Items (15)
Cites Work
- Unnamed Item
- An algorithm for computing the minimum distances of extensions of BCH codes embedded in semigroup rings
- Generators and weights of polynomial codes
- Visible codes
- A global optimization approach to classification
- On cyclic codes in incidence rings
- An Algorithm for Commutative Semigroup Algebras Which are Principal Ideal Rings
This page was built for publication: A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA