Cubic and higher degree bounds for codes and (t,m,s)-nets
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1229678 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- A Dual Plotkin Bound for $(T,M,S)$-Nets
- A direct approach to linear programming bounds for codes and tms-nets
- An equivalence between (T,M,S)-nets and strongly orthogonal hypercubes
- Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
- MinT: A Database for Optimal Net Parameters
- Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes
- Orthogonal arrays. Theory and applications
- Point sets and sequences with small discrepancy
Cited in
(2)
This page was built for publication: Cubic and higher degree bounds for codes and \((t,m,s)\)-nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q543422)