Cover-free codes and separating system codes

We give some relations between the asymptotic rates of cover-free (CF) codes, separating system (SS) codes and completely separating system (CSS) codes. We also provide new upper bounds on the asymptotic rate of SS codes based on known results for CF and CSS codes. Finally, we derive a random coding...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Designs, codes, and cryptography codes, and cryptography, 2017, Vol.82 (1-2), p.197-209
Hauptverfasser:	D’yachkov, A. G., Vorobyev, I. V., Polyanskii, N. A., Shchukin, V. Yu
Format:	Artikel
Sprache:	eng
Schlagworte:	Asymptotic properties Circuits Coding and Information Theory Computer Science Cryptology Data Structures and Information Theory Discrete Mathematics in Computer Science Information and Communication Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We give some relations between the asymptotic rates of cover-free (CF) codes, separating system (SS) codes and completely separating system (CSS) codes. We also provide new upper bounds on the asymptotic rate of SS codes based on known results for CF and CSS codes. Finally, we derive a random coding bound for the asymptotic rate of SS codes and give tables of numerical values corresponding to our improved upper bounds.
ISSN:	0925-1022 1573-7586
DOI:	10.1007/s10623-016-0265-9