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

DOI10.1007/S10623-006-9025-6MaRDI QIDQ2383988zbMATH OpenOpenAlexFDO

Authors Jürgen 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

CodesDualityKrawtchouk polynomialLinear programming boundsLloyd polynomialOrdered orthogonal arraysOrthogonal arraysPlotkin boundRao boundtms-nets

Mathematics Subject Classification ID

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

Recommendations

• New explicit bounds for ordered codes and (t,m,s)-nets
• Cubic and higher degree bounds for codes and \((t,m,s)\)-nets
• Publication:4934386
• On linear programming bounds for codes in polynomial metric spaces
• Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets

Cites work

• A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets
• Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
• Design systems: Combinatorial characterizations of Delsarte I-designs via partially ordered sets
• Four fundamental parameters of a code and their combinatorial significance
• scientific article; zbMATH DE number 3543912 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• MinT: A Database for Optimal Net Parameters
• Point sets and sequences with small discrepancy

Cited in

(9)

• A simple derivation of the MacWilliams identity for linear ordered codes and orthogonal arrays
• Commutative association schemes
• Bounds on ordered codes and orthogonal arrays
• Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
• scientific article; zbMATH DE number 1390119 (Why is no real title available?)
• Cubic and higher degree bounds for codes and \((t,m,s)\)-nets
• The triple distribution of codes and ordered codes
• New explicit bounds for ordered codes and (t,m,s)-nets
• MinT-architecture and applications of the \((t, m, s)\)-net and OOA database

Describes a project that uses

Uses Software

• MinT

This page was built for publication: A direct approach to linear programming bounds for codes and tms-nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383988)