Bounds on the rate of separating codes

I. V. Vorob’ev

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

A code with words in a finite alphabet is said to be an (s, l) separating code if for any two disjoint collections of its words of size at most s and l, respectively, there exists a coordinate in which the set of symbols of the first collection do not intersect the set of symbols of the second. The main goal of the paper is obtaining new bounds on the rate of (s, l) separating codes. Bounds on the rate of binary (s, l) separating codes, the most important for applications, are studied in more detail. We give tables of numerical values of the best presently known bounds on the rate.

Original languageEnglish
Pages (from-to)30-41
Number of pages12
JournalProblems of information transmission
Volume53
Issue number1
DOIs
Publication statusPublished - 1 Jan 2017
Externally publishedYes

Cite this