Journal of University of Science and Technology of China ›› 2015, Vol. 45 ›› Issue (7): 588-593.DOI: 10.3969/j.issn.0253-2778.2015.07.013

• Research Articles • Previous Articles    

Construction of optimal codes with Homogeneous distance

  

  1. Department of Common Courses, Anhui Xinhua University, Hefei 230088, China
  • Online:2015-07-30 Published:2023-05-15
  • About author:DING Jian (corresponding author), male, born in 1982, Master/lecture. Research field: Algebraic coding.
  • Supported by:
    Supported by National Natural Science Foundation of China(61370089), Anhui Province Natural Science Research (KJ2015A308) and Natural Science Project of AnHui Xinhua University(2014Zr009).

Abstract: Based on the torsion codes of a  (1+λu) constacyclic code with arbitrary length over R(pm,k)=Fpm [u]/< uk >, a bound for the homogeneous distance of a (1+λu) constacyclic code with an arbitrary length over  R( pm ,k) is obtained and the exact homogeneous distances of some (1+λu) constacyclic codes over  R( pm ,k) are determined, where λ is a unit of  R( pm ,k). Furthermore, a new distance-preserving Gray map from RN(pm ,k) (Homogeneous distance) to  F pm(k -1) N pm (Hamming distance) is defined. It is proved that the Gray image of a linear (1+λu) constacyclic code of arbitrary length over  R(pm ,k) is a linear code over Fpm, and some optimal linear codes over F2, F3, and F4 are constructed under this Gray map.

Key words:  , Optimal code, Constacyclic code, Homogeneous distance, Gray map 

CLC Number: