Optimal codes in the Enomoto-Katona space

DOI10.1017/S0963548314000509zbMATH Open1371.05139MaRDI QIDQ5364232FDOQ5364232

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

Publication date: 4 October 2017

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

Recommendations

• Combinatiorial problems in the Enomoto-Katona space
• New upper bounds on Enomoto Katona’s coding type problem
• Codes that attain minimum distance in every possible direction
• New type of coding problem motivated by database theory
• scientific article; zbMATH DE number 3685396

Mathematics Subject Classification ID

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

Cites Work

• Decompositions of edge-colored complete graphs
• The CRC handbook of combinatorial designs
• A relational model of data for large shared data banks
• Title not available (Why is that?)
• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• Title not available (Why is that?)
• The characterization of branching dependencies
• Title not available (Why is that?)
• Design type problems motivated by database theory
• Pairs of disjoint \(q\)-element subsets far from each other
• Coding theory motivated by relational databases
• New type of coding problem motivated by database theory
• A new type of coding problem
• Optimal codes in the Enomoto-Katona space
• Combinatiorial problems in the Enomoto-Katona space

Cited In (5)

• Applications of graph containers in the Boolean lattice
• $K$-Dimensional Coding Schemes in Hilbert Spaces
• Optimal codes in the Enomoto-Katona space
• Optimal Narain CFTs from codes
• Combinatiorial problems in the Enomoto-Katona space

This page was built for publication: Optimal codes in the Enomoto-Katona space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5364232)