A coding theoretic approach to extending designs (Q1896352): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q127830110, #quickstatements; #temporary_batch_1722491441236 |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An infinite class of 5-designs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3741626 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the coveting radius of extremal self-dual codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New uniqueness proofs for the (5,8,24), (5,6,12) and related Steiner systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Orphan structure of the first-order Reed--Muller codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Orphans of the first order Reed-Muller codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Weight enumerators of self-dual codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the enumeration of self-dual codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new upper bound on the minimal distance of self-dual codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On designs and formally self-dual codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4146667 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3315516 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3996427 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalized quadratic residue codes / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q127830110 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 07:53, 1 August 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A coding theoretic approach to extending designs |
scientific article |
Statements
A coding theoretic approach to extending designs (English)
0 references
31 March 1996
0 references
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.
0 references
design
0 references
binary code
0 references
Assmus-Mattson theorem
0 references
Golay code
0 references