A Dual Plotkin Bound for (T,M,S)-Nets

DOI10.1109/TIT.2006.887514MaRDI QIDQ3548221zbMATH OpenOpenAlexFDO

Authors William J. Martin, Terry I. Visentin

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2006.887514

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Bounds on codes (94B65) Pseudo-random numbers; Monte Carlo methods (11K45)

Recommendations

• New explicit bounds for ordered codes and \((t,m,s)\)-nets
• Publication:4934386
• scientific article; zbMATH DE number 1229678
• A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets
• An asymptotic {G}ilbert-{V}arshamov bound for \((T,M,S)\)-nets

Cited in

(7)

• scientific article; zbMATH DE number 1390119 (Why is no real title available?)
• New explicit bounds for ordered codes and \((t,m,s)\)-nets
• Digital almost nets
• Cubic and higher degree bounds for codes and \((t,m,s)\)-nets
• An asymptotic {G}ilbert-{V}arshamov bound for \((T,M,S)\)-nets
• MinT-architecture and applications of the \((t, m, s)\)-net and OOA database
• Commutative association schemes

This page was built for publication: A Dual Plotkin Bound for $(T,M,S)$-Nets

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