Combinatiorial problems in the Enomoto-Katona space

DOI10.1556/SSCMATH.2008.1080zbMATH Open1240.94134OpenAlexW2100466276MaRDI QIDQ3076868FDOQ3076868

Authors: Jörn Quistorff 

Publication date: 25 February 2011

Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1556/sscmath.2008.1080

Recommendations

• New upper bounds on Enomoto Katona’s coding type problem
• Optimal codes in the Enomoto-Katona space
• A new type of coding problem
• Odd and even Hamming spheres also have minimum boundary
• A coding problem for pairs of subsets

zbMATH Keywords

sphere packing problemcoding-type problemEnomoto-Katona metricunordered pair of disjoint subsets

Mathematics Subject Classification ID

Combinatorial codes (94B25) Bounds on codes (94B65) Combinatorial aspects of packing and covering (05B40) Extremal set theory (05D05)

Cited In (3)

• Coding theory motivated by relational databases
• Optimal codes in the Enomoto-Katona space
• New upper bounds on Enomoto Katona’s coding type problem

This page was built for publication: Combinatiorial problems in the Enomoto-Katona space

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