We start from a brief discussion of the links between algebraic coding theory, statistics and tms-nets. Linear codes live in Hamming space, whereas tms-nets are embedded in a more general metric space first described by Niederreiter, Rosenbloom and Tsfasman.
Our main result is an asymptotic Gilbert-Varshamov bound for tms-nets. This is a generalization of a classical result from coding theory.
Back to the Index