Generators and weights of polynomial codes
Let \(f_1(x_1),\dots,f_n(x_n)\) be univariate polynomials over a field \({\mathbb{F}}\), and let \(R\) denote the Artinian ring \(\mathbb{F}[x_1,\dots,x_n]/(f_1(x_1),\dots,f_n(x_n))\). The authors show that the radical of \(R\) is a principal ideal if and only if at most one of the \(f_1,\dots,f_n\) is not square-free. In the case when \({\mathbb{F}}\) is a finite field, this result has applications to coding theory, since some interesting classes of codes, including generalized Reed-Muller codes [cf. \textit{P. Charpin}, Commun. Algebra 16, 2231-2246 (1988; Zbl 0649.94013)], occur as powers of the radical in such an Artinian ring. The authors also consider the case when the field \(\mathbb{F}\) is replaced by the ring \(\mathbb{Z}_m\), where \(m\) is a power of a prime. Finally, using results of \textit{H. N. Ward} [Arch. Math. 54, 307-312 (1990; Zbl 0682.94012)], the authors compute the Hamming weight of the radical and its powers in the ring \[ \mathbb{F}[x_1,\dots,x_n]/(x_1^{a_1}(1-x_1^{b_1}),\dots, x_n^{a_n}(1-x_n^{b_n})). \]
- On repeated-root multivariable codes over a finite chain ring
- A formula for multiple classifiers in data mining based on Brandt semigroups
- On weight spaces of polynomial representations of the general linear group as linear codes
- Polynomials generating Hamming codes
- Weight enumerators of codes derived from polynomial product algorithms
- Repeated-root cyclic and negacyclic codes over a finite chain ring
- Factoring polynomials over \(\mathbb Z_4\) and over certain Galois rings
- 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} \mathbb Z_0]\) and \(B[X;\frac{1}{p^k}\mathbb Z_0]\): a comparison
- Internet security applications of Gröbner-Shirshov bases
- A method for improving the code rate and error correction capability of a cyclic code
- A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA
- Artinian rings, finite principal ideal rings and algebraic error-correcting codes
- An Algorithm for Commutative Semigroup Algebras Which are Principal Ideal Rings
- Cyclic codes through \(B[X; \frac {a}{b}\mathbb Z_0]\), with \(\frac {a}{b}\in \mathbb Q^+\) and \(b=a+1\), and encoding
- OPTIMIZATION OF MULTIPLE CLASSIFIERS IN DATA MINING BASED ON STRING REWRITING SYSTEMS
- scientific article; zbMATH DE number 2221704 (Why is no real title available?)
- Rees matrix constructions for clustering of data.
- Internet security applications of the Munn rings
- Constructions of codes through the semigroup ring \(B[X;\frac{1}{2^2}\mathbb Z_0]\) and encoding
This page was built for publication: Generators and weights of polynomial codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383603)
