Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/2329

Title: On the Hamming distance of linear codes over a finite chain ring
Authors: Norton, G.H.
Salagean, A.M.
Keywords: Finite chain ring
Galois ring
Hamming distance
MDS code
Issue Date: 2000
Publisher: © IEEE Transactions on Information Theory Society
Citation: NORTON and SALAGEAN, 2000. On the Hamming distance of linear codes over a finite chain ring. IEEE transactions on information theory, 46 (3), pp. 1060-1067
Abstract: Let R be a finite chain ring (e.g. a Galois ring), K its residue field and C a linear code over R. We prove that d(C), the Hamming distance of C, is d((C : α)), where (C : α) is a submodule quotient, α is a certain element of R and — denotes the canonical projection to K. These two codes also have the same set of minimal codeword supports. We explicitly construct a generator matrix/polynomial of (C : α) from the generator matrix/polynomials of C. We show that in general d(C) ≤ d(C) with equality for free codes (i.e. for free R- submodules of Rn) and in particular for Hensel lifts of cyclic codes over K. Most of the codes over rings described in the literature fall into this class. We characterise MDS codes over R and prove several analogues of properties of MDS codes over finite fields. We compute the Hamming weight enumerator of a free MDS code over R.
Description: This article was published in the journal, IEEE transactions on information theory [© Transactions on Information Theory Society] and is also available at: http://ieeexplore.ieee.org/servlet/opac?punumber=18. [©2006 IEEE] Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
URI: https://dspace.lboro.ac.uk/2134/2329
ISSN: 0018-9448
Appears in Collections:Published Articles (Computer Science)

Files associated with this item:

File Description SizeFormat
IEEE-NortonSalagean-Hamming.pdf305.14 kBAdobe PDFView/Open


SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.