Coding‐theoretic constructions for (t,m,s)‐nets and ordered orthogonal arrays
From MaRDI portal
Publication:4798155
DOI10.1002/jcd.10015zbMath1035.94011OpenAlexW2061725132MaRDI QIDQ4798155
Yves Edel, Juergen Bierbrauer, Wolfgang Ch. Schmid
Publication date: 19 March 2003
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.10015
linear codesGilbert-Varshamov boundconcatenationordered orthogonal arrays\((t, m, s)\)-nets\((u,u+v)\)-constructionNRT-spacetrace construction
Linear codes (general theory) (94B05) Bounds on codes (94B65) Orthogonal arrays, Latin squares, Room squares (05B15) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items
Matrix-product constructions of digital nets ⋮ Extensible hyperplane nets ⋮ On the existence and distribution quality of hyperplane sequences ⋮ A characterization of strong orthogonal arrays of strength three ⋮ A higher order Blokh-Zyablov propagation rule for higher order nets ⋮ Duality theory and propagation rules for generalized digital nets ⋮ MinT-architecture and applications of the \((t, m, s)\)-net and OOA database ⋮ Duality for digital sequences ⋮ Constructions of nets via OAs of strength 3 with a prescribed property ⋮ Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences ⋮ A family of binary \((t,m,s)\)-nets of strength 5.
Cites Work
