Perfect error-correcting databases

DOI10.1016/0166-218X(90)90114-RzbMath0738.05071OpenAlexW2103070443MaRDI QIDQ1813978

Zoltan Fueredi

Publication date: 25 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(90)90114-r

zbMATH Keywords

error-correcting databases

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (05C99) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (9)

New type of coding problem motivated by database theory ⋮ Minimum matrix representation of some key system ⋮ A survey of some combinatorial results concerning functional dependencies in database relations. ⋮ Minimum matrix representation of Sperner systems ⋮ SPT(q, k, n)-Codes ⋮ Codes that attain minimum distance in every possible direction ⋮ On the Existence of Armstrong Instances with Bounded Domains ⋮ Coding Theory Motivated by Relational Databases ⋮ Design type problems motivated by database theory

Cites Work

• Minimum matrix representation of closure operations
• Candidate Keys and Antichains
• A relational model of data for large shared data banks
• On a problem of K. Zarankiewicz
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Perfect error-correcting databases