Bounds on ordered codes and orthogonal arrays

Details Bounds on ordered codes and orthogonal arrays Bounds on ordered codes and orthogonal arrays

2007-02-05

arxiv.org/abs/cs/0702033v3

Moscow Mathematical Journal, vol. 9, no. 2, 2009, pp. 211-243.

Computer Science

Information Theory

Final version, minor corrections

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Bounds on ordered codes and orthogonal arrays 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 Bounds on ordered codes and orthogonal arrays, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on ordered codes and orthogonal arrays will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-427059