Constructions of optimal quaternary constant weight codes via group divisible designs (Q1045091)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constructions of optimal quaternary constant weight codes via group divisible designs |
scientific article; zbMATH DE number 5648133
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructions of optimal quaternary constant weight codes via group divisible designs |
scientific article; zbMATH DE number 5648133 |
Statements
Constructions of optimal quaternary constant weight codes via group divisible designs (English)
0 references
15 December 2009
0 references
Generalized Steiner systems \(GS(2, k, v, g)\) were first introduced by Etzion who used them to construct optimal constant weight codes over an alphabet of size \(g + 1\) and minimum Hamming distance \(2k - 3\), in which each codeword has length \(v\) and weight \(k\). The paper constructs large classes of group divisible designs. The authors then use these group divisible designs for constructing codes and extend the known results on the existence of optimal quaternary constant weight codes.
0 references
group divisible designs
0 references
orthogonal arrays
0 references
skew starters
0 references
generalized steiner system group divisible designs
0 references
arrays
0 references
generalized group divisible designs
0 references
generalized steiner system system
0 references