Near MDS poset codes and distributions
Information Theory
2010-05-03 v1 math.IT
Abstract
We study -ary codes with distance defined by a partial order of the coordinates of the codewords. Maximum Distance Separable (MDS) codes in the poset metric have been studied in a number of earlier works. We consider codes that are close to MDS codes by the value of their minimum distance. For such codes, we determine their weight distribution, and in the particular case of the "ordered metric" characterize distributions of points in the unit cube defined by the codes. We also give some constructions of codes in the ordered Hamming space.
Cite
@article{arxiv.1004.5601,
title = {Near MDS poset codes and distributions},
author = {Alexander Barg and Punarbasu Purkayastha},
journal= {arXiv preprint arXiv:1004.5601},
year = {2010}
}
Comments
13 pages, 1 figure