On the Hamming distance of linear codes over a finite chain ring

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 t...

Full description

Saved in:
Bibliographic Details
Main Authors: G.H. Norton, Ana Salagean
Format: Default Article
Published: 2000
Subjects:
Artificial intelligence not elsewhere classified
Other information and computing sciences not elsewhere classified
Finite chain ring
Galois ring
Hamming distance
MDS code
Artificial Intelligence and Image Processing
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/2329
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/2329

Similar Items