New type of coding problem motivated by database theory

DOI10.1016/j.dam.2004.03.004zbMath1078.68024OpenAlexW2091669764MaRDI QIDQ1885817

Attila Sali, Gyula O. H. Katona

Publication date: 12 November 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/21070/1/paper_102.pdf

zbMATH Keywords

Relational databaseCode\(d\)-distance setFunctional and branching dependencies

Mathematics Subject Classification ID

Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (2)

Optimal Codes in the Enomoto-Katona Space ⋮ Constructing Armstrong tables for general cardinality constraints and not-null constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on minimal matrix representation of closure operations
• Minimum matrix representation of closure operations
• Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions
• The characterization of branching dependencies
• Design type problems motivated by database theory
• The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
• Orthogonal double covers of complete graphs by trees
• Perfect error-correcting databases
• On minimum matrix representation of closure operations
• A new type of coding problem
• Lower bounds for constant weight codes
• On orthogonal double covers of k_n and a conjecture of chung and west
• A relational model of data for large shared data banks
• On orthogonal double covers of graphs
• Pairs of disjoint \(q\)-element subsets far from each other

This page was built for publication: New type of coding problem motivated by database theory