New explicit bounds for ordered codes and \((t,m,s)\)-nets

DOI10.1016/J.DISC.2009.10.008zbMath1185.94094OpenAlexW1969897427MaRDI QIDQ965983

Horst Trinker

Publication date: 27 April 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.10.008

zbMATH Keywords

linear programming bound(\(t,m,s)\)-netsordered codesordered orthogonal arrays

Mathematics Subject Classification ID

Linear programming (90C05) Bounds on codes (94B65)

Uses Software

• MinT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Point sets and sequences with small discrepancy
• Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes
• Orthogonal arrays. Theory and applications
• Codes for the \(m\)-metric
• An equivalence between \((T,M,S)\)-nets and strongly orthogonal hypercubes
• A direct approach to linear programming bounds for codes and tms-nets
• A Dual Plotkin Bound for $(T,M,S)$-Nets
• Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
• MinT: A Database for Optimal Net Parameters

This page was built for publication: New explicit bounds for ordered codes and \((t,m,s)\)-nets