Constant Weight Codes and Group Divisible Designs

被引：0
|
作者：
Simon Blake-Wilson
Kevin T. Phelps
机构：
[1] University of London,Department of Mathematics, Royal Holloway
[2] Auburn University,Department of Discrete and Statistical Sciences
来源：
Designs, Codes and Cryptography | 1999年 / 16卷
关键词：
constant-weight code; group divisible design; conjugate disjoint Latin square; generalized Steiner system;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：11 / 27
页数：16
相关论文
共 50 条
12345