Cubic and higher degree bounds for codes and \((t,m,s)\)-nets

DOI10.1007/S10623-010-9420-XzbMath1236.94090OpenAlexW2042070084MaRDI QIDQ543422

Horst Trinker

Publication date: 17 June 2011

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-010-9420-x

zbMATH Keywords

\((t,m,s)\)-netsPlotkin boundcubic boundlinear programming boundpolynomial boundquadratic bound

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) 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
• 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: Cubic and higher degree bounds for codes and \((t,m,s)\)-nets