Perfect error-correcting databases

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

An n×m matrix is called a t-error-correcting database if after deleting any t columns one can still distinguish the rows. It is perfect if after omitting any t+1 columns two identical rows are obtained. (Stating with another terminology, the system of minimal keys induced by A is the system of all (n-t)-element subsets of an n-element set.). Let ft(n) denote the minimum number of rows in a perfect t-error-correcting database of length n. We show that f2(n)=Θ(n2), and in general Ω(n(2t+1){plus 45 degree rule}3)≤ft(n)≤O(nt) for t≥3, whenever n→∞.

Original languageEnglish
Pages (from-to)171-176
Number of pages6
JournalDiscrete Applied Mathematics
Volume28
Issue number2
DOIs
Publication statusPublished - Aug 1990

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Perfect error-correcting databases'. Together they form a unique fingerprint.

  • Cite this