Optimal codes in the Enomoto-Katona space
Authors:
- 1 July 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 321-325
Abstract
Coding in a new metric space, the Enomoto-Katona space, is considered recently in connection to the study of implication structures of functional dependencies and their generalizations in relational databases. The central problem here is the determination of C(n, k, d), the size of an optimal code of length n, weight k, and distance d in the Enomoto-Katona space. The value of C(n, k, d) is known only for some congruence classes of n when (k, d) ∈ {(2, 3), (3, 5)}. In this paper, we obtain new infinite families of optimal codes in the Enomoto-Katona space. In particular, C(n, k, 2k-1) is determined for all sufficiently large n satisfying either n ≡ 1 mod k and n(n-1) ≡ 0 mod 2k 2 , or n ≡ 0 mod k.Keywords
This publication has 15 references indexed in Scilit:
- A coding problem for pairs of subsets2014
- Combinatorial problems in the Enomoto-Katona spaceStudia Scientiarum Mathematicarum Hungarica, 2009
- New type of coding problem motivated by database theoryDiscrete Applied Mathematics, 2004
- A new type of coding problemStudia Scientiarum Mathematicarum Hungarica, 2001
- Decompositions of Edge-Colored Complete GraphsJournal of Combinatorial Theory, Series A, 2000
- The characterization of branching dependenciesDiscrete Applied Mathematics, 1992
- Independent components of relationsACM Transactions on Database Systems, 1977
- A complete axiomatization for functional and multivalued dependencies in database relations1977
- Synthesizing third normal form relations from functional dependenciesACM Transactions on Database Systems, 1976
- A relational model of data for large shared data banksCommunications of the ACM, 1970