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

DOI10.1007/S10623-010-9420-XzbMATH Open1236.94090OpenAlexW2042070084MaRDI QIDQ543422FDOQ543422

Authors: 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

Recommendations

• A direct approach to linear programming bounds for codes and tms-nets
• New explicit bounds for ordered codes and \((t,m,s)\)-nets
• Linear programming bounds for codes of small size
• Upper bounds on the minimum distance of spherical codes
• On linear programming bounds for spherical codes and designs

zbMATH Keywords

\((t,m,s)\)-netscubic boundlinear programming boundPlotkin boundpolynomial boundquadratic bound

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Bounds on codes (94B65)

Cites Work

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

Cited In (2)

• A direct approach to linear programming bounds for codes and tms-nets
• Families of ternary \((t,m,s)\)-nets related to BCH-codes

Uses Software

• MinT

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)