Coding‐theoretic constructions for (t,m,s)‐nets and ordered orthogonal arrays

DOI10.1002/JCD.10015MaRDI QIDQ4798155zbMATH OpenOpenAlexFDO

Authors Yves Edel, Jürgen 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

zbMATH Keywords

\((t, m, s)\)-nets\((u,u+v)\)-constructionconcatenationGilbert-Varshamov boundlinear codesNRT-spaceordered orthogonal arraystrace construction

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Pseudo-random numbers; Monte Carlo methods (11K45) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Recommendations

• A Construction for (t,m,s)-nets in Base q
• An asymptotic {G}ilbert-{V}arshamov bound for \((T,M,S)\)-nets
• scientific article; zbMATH DE number 953221
• scientific article; zbMATH DE number 1229678
• New explicit bounds for ordered codes and (t,m,s)-nets

Cited in

(20)

• Bounds on covering codes in RT spaces using ordered covering arrays
• On the existence and distribution quality of hyperplane sequences
• Constructions of (t,m,s)-nets and (t,s)-sequences
• A family of binary \((t,m,s)\)-nets of strength 5.
• Constructions of nets via OAs of strength 3 with a prescribed property
• An asymptotic {G}ilbert-{V}arshamov bound for \((T,M,S)\)-nets
• A Coding Theoretic Approach to Building Nets with Well-Equidistributed Projections
• Duality theory and propagation rules for generalized digital nets
• A Construction for (t,m,s)-nets in Base q
• A characterization of strong orthogonal arrays of strength three
• scientific article; zbMATH DE number 1390098 (Why is no real title available?)
• \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays
• Matrix-product constructions of digital nets
• Ordered covering arrays and upper bounds on covering codes
• Extensible hyperplane nets
• A higher order Blokh-Zyablov propagation rule for higher order nets
• A stratified L₂-discrepancy with application to space-filling designs
• Duality for digital sequences
• New explicit bounds for ordered codes and (t,m,s)-nets
• MinT-architecture and applications of the \((t, m, s)\)-net and OOA database

This page was built for publication: Coding‐theoretic constructions for (t,m,s)‐nets and ordered orthogonal arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4798155)