Maximum distance codes over rings of order 4

In this correspondence, we study bounds on the Euclidean, Hamming, Lee, and Bachoc weights of codes over rings of order 4 similar to the Singleton bound and investigate the relationship between these bounds. Moreover, we give some characterizations of the codes meeting these bounds.

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2001-01, Vol.47 (1), p.400-404
Main Authors: Dougherty, S.T., Shiromoto, K.
Format: Article
Language:English
Subjects:
Binary system
Codes
Information theory
Meetings
Theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this correspondence, we study bounds on the Euclidean, Hamming, Lee, and Bachoc weights of codes over rings of order 4 similar to the Singleton bound and investigate the relationship between these bounds. Moreover, we give some characterizations of the codes meeting these bounds.
ISSN:0018-9448
1557-9654
DOI:10.1109/18.904544