New type of coding problem motivated by database theory

Authors:
Gyula O. H. Katona;Attila Sali
Affiliations:
Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Budapest P.O.Box 127 H-1364, Hungary;Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Budapest P.O.Box 127 H-1364, Hungary
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 10
Cited 0

On minimum matrix representation of closure operations

Discrete Applied Mathematics
Perfect error-correcting databases

Discrete Applied Mathematics
Two conjectures of Demetrovics, Furedi, and Katona, concerning partitions

Discrete Mathematics
The characterization of branching dependencies

Discrete Applied Mathematics - Special issue on combinatorial problems in databases
Generalized dependencies in relational databases

Acta Cybernetica
A relational model of data for large shared data banks

Communications of the ACM
On Orthogonal Double Covers of Graphs

Designs, Codes and Cryptography
Extremal Combinatorial Problems in Relational Data Base

FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
Minimum matrix representation of closure operations

Discrete Applied Mathematics
Lower bounds for constant weight codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.04

Visualization

Abstract

The present paper is intended to survey the interaction between relational database theory and coding theory. In particular it is shown how an extremal problem for relational databases gives rise to a new type of coding problem. The former concerns minimal representation of branching dependencies that can be considered as a data mining type question. The extremal configurations involve d-distance sets in the space of disjoint pairs of k-element subsets of an n-element set X. Let X be an n-element finite set, 0