A coding theoretic approach to extending designs
type: Item
instance of: scholarly article
title: A coding theoretic approach to extending designs
zbMATH Open document ID: 0834.05006
DOI: 10.1016/0012-365X(94)00010-G
author: George T. Kennedy
author: V. Pless
published in: Discrete Mathematics
publication date: 1996-03-31T00:00:00Z
review text: One of the major links between coding theory and design theory is the study of designs held by the words of some fixed weight in a binary code. The authors consider the similar problem for a coset of a binary code. A second question that is studied is the extension of such designs. The results depend on theorems of \textit{W. O. Alltop} [Extending \(t\)-designs, J. Comb. Theory, Ser. A 18, 177--186 (1975; Zbl 0297.05028)] and on the Assmus-Mattson theorem. Several examples are given, notably for cosets of self-dual codes, e.g. 3-designs in the so-called baby Golay code. These can be extended to 5-designs related to the Golay code itself.
reviewed by: Jack van Lint
Mathematics Subject Classification ID: 05B05
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 790757
zbMATH Keywords: design
zbMATH Keywords: binary code
zbMATH Keywords: Assmus-Mattson theorem
zbMATH Keywords: Golay code
MaRDI profile type: Publication
cites work: An infinite class of 5-designs
cites work: Q3741626
cites work: On the coveting radius of extremal self-dual codes
cites work: New uniqueness proofs for the (5,8,24), (5,6,12) and related Steiner systems
cites work: Orphan structure of the first-order Reed--Muller codes
cites work: Orphans of the first order Reed-Muller codes
cites work: Weight enumerators of self-dual codes
cites work: On the enumeration of self-dual codes
cites work: A new upper bound on the minimal distance of self-dual codes
cites work: On designs and formally self-dual codes
cites work: Q4146667
cites work: Q3315516
cites work: Q3996427
cites work: Generalized quadratic residue codes
Wikidata QID: Q127830110
description: scientific article; zbMATH DE number 790757