Name
Abstract | ||
|---|---|---|
The studyof a class of optimal constant weight codes over arbitrary alphabetswas initiated by Etzion, who showed that such codes are equivalentto special GDDs known as generalized Steiner systems GS(t,k,n,g)Etzion. This paper presents new constructions for these systemsin the case t=2, k=3. In particular,these constructions imply that the obvious necessary conditionson the length n of the code for the existence ofan optimal weight 3, distance 3 code over an alphabet of arbitrarysize are asymptotically sufficient. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1023/A:1008318207622 | Des. Codes Cryptography |
Keywords | Field | DocType |
constant-weight code,group divisible design,conjugate disjoint Latin square,generalized Steiner system | Steiner systems,Discrete mathematics,Combinatorics,Constant-weight code,Mathematics,Alphabet | Journal |
Volume | Issue | ISSN |
16 | 1 | 1573-7586 |
Citations | PageRank | References |
22 | 1.53 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Simon Blake-wilson | 1 | 481 | 33.51 |
| Kevin T. Phelps | 2 | 210 | 33.69 |