Upper bounds for constant weight and Lee codes slightly outside the Plotkin range (Q1095110)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4027353
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds for constant weight and Lee codes slightly outside the Plotkin range |
scientific article; zbMATH DE number 4027353 |
Statements
Upper bounds for constant weight and Lee codes slightly outside the Plotkin range (English)
0 references
1987
0 references
The author proves analogues of the McEliece and Tietäväinen bounds for constant weight codes by deriving inequalities for the mean of \(S(x,y)^ r\), where S(x,y) a matrix whose entries are constant over a family of binary relations forming an n-class coloring structure, which is positive semidefinite.
0 references
symmetric association scheme
0 references
McEliece bound
0 references
Tietäväinen bound
0 references
constant weight codes
0 references
n-class coloring structure
0 references
0.8313814401626587
0 references
0.8313814401626587
0 references
0.8158485293388367
0 references
0.807956874370575
0 references
0.8077998161315918
0 references
