A new type of coding problem

Studia Scientiarum Mathematicarum Hungarica

Volumn 38, Issue 1-4, 2002, Pages 139-147

  Brightwell, G ^a   Katona, G O H ^b  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

^b ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

Author keywords

Code; Design; Distance; Graph; Hamiltonian cycle

Indexed keywords

EID: 0042417307     PISSN: 00816906     EISSN: None     Source Type: Journal    
DOI: 10.1556/sscmath.38.2001.1-4.9     Document Type: Article

References (5)

1. DEMETROVICS, J., KATONA, G. O. H. and SALI, A., Design type problems motivated by database theory, J. Statist. Plann. Inference 72 (1998), 149-164. MR 99h:68037
2. ENOMOTO, H. and KATONA, G. O. H., Pairs of disjoint q-element subsets far from each other, Electron. J. Combin. 8 (2001).
3. FRANKL, P. and RÖDL, V., Near perfect coverings in graphs and hypergraphs, European J. Combin. 6 (1985), 317-326. MR 88a:05116
4. GRAHAM, R. L. and SLOANE, N. J. A., Lower bounds for constant weight codes, IEEE Trans. Inform. Theory 26 (1980), 37-43. MR 81d:94026
5. RÖDL, V., On a packing and covering problem, European J. Combin. 6 (1985), 69-78. MR 86k:05033