No label defined (Q4242022)

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

      Statements

      10 October 1999
      0 references
      code construction
      0 references
      combinatorial design
      0 references
      binary codes
      0 references
      Hadamard matrices
      0 references
      constant weight codes
      0 references
      Steiner systems
      0 references
      orthogonal arrays
      0 references
      perfect codes
      0 references
      linear codes
      0 references
      self-dual codes
      0 references
      \{For the entire collection see Zbl 0907.94001 \}. The nine sections of this handbook chapter survey the most important connections between codes and combinatorial designs. After the introduction, in Section 2, it is shown how binary codes achieving the Plotkin bound can be constructed from Hadamard matrices and designs. In Section 3, the correspondence between constant weight codes achieving the restricted and unrestricted Johnson bound and, respectively, 2-designs and Steiner systems is discussed. Equidistant \(q\)-ary codes are considered in Section 4. This topic is close to that of Section 2. The related designs are resolvable designs and orthogonal arrays. Only equidistant \(q\)-ary codes of a size that is a multiple of \(q\) are treated. Results due to Assmus and Mattson that show how \(t\)-designs can be constructed from perfect codes and linear codes are treated in Sections 5 and 6. Several generalizations of the Assmus-Mattson theorem are also stated. In Section 7, some constructions of self-dual codes from designs and Hadamard matrices are presented. In Section 8, it is shown how designs supported by a linear code can be used for decoding of the dual code. An interesting problem is therefore to find designs of minimum rank among designs with given parameters; many results on this problem are mentioned. Finally, in Section 9, methods from the theory of linear codes are utilized for construction and classification of certain types of designs such as quasi-symmetric designs.
      0 references

      Identifiers

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