Higher weights for codes over rings

  • Authors:

  • Steven T. Dougherty;Sunghyu Han;Hongwei Liu

  • Affiliations:

  • University of Scranton, Department of Mathematics, 18510, Scranton, PA, USA;Korea University of Technology and Education, School of Liberal Arts, 330-708, Cheonan, South Korea;Huazhong Normal University, Department of Mathematics, 430079, Wuhan, Hubei, China

  • Venue:
  • Applicable Algebra in Engineering, Communication and Computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

A generalized definition of higher weights for codes over finite chain rings and principal ideal rings and bounds on the minimum higher weights in this setting are given. Using this we generalize the definition for higher MDS and MDR codes. Computationally, the higher weight enumerator of lifted Hamming and Simplex codes over $${\mathbb{Z}_4}$$, the minimum higher weights for the lifted code of the binary [8,4,4] self-dual extended Hamming code, the lifted code of the ternary [12,6,6] self-dual Golay code and the lifted code of the binary [24,12,8] self-dual Golay code are given. Joint weight enumerators are used to produce MacWilliams relations for specific higher weight enumerators.