An Upper Bound on Covering Radius

From MaRDI portal





This paper presents a new upper bound on the covering radius for linear codes, compares it to an extent with the bound of Delsarte, and applies it to construct a code with good covering radius. For the entire collection see [Zbl 0513.00004].











This page was built for publication: An Upper Bound on Covering Radius

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337370)