Complete classification of -constacyclic codes over of length 3n
Abstract Let F _ 3^ m F 3 m be a finite field of cardinality 3^ m 3 m, R= F _ 3^ mu/⟨ u^ 4 ⟩ R=
F 3 mu/⟨ u 4⟩ which is a finite chain ring, and n be a positive integer satisfying gcd (3, n)= 1
gcd (3, n)= 1. For any δ, α ∈ F _ 3^ m^ * δ, α∈ F 3 m×, an explicit representation for all
distinct (δ+ α u^ 2)(δ+ α u 2)-constacyclic codes over R of length 3 n is given, formulas for
the number of all such codes and the number of codewords in each code are provided,
respectively. Moreover, the dual code for each of these codes is determined explicitly.
F 3 mu/⟨ u 4⟩ which is a finite chain ring, and n be a positive integer satisfying gcd (3, n)= 1
gcd (3, n)= 1. For any δ, α ∈ F _ 3^ m^ * δ, α∈ F 3 m×, an explicit representation for all
distinct (δ+ α u^ 2)(δ+ α u 2)-constacyclic codes over R of length 3 n is given, formulas for
the number of all such codes and the number of codewords in each code are provided,
respectively. Moreover, the dual code for each of these codes is determined explicitly.
Abstract
Let be a finite field of cardinality , which is a finite chain ring, and n be a positive integer satisfying . For any , an explicit representation for all distinct -constacyclic codes over R of length 3n is given, formulas for the number of all such codes and the number of codewords in each code are provided, respectively. Moreover, the dual code for each of these codes is determined explicitly.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果