跳到主要导航 跳到搜索 跳到主要内容

The minimum Hamming distances of irreducible cyclic codes

  • Fengwei Li*
  • , Qin Yue
  • , Chengju Li
  • *此作品的通讯作者
  • Nanjing University of Aeronautics and Astronautics
  • Zaozhuang University

科研成果: 期刊稿件文章同行评审

摘要

Let Fq be a finite field with q elements and n=l1 m1l2m2, m1≤1, m2≥1, where l1, l2 are distinct primes and l1 l2 |q-1. In this paper, we give all irreducible factors of xl1m1l2 m2-1 over Fq and all primitive idempotents in a ring Fq[x]/〈xl1 m1 l2 m2 -1〉. Furthermore, we obtain the dimensions and the minimum Hamming distances of all irreducible cyclic codes of length l1m1l2m2 over Fq.

源语言英语
页(从-至)225-242
页数18
期刊Finite Fields and their Applications
29
DOI
出版状态已出版 - 9月 2014
已对外发布

指纹

探究 'The minimum Hamming distances of irreducible cyclic codes' 的科研主题。它们共同构成独一无二的指纹。

引用此