ISSN:
1573-7586
Keywords:
constant-weight code
;
group divisible design
;
conjugate disjoint Latin square
;
generalized Steiner system
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract The study of a class of optimal constant weight codes over arbitrary alphabets was initiated by Etzion, who showed that such codes are equivalent to special GDDs known as generalized Steiner systems GS(t,k,n,g) Etzion. This paper presents new constructions for these systems in the case t=2, k=3. In particular, these constructions imply that the obvious necessary conditions on the length n of the code for the existence of an optimal weight 3, distance 3 code over an alphabet of arbitrary size are asymptotically sufficient.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1008318207622
Permalink