Bounds on ordered codes and orthogonal arrays
Information Theory
2009-07-20 v3 Combinatorics
math.IT
Abstract
We derive new estimates of the size of codes and orthogonal arrays in the ordered Hamming space (the Niederreiter-Rosenbloom-Tsfasman space). We also show that the eigenvalues of the ordered Hamming scheme, the association scheme that describes the combinatorics of the space, are given by the multivariable Krawtchouk polynomials, and establish some of their properties.
Keywords
Cite
@article{arxiv.cs/0702033,
title = {Bounds on ordered codes and orthogonal arrays},
author = {Alexander Barg and Punarbasu Purkayastha},
journal= {arXiv preprint arXiv:cs/0702033},
year = {2009}
}
Comments
Final version, minor corrections