An efficient method to construct self-dual cyclic codes of length p^s over F_p^m+uF_p^m

07/14/2019
by   Yuan Cao, et al.
0

Let p be an odd prime number, F_p^m be a finite field of cardinality p^m and s a positive integer. Using some combinatorial identities, we obtain certain properties for Kronecker product of matrices over F_p with a specific type. On that basis, we give an explicit representation and enumeration for all distinct self-dual cyclic codes of length p^s over the finite chain ring F_p^m+uF_p^m (u^2=0). Moreover, We provide an efficient method to construct every self-dual cyclic code of length p^s over F_p^m+uF_p^m precisely.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset