论文标题
$ \ mathbb {f} _q（t）$的中央简单代数中的原始dempotents与编码理论的应用
Primitive idempotents in central simple algebras over $\mathbb{F}_q(t)$ with an application to coding theory
论文作者
论文摘要
我们考虑了计算有限字段的理性函数字段上中央简单代数的原始掌握算法问题。代数由一组结构常数给出。该问题降低为与中央简单代数相当的分区代数brauer的计算。一旦计算出Hasse不变性，该分裂代数被构造为环状代数。我们给出了偏向constacyclic卷积代码的应用。
We consider the algorithmic problem of computing a primitive idempotent of a central simple algebra over the field of rational functions over a finite field. The algebra is given by a set of structure constants. The problem is reduced to the computation of a division algebra Brauer equivalent to the central simple algebra. This division algebra is constructed as a cyclic algebra, once the Hasse invariants have been computed. We give an application to skew constacyclic convolutional codes.
