A Dual Plotkin Bound for $(T,M,S)$-Nets
From MaRDI portal
Publication:3548221
DOI10.1109/TIT.2006.887514zbMath1205.94130OpenAlexW1972282507MaRDI QIDQ3548221
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
Monte Carlo methods (65C05) Bounds on codes (94B65) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (5)
New explicit bounds for ordered codes and \((t,m,s)\)-nets ⋮ Cubic and higher degree bounds for codes and \((t,m,s)\)-nets ⋮ MinT-architecture and applications of the \((t, m, s)\)-net and OOA database ⋮ Commutative association schemes ⋮ Digital almost nets
This page was built for publication: A Dual Plotkin Bound for $(T,M,S)$-Nets
