Perfect Codes for Uniform Chains Poset Metrics
Information Theory
2015-03-19 v2 Combinatorics
math.IT
Abstract
The class of poset metrics is very large and contains some interesting families of metrics. A family of metrics, based on posets which are formed from disjoint chains which have the same size, is examined. A necessary and sufficient condition, for the existence of perfect single-error-correcting codes for such poset metrics, is proved.
Cite
@article{arxiv.1107.5708,
title = {Perfect Codes for Uniform Chains Poset Metrics},
author = {Tuvi Etzion},
journal= {arXiv preprint arXiv:1107.5708},
year = {2015}
}