The minimum Hamming distances of irreducible cyclic codes

  • Fengwei Li*
  • , Qin Yue
  • , Chengju Li
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

20 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)225-242
Number of pages18
JournalFinite Fields and their Applications
Volume29
DOIs
StatePublished - Sep 2014
Externally publishedYes

Keywords

  • Finite field
  • Irreducible cyclic code
  • Primitive idempotent

Fingerprint

Dive into the research topics of 'The minimum Hamming distances of irreducible cyclic codes'. Together they form a unique fingerprint.

Cite this