### 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 f_{t}(n) denote the minimum number of rows in a perfect t-error-correcting database of length n. We show that f_{2}(n)=Θ(n^{2}), and in general Ω(n^{(2t+1){plus 45 degree rule}3})≤f_{t}(n)≤O(n^{t}) for t≥3, whenever n→∞.

Original language | English |
---|---|

Pages (from-to) | 171-176 |

Number of pages | 6 |

Journal | Discrete Applied Mathematics |

Volume | 28 |

Issue number | 2 |

DOIs | |

Publication status | Published - 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

Füredi, Z. (1990). Perfect error-correcting databases.

*Discrete Applied Mathematics*,*28*(2), 171-176. https://doi.org/10.1016/0166-218X(90)90114-R