Publication | Closed Access
Bounds on Ordered Codes and Orthogonal Arrays
27
Citations
0
References
2009
Year
EngineeringAssociation SchemeOrdered CodesLower BoundCombinatorial DesignCombinatorial Design TheoryComputational ComplexityAlgebraic CombinatoricsComputer ScienceDiscrete MathematicsOrdered Hamming SchemeOrdered Hamming SpaceVariable-length Code
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.