Perfect and Quasi-Perfect Codes Under the l Metric

A long-standing conjecture of Golomb and Welch, raised in 1970, states that there is no perfect r error correcting Lee code of length n for n ≥ 3 and r > 1. In this paper, we study perfect codes in Zn under the l p metric, where 1

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2017-07, Vol.63 (7), p.4325-4331
Main Authors: Zhang, Tao, Ge, Gennian
Format: Article
Language:English
Subjects:
Codes
Electronic mail
Error correction
Indexes
Lattices
Lee metric
Linear codes
lp metric
Noise measurement
perfect code
quasi-perfect code
tiling
Zinc
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!