scientific article; zbMATH DE number 3965970
From MaRDI portal
Publication:3734306
[For the entire collection see Zbl 0591.00035.] An algorithm is given to construct all primitive idempotents in any algebra of the type \(A=K[X_ 1,...,X_ n]/(t_ 1(X_ 1),...,t(X_ n))\) where K is a commutative field and each \(t_ i\) has coefficients in K. The characteristic of K can be either 0 or prime and computations take place in a subalgebra of A. Only linear algebraic methods are used. It is noted that such idempotents are useful in a variety of algebraic structures as well as in the theory of error correcting codes.
Recommendations
- Important algebraic calculations for \(n\)-variables polynomial codes
- Idempotent computation over finite fields
- Construction of n variable codes
- Primitive idempotents in group algebras and minimal abelian codes
- Primitive idempotents in central simple algebras over \(\mathbb{F}_q(t)\) with an application to coding theory
Cited in
(8)- Construction of n variable codes
- Important algebraic calculations for \(n\)-variables polynomial codes
- Idempotent computation over finite fields
- Primitive idempotents in central simple algebras over \(\mathbb{F}_q(t)\) with an application to coding theory
- Construct systems of orthogonal idempotents
- An algebraic construction of generalized Beenker's codes
- scientific article; zbMATH DE number 3543911 (Why is no real title available?)
- scientific article; zbMATH DE number 7124313 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3734306)