scientific article; zbMATH DE number 1284428
binary codescode constructioncombinatorial designconstant weight codesHadamard matriceslinear codesorthogonal arraysperfect codesself-dual codesSteiner systems
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Other designs, configurations (05B30) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Linear codes (general theory) (94B05) Combinatorial codes (94B25) Majority codes (94B30) Bounds on codes (94B65)
\{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.
- Cocyclic Hadamard matrices from forms over finite Frobenius rings
- Designs through recoding of varietal and level codes
- Infinite families of 2-designs and 3-designs from linear codes
- Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros
- On Pless symmetry codes, ternary QR codes, and related Hadamard matrices and designs
- The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes
- A class of affine-invariant codes and their support 2-designs
- Infinite families of 2-designs from linear codes
- Combinatorial \(t\)-designs from quadratic functions
- Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes
- Johnson type bounds for mixed dimension subspace codes
- New classes of self-complementary codes and quasi-symmetric designs
- The characterization of binary constant weight codes meeting the bound of Fu and Shen
- Cyclic quasi-symmetric designs and self-orthogonal codes of length 63
- An infinite family of antiprimitive cyclic codes supporting Steiner systems \(S(3,8, 7^m+1)\)
- Codes and Designs
- On the inclusion matrix \(W_{23}(v)\)
- scientific article; zbMATH DE number 3552381 (Why is no real title available?)
- Some sequences of optimal constant weight codes
- On the self‐dual 𝔽5‐codes constructed from Hadamard matrices of order 24
- Orthogonal designs, self‐dual codes, and the Leech lattice
- scientific article; zbMATH DE number 1885940 (Why is no real title available?)
- scientific article; zbMATH DE number 874557 (Why is no real title available?)
- On Error-Correcting Codes and Invariant Linear Forms
- Parameters of 2-designs from some BCH codes
- On the classification and enumeration of self-dual codes
- Infinite families of 2-designs from a class of affine-invariant codes
- Linear codes and cyclic codes over finite rings and their generalizations: a survey
- Steiner systems \(S(2,4, 2^m)\) supported by a family of extended cyclic codes
- Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\)
- Infinite families of 2‐designs derived from affine‐invariant codes
- Ternary codes, biplanes, and the nonexistence of some quasisymmetric and quasi‐3 designs
- Some 3-designs and shortened codes from binary cyclic codes with three zeros
- Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions
- Infinite families of 3‐designs from APN functions
- Infinite families of 2‐designs from a class of cyclic codes
- New support 5-designs from lifted linear codes
- Switching codes and designs
- Infinite families of 3-designs from special symmetric polynomials
- The support designs of several families of lifted linear codes
- Infinite families of 3-designs from o-polynomials
- Infinite families of 2-designs from a class of non-binary Kasami cyclic codes
- Good equidistant codes constructed from certain combinatorial designs
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 Q4242022)