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.











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)