Codes that attain minimum distance in every possible direction

DOI10.2478/s11533-008-0001-4zbMath1140.94020OpenAlexW2025465674MaRDI QIDQ2425557

Attila Sali, Klaus-Dieter Schewe

Publication date: 6 May 2008

Published in: Central European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/s11533-008-0001-4

zbMATH Keywords

databasefunctional dependencyError correcting codesextremal problems of codeskey dependency

Mathematics Subject Classification ID

Database theory (68P15) Bounds on codes (94B65) Combinatorial codes (94B25) Extremal combinatorics (05D99)

Related Items (6)

SPT(q, k, n)-Codes ⋮ Proceedings of the conference on finite geometries, Oberwolfach, Germany, December 2--7, 2001 ⋮ Note on the size of binary Armstrong codes ⋮ Ideal non-deterministic operators as a formal framework to reduce the key finding problem ⋮ On the Existence of Armstrong Instances with Bounded Domains ⋮ Coding Theory Motivated by Relational Databases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on minimal matrix representation of closure operations
• Minimum matrix representation of closure operations
• The characterization of branching dependencies
• Design type problems motivated by database theory
• A survey of some combinatorial results concerning functional dependencies in database relations.
• Perfect error-correcting databases
• Horn clauses and database dependencies
• Foundations of Information and Knowledge Systems
• Foundations of Information and Knowledge Systems

This page was built for publication: Codes that attain minimum distance in every possible direction