MacWillianms F J, Sloane N J A. The theory of error-correcting codes [M]. The Netherlands: North-Holland Publishing Co., 1977.
[2]
Ling S, Sole P. Good self-dual quasi-cyclic codes exist[J]. IEEE Transactions on Information Theory, 2003,49(4):1052-1053.
doi: 10.1109/TIT.2003.809501
[3]
Stichtenoth H, Topuzoglu A. Factorization of a class of polynomials over finite fields[J]. Finite Field and Their Applications, 2012,18(1):108-122.
[4]
Conan J, Seguin G. Structrual properties and enumeration of quasi-cyclic codes[J]. Applicable Algebra in Engineering, Communication and Computing, 1993,4(1):25-39.
[5]
Ling S, Sole P. On the algebraic structure of quasi-cyclic codes Ⅰ: finite fields[J]. IEEE Trans Inform Theory, 2001,47(7):2751-2760.
[6]
Ling S, Sole P. On the algebraic structure of quasi-cyclic code Ⅱ: chain rings[J]. Designs, Codes and Cryptography, 2003,30(1):113-130.
[7]
Mullen G L, Panarlo D. Handbook of finite fields [M]. Boca Raton: CRC Press, 2013: 53-99.
[8]
Huffman W C, Pless V. Fundamentals of error-correcting codes [M]. London: Cambridge University Press, 2003: 122-162.
[9]
Flori J P, Mesnager S. Dickson polynomials, hyperelliptic curves and hyper-bentfunctions[M]. New York: Springer-Verlag , 2012: 40-52.
[10]
Wan Z X. Finite fields and galois rings [M]. Singapore: World Scientific Publishing Co. Pte Ltd, 2003.
), SUN Yanan
