A new type of coding problem

DOI10.1556/SSCMATH.38.2001.1-4.9MaRDI QIDQ3150909zbMATH OpenFDO

Authors Graham Brightwell, Gyula O. H. Katona

Publication date 20 October 2002

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

Full work available at URL https://doi.org/10.1556/SSCMATH.38.2001.1-4.9

zbMATH Keywords

codedesigndistancegraphHamiltonian cycle

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Other types of codes (94B60)

Recommendations

• A coding problem for pairs of subsets
• Pairs of disjoint \(q\)-element subsets far from each other
• Error-correcting codes based on partial maps in finite sets.
• New type of coding problem motivated by database theory
• New upper bounds on Enomoto Katona’s coding type problem

Cited in

(9)

• New type of coding problem motivated by database theory
• Applications of graph containers in the Boolean lattice
• Combinatiorial problems in the Enomoto-Katona space
• Coding theory motivated by relational databases
• Error-correcting codes based on partial maps in finite sets.
• Set-codes with small intersections and small discrepancies
• Optimal codes in the Enomoto-Katona space
• A coding problem for pairs of subsets
• Pairs of disjoint \(q\)-element subsets far from each other

This page was built for publication: A new type of coding problem

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