Optimal Codes in the Enomoto-Katona Space

DOI10.1017/S0963548314000509zbMath1371.05139MaRDI QIDQ5364232

Hui Zhang, Yoew Meng Chee, Han Mao Kiah, Xian De Zhang

Publication date: 4 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Applications of graph containers in the Boolean lattice ⋮ Optimal Codes in the Enomoto-Katona Space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The characterization of branching dependencies
• Design type problems motivated by database theory
• New type of coding problem motivated by database theory
• Decompositions of edge-colored complete graphs
• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• Combinatorial problems in the Enomoto-Katona space
• Coding Theory Motivated by Relational Databases
• A new type of coding problem
• Optimal Codes in the Enomoto-Katona Space
• A relational model of data for large shared data banks
• Pairs of disjoint \(q\)-element subsets far from each other

This page was built for publication: Optimal Codes in the Enomoto-Katona Space