Skip to main navigation Skip to search Skip to main content

On minimum distances of cyclic codes of length 2̂e over F_2+uF_2

  • Hefei University of Technology
  • Anhui University
  • Southeast University, Nanjing

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

Abstract

Determining the Hamming distances and Lee distances of codes is the key of decoding. In this paper, the structures of cyclic codes over ring F_2+uF_2 are classified. The Hamming distances and Lee distances of some cyclic codes of length 2̂e over ring F_2+uF_2 are determined. The upper bound of Hamming distance of other cyclic codes of length 2̂e over ring F_2+uF_2 are given, and the upper and lower bound of Lee distances of these cyclic codes are also given.

Original languageEnglish
Pages (from-to)29-34
Number of pages6
JournalTien Tzu Hsueh Pao/Acta Electronica Sinica
Volume39
Issue number1
StatePublished - Jan 2011
Externally publishedYes

Keywords

  • Cyclic codes
  • Hamming distance
  • Lee distance

Cite this