Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Designs, Codes and Cryptography
Published in: Designs, Codes and Cryptography 1-2/2017

19-08-2016

Cover-free codes and separating system codes

Authors: A. G. D’yachkov, I. V. Vorobyev, N. A. Polyanskii, V. Yu. Shchukin

Published in: Designs, Codes and Cryptography | Issue 1-2/2017

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

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.
previous article Towards a general construction of recursive MDS diffusion layers
next article Symmetric disjunctive list-decoding codes
Literature
1.
Barg A., Blakley G.R., Kabatiansky G.A.: Digital fingerprinting codes: problem statements, constructions, identification of traitors. IEEE Trans. Inf. Theory 49(5), 852–865 (2003).
2.
Boneh D., Shaw J.: Collusion-secure fingerprinting for digital data. IEEE Trans. Inf. Theory 44(5), 1897–1905 (1998).
3.
Cohen G.D., Schaathun H.G.: Asymptotic overview on separating codes. Technical Report 248, Department of Informatics, University of Bergen, Norway (2003).
4.
D’yachkov A.G., Macula A.J., Vilenkin P.A., Torney D.C.: Families of finite sets in which no intersection of \({\ell }\) sets is covered by the union of \(s\) others. J. Comb. Theory Ser. A 99(2), 195–218 (2002).
5.
D’yachkov A.G., Vorobyev I.V., Polyanskii N.A., Shchukin VYu: Bounds on the rate of disjunctive codes. Probl. Inf. Transm. 50(1), 27–56 (2014).
6.
D’yachkov A.G., Vorobyev I.V., Polyanskii N.A., Shchukin V.Yu.: Cover-free codes and separating system codes. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), pp. 2894–2898, IEEE, Hong Kong (2015).
7.
Engel K.: Interval packing and covering in the Boolean lattice. Comb. Prob. Comput. 5(4), 373–384 (1996).
8.
Friedman A.D., Graham R.L., Ullman J.D.: Universal single transition time asynchronous state assignments. IEEE Trans. Comput. 18(6), 541–547 (1969).
9.
Lebedev V.S.: Asymptotic upper bound for the rate of \((w, r)\) cover-free codes. Probl. Inf. Transm. 39(4), 317–323 (2003).
10.
Mago G.: Monotone functions in sequential circuits. IEEE Trans. Comput. 22(10), 928–933 (1973).
11.
Mitchell C.J., Piper F.C.: Key storage in secure networks. Discret. Appl. Math. 21(3), 215–228 (1988).
12.
Sagalovich Yu.L.: Cascade codes of automata states. Probl. Inf. Transm. 14(2), 77–85 (1978).
13.
Sagalovich Yu.L.: Completely separating systems. Probl. Inf. Transm. 18(2), 140–146 (1982).
14.
Sagalovich Yu.L.: Separating systems. Probl. Inf. Transm. 30(2), 105–123 (1994).
15.
16.
Staddon J.N., Stinson D.R., Wei R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inf. Theory 47(3), 1042–1049 (2001).
17.
Stinson D.R., Wei R., Chen K.: On generalized separating hash families. J. Comb. Theory Ser. A 115(1), 105–120 (2008).
Metadata
Title
Cover-free codes and separating system codes
Authors
A. G. D’yachkov
I. V. Vorobyev
N. A. Polyanskii
V. Yu. Shchukin
Publication date
19-08-2016
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 1-2/2017
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-016-0265-9

Other articles of this Issue 1-2/2017

Designs, Codes and Cryptography 1-2/2017 Go to the issue

OriginalPaper

On some permutation binomials and trinomials over

OriginalPaper

Revisiting (nested) Roos bias in RC4 key scheduling algorithm

OriginalPaper

Improving algebraic attacks on stream ciphers based on linear feedback shift register over

OriginalPaper

A code-based group signature scheme

OriginalPaper

Joint data and key distribution of simple, multiple, and multidimensional linear cryptanalysis test statistic and its impact to data complexity

OriginalPaper

Reflection ciphers

Premium Partner

    Image Credits