A direct approach to linear programming bounds for codes and tms-nets (Q2383988)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A direct approach to linear programming bounds for codes and tms-nets |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A direct approach to linear programming bounds for codes and tms-nets |
scientific article |
Statements
A direct approach to linear programming bounds for codes and tms-nets (English)
0 references
20 September 2007
0 references
Linear programming bounds
0 references
Codes
0 references
Orthogonal arrays
0 references
tms-nets
0 references
Ordered orthogonal arrays
0 references
Krawtchouk polynomial
0 references
Duality
0 references
Plotkin bound
0 references
Rao bound
0 references
Lloyd polynomial
0 references
