No label defined (Q3028870)

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 4016768
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4016768

      Statements

      0 references
      0 references
      1986
      0 references
      covering system
      0 references
      t-dense set
      0 references
      covering radius
      0 references
      even-weight subcode
      0 references
      Reed- Muller codes
      0 references
      [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.
      0 references

      Identifiers