Optimal codes in the Enomoto-Katona space

DOI10.1017/S0963548314000509MaRDI QIDQ5364232zbMATH OpenFDO

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)

Mathematics Subject Classification ID

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

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

Cites work

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

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)