Codes over rings and Hermitian lattices

• Published in: Designs, codes, and cryptography codes, and cryptography, 2015-09, Vol.76 (3), p.519-535
• Main Authors: Dougherty, Steven, Kim, Jon-Lark, Lee, Yoonjin
• Format: Article
• Language: English
• Subjects: Circuits; Coding and Information Theory; Computer Science; Cryptology; Data Structures and Information Theory; Discrete Mathematics in Computer Science; Information and Communication
• ISSN: 0925-1022; 1573-7586
• DOI: 10.1007/s10623-014-9974-0

The purpose of this paper is to study a further connection between linear codes over three kinds of finite rings and Hermitian lattices over a complex quadratic field K = Q ( - ℓ ) , where ℓ > 0 is a square free integer such that ℓ ≡ 3 ( mod 4 ) . Shaska et al. (Finite Fields Appl 16(2): 75–87, 2010 ) consider a ring R = O K / p O K ( p is a prime) and study Hermitian lattices constructed from codes over the ring R . We consider a more general ring R = O K / p e O K , where e ≥ 1 . Using p e allows us to make a connection from a code to a much larger family of lattices. That is, we are not restricted to those lattices whose minimum norm is less than p . We first show that R is isomorphic to one of the following three non-isomorphic rings: a Galois ring G R ( p e , 2 ) , Z p e × Z p e , and Z p e + u Z p e . We then prove that the theta functions of the Hermitian lattices constructed from codes over these three rings are determined by the complete weight enumerators of those codes. We show that self-dual codes over R produce unimodular Hermitian lattices. We also discuss the existence of Hermitian self-dual codes over R . Furthermore, we present MacWilliams’ relations for codes over R .