A direct approach to linear programming bounds for codes and tms-nets

DOI10.1007/s10623-006-9025-6zbMath1148.94017OpenAlexW2095158982MaRDI QIDQ2383988

Juergen Bierbrauer

Publication date: 20 September 2007

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

Full work available at URL: https://doi.org/10.1007/s10623-006-9025-6

zbMATH Keywords

DualityCodesPlotkin boundKrawtchouk polynomialOrthogonal arraystms-netsRao boundLinear programming boundsLloyd polynomialOrdered orthogonal arrays

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Bounds on codes (94B65) Irregularities of distribution, discrepancy (11K38) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items

The triple distribution of codes and ordered codes ⋮ 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 ⋮ A simple derivation of the MacWilliams identity for linear ordered codes and orthogonal arrays ⋮ Commutative association schemes

Uses Software

• MinT

Cites Work

• Point sets and sequences with small discrepancy
• A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets
• Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
• Four fundamental parameters of a code and their combinatorial significance
• MinT: A Database for Optimal Net Parameters
• Unnamed Item
• Unnamed Item
• Unnamed Item