Computer Science – Information Theory
Scientific paper
2010-04-30
Computer Science
Information Theory
13 pages, 1 figure
Scientific paper
We study $q$-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.
Barg Alexander
Purkayastha Punarbasu
No associations
LandOfFree
Near MDS poset codes and distributions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Near MDS poset codes and distributions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Near MDS poset codes and distributions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-388813