Merging covering arrays and compressing multiple sequence alignments
Discrete Applied Mathematics
Efficient conditional expectation algorithms for constructing hash families
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Strengthening hash families and compressive sensing
Journal of Discrete Algorithms
An extension of Stein-Lovász theorem and some of its applications
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We study a wide class of problems in coding theory for which we consider two different formulations: in terms of incidence matrices and in terms of hypergraphs. These problems are dealt with using a greedy algorithm due to Stein (1974) and Lovasz (1975). Some examples, including constructing covering codes, codes for conflict resolution, separating systems, source encoding with distortion, etc., are given a unified treatment. Under certain conditions derandomization can be performed, leading to an essential reduction in the complexity of the constructions