Optimal codes in the Enomoto-Katona space
From MaRDI portal
Publication:5364232
Recommendations
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)
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)