Upper bounds for constant weight and Lee codes slightly outside the Plotkin range
From MaRDI portal
(Redirected from Publication:1095110)
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.
Recommendations
Cites work
- A low-rate improvement on the Elias bound (Corresp.)
- An upper bound on minimum distance for a k-ary code
- Bounds for binary codes just outside the plotkin range
- scientific article; zbMATH DE number 3167429 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3296351 (Why is no real title available?)
- scientific article; zbMATH DE number 3318360 (Why is no real title available?)
- scientific article; zbMATH DE number 3327467 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- On t-distance sets of (0,+-1)-vectors
- On the nonbinary Johnson scheme
- Sphere-packing in the Hamming metric
- THE LEE-SCHEME AND BOUNDS FOR LEE-CODES
- Upper bounds on the cardinality of a binary code with a given minimum distance
Cited in
(3)
This page was built for publication: Upper bounds for constant weight and Lee codes slightly outside the Plotkin range
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095110)