cs . I T ] 5 F eb 2 00 7 BOUNDS ON ORDERED CODES AND ORTHOGONAL ARRAYS
نویسندگان
چکیده
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.
منابع مشابه
ar X iv : c s / 07 02 03 3 v 2 [ cs . I T ] 2 2 O ct 2 00 8 BOUNDS ON ORDERED CODES AND ORTHOGONAL ARRAYS
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 multivariate Krawtchouk polynomials, and establish some of their properties. CONTENTS
متن کاملAssociation Schemes for Ordered Orthogonal Arrays and (t,m,s)-nets
In an earlier paper 9], we studied a generalized Rao bound for ordered orthogonal arrays and (T; M; S)-nets. In this paper, we extend this to a coding-theoretic approach to ordered orthogonal arrays. Using a certain association scheme, we prove a MacWilliams-type theorem for linear ordered orthogonal arrays and linear ordered codes as well as a linear programming bound for the general case. We ...
متن کاملOrthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in cryptology and the theory of algorithms. Among their applications are universal hashing, authentication codes, resilient and correlation-immune functions, derandomization of algorithms, and perfect local randomizers. In this paper, we give new explicit bounds on the size of orthogonal arrays usin...
متن کاملBounds for Resilient Functions and Orthogonal Arrays Extended Abstract
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in cryptology and the theory of algorithms. Among their applications are universal hashing, authentica-tion codes, resilient and correlation-immune functions, derandomization of algorithms, and perfect local randomizers. In this paper, we give new bounds on the size of orthogonal arrays using Delsar...
متن کاملMacwilliams Duality and the Rosenbloom–tsfasman Metric
A new non-Hamming metric on linear spaces over finite fields has recently been introduced by Rosenbloom and Tsfasman [8]. We consider orbits of linear groups preserving the metric and show that weight enumerators suitably associated with such orbits satisfy MacWilliams-type identities for mutually dual codes. Furthermore, we show that the corresponding weight spectra of dual codes are related b...
متن کامل