This article is on designing a compact data structure for multi-set membership testing that
allows fast set querying. Multi-set membership testing is a fundamental operation for …

This first chapter formulates the objectives of compressive sensing. It introduces the
standard compressive problem studied throughout the book and reveals its ubiquity in many …

It is gratifying that this textbook is still sufficiently popular to warrant a third edition. I have
used the opportunity to improve and enlarge the book. When the second edition was …

Aimed at graduate students and researchers, this fascinating text provides a comprehensive
study of the Erdős–Ko–Rado Theorem, with a focus on algebraic methods. The authors …

This paper first considers several types of additive bases. A typical problem is to find n_γ(k),
the largest n for which there exists a set {0=a_1<a_2<⋯<a_k\} of distinct integers modulo n …

A table of binary constant weight codes of length n ý28 is presented. Explicit constructions
are given for most of the 600 codes in the table; the majority of these codes are new. The …

On single-deletion-correcting codes Page 1 On single-deletion-correcting codes NJA Sloane
Abstract. This paper gives a brief survey of binary single-deletion-correcting codes. The …

Simulated annealing is a computational heuristic for obtaining approximate solutions to
combinatorial optimization problems. It is used to construct good source codes, error …

Combinatorial configurations, designs, codes, graphs | Guide books skip to main content
ACM Digital Library home ACM home Google, Inc. (search) Advanced Search Browse …

Codes for rank modulation have been recently proposed as a means of protecting flash
memory devices from errors. We study basic coding theoretic problems for such codes …