A direct approach to linear programming bounds for codes and tms-nets (Q2383988): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4119093 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Four fundamental parameters of a code and their combinatorial significance / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5707657 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Generalized Rao Bound for Ordered Orthogonal Arrays and (<i>t, m, s</i>)-Nets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Association Schemes for Ordered Orthogonal Arrays and (<i>T, M, S</i>)-Nets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2717208 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Point sets and sequences with small discrepancy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: MinT: A Database for Optimal Net Parameters / rank | |||
Normal rank |
Revision as of 16:29, 26 June 2024
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