Cubic and higher degree bounds for codes and \((t,m,s)\)-nets
type: Item
instance of: scholarly article
title: Cubic and higher degree bounds for codes and \((t,m,s)\)-nets
zbMATH Open document ID: 1236.94090
author: Horst Trinker
published in: Designs, Codes and Cryptography
publication date: 2011-06-17T00:00:00Z
Mathematics Subject Classification ID: 94B65
Mathematics Subject Classification ID: 11T71
zbMATH DE Number: 5909189
zbMATH Keywords: cubic bound
zbMATH Keywords: \((t,m,s)\)-nets
zbMATH Keywords: polynomial bound
zbMATH Keywords: linear programming bound
zbMATH Keywords: Plotkin bound
zbMATH Keywords: quadratic bound
describes a project that uses: MinT
MaRDI profile type: Publication
full work available at URL: s10623-010-9420-x
OpenAlex ID: W2042070084
cites work: A direct approach to linear programming bounds for codes and tms-nets
cites work: Q5707657
cites work: Orthogonal arrays. Theory and applications
cites work: Q4222121
cites work: Q4146667
cites work: Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-Nets
cites work: A Dual Plotkin Bound for $(T,M,S)$-Nets
cites work: An equivalence between \((T,M,S)\)-nets and strongly orthogonal hypercubes
cites work: Point sets and sequences with small discrepancy
cites work: Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes
cites work: MinT: A Database for Optimal Net Parameters
DOI: 10.1007/S10623-010-9420-X
description: scientific article; zbMATH DE number 5909189