首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A class of minimal cyclic codes over finite fields
Authors:Fen Li  Xiwang Cao
Institution:1. Department of Mathematics, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China;2. State Key Laboratory of Information Security (Institute of Information Engineering, Chinese Academy of Sciences), Beijing 100093, China
Abstract:Let Fq be a finite field of odd order q and n=2ap1a1p2a2, where a,a1,a2 are positive integers, p1,p2 are distinct odd primes and 4p1p2|q?1. In this paper, we study the irreducible factorization of xn?1 over Fq and all primitive idempotents in the ring Fqx]xn?1.Moreover, we obtain the dimensions and the minimum Hamming distances of all irreducible cyclic codes of length n over Fq.
Keywords:Irreducible factorization  Primitive idempotent  Irreducible cyclic code
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号