scientific article; zbMATH DE number 4016768
[For the entire collection see Zbl 0591.00036.] An [n,k,t] covering system is a set of k-subsets of an n-set X such that every t-subset of X is contained in at least one of the k-subsets [cf. \textit{J. Schönheim}, Pac. J. Math. 14, 1401-1411 (1964; Zbl 0128.245)]. Such systems have been used by several authors to construct error- trapping decoding schemes. The authors have renamed this concept ``t- dense and they are specifically interested in codes for which the words of minimum odd weight w form a t-dense set. If \(\rho\) (C) denotes the covering radius of such a code and \(\rho (C_ e)\) the covering radius of its even-weight subcode, then their theorem states that \(\rho (C_ e)=w\) if \(\rho (C)<2t\) or \(\rho (C)=2t\) and \(w>2t+1\), and \(\rho (C_ e)=1+\rho (C)\) if \(\rho\) (C)\(\geq 2t\) and \(w\leq 2t+1\). There are several applications, e.g. to certain Reed-Muller codes.
- On the covering radius of subcodes of a code
- On the covering radius of a code and its subcodes
- On the covering radius of codes
- The multicovering radii of codes
- The Generalized Covering Radii of Linear Codes
- On the covering radii of extremal doubly even self-dual codes
- Covering radii of ternary linear codes of small dimensions and codimensions
- A new approach to the covering radius of codes
- Further results on the covering radius of codes
- Subcodes and covering radius (Corresp.)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3028870)