加载中…
Given a finite extension of degree of a finite field , we enumerate all selfdual skew cyclic codes in the Ore quotient ring for any positive integer coprime to the characteristic (separable case). We also provide an enumeration algorithm when is a power of (purely inseparable case), at the cost of some redundancies. Our approach is based on an explicit bijection between skew cyclic codes, on the one hand, and certain families of -linear subspaces of some extensions of . Finally, we report on an implementation in SageMath.

生成讲解博客的中文版本

生成AI智能校验的中文版本