SPT(q, k, n)-Codes

DOI10.1016/j.endm.2007.07.066zbMath1341.94029OpenAlexW2084943605MaRDI QIDQ3503498

László A. Székely, Attila Sali

Publication date: 5 June 2008

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2007.07.066

zbMATH Keywords

databasefunctional dependencyspherical code\(q\)-ary codeLovász' local lemma

Mathematics Subject Classification ID

Database theory (68P15) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Other types of codes (94B60)

Cites Work

• 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
• Codes that attain minimum distance in every possible direction
• Horn clauses and database dependencies
• The Closest Packing of Spherical Caps in n Dimensions
• Foundations of Information and Knowledge Systems
• Foundations of Information and Knowledge Systems

This page was built for publication: SPT(q, k, n)-Codes