On optimal superimposed codes (Q4458733)

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

      Statements

      On optimal superimposed codes (English)
      0 references
      0 references
      0 references
      15 March 2004
      0 references
      cover-free family
      0 references
      superimposed code
      0 references
      key distribution pattern
      0 references
      super-simple design
      0 references
      covering array
      0 references
      mutually orthogonal latin squares, MOLS
      0 references
      t-design
      0 references
      concatenation
      0 references
      algebraic geometric code
      0 references
      A family of subsets of a finite set is called \((w,r)\) cover-free if no intersection of \(w\) members of the family is contained in the union of \(r\) others [cf. \textit{D. R. Stinson, L. Zhu} and \textit{R. Wei}, J. Comb. Theory, Ser. A 90, 224--234 (2000; Zbl 0948.05055) and \textit{A. D'yachkov, A. Macula, D. Torney} and \textit{P. Vilenkin}, ibid. 99, 195--218 (2002; Zbl 1020.94027)]. Equivalent concepts are that of (binary) \((w,r)\) superimposed codes (they are given by the incidence matrices of \((w,r)\) cover-free families) and of \((w,r)\) key distribution patterns for cryptography. The authors develop methods of constructing \((w,r)\) superimposed codes using combinatorial designs and 3-covering arrays and prove that some of the \((2,2)\) and (\(2,3)\) superimposed codes found by their methods are optimal. To get good superimposed codes of large size, they concatenate algebraic-geometric codes with a \((w,r)\) superimposed code; thus they obtain a sequence of \((w,r)\) superimposed codes of positive asymptotic rate.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references