Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Csuros, M.
and
Ruszinko, M.
2005.
Single-User Tracing and Disjointly Superimposed Codes.
IEEE Transactions on Information Theory,
Vol. 51,
Issue. 4,
p.
1606.
Schwartz, M.
and
Vardy, A.
2006.
On the stopping distance and the stopping redundancy of codes.
IEEE Transactions on Information Theory,
Vol. 52,
Issue. 3,
p.
922.
Laczay, Balint
and
Ruszinko, Miklos
2006.
Multiple User Tracing Codes.
p.
1900.
KÖRNER, JÁNOS
and
SINAIMERI, BLERINA
2007.
On Cancellative Set Families.
Combinatorics, Probability and Computing,
Vol. 16,
Issue. 05,
p.
767.
FÜREDI, ZOLTÁN
2012.
2-Cancellative Hypergraphs and Codes.
Combinatorics, Probability and Computing,
Vol. 21,
Issue. 1-2,
p.
159.
De Bonis, Annalisa
and
Vaccaro, Ugo
2015.
Fundamentals of Computation Theory.
Vol. 9210,
Issue. ,
p.
255.
De Bonis, Annalisa
and
Vaccaro, Ugo
2017.
$\epsilon $ -Almost Selectors and Their Applications to Multiple-Access Communication.
IEEE Transactions on Information Theory,
Vol. 63,
Issue. 11,
p.
7304.
Gargano, Luisa
Rescigno, Adele A.
and
Vaccaro, Ugo
2017.
Combinatorial Optimization and Applications.
Vol. 10628,
Issue. ,
p.
276.
De Bonis, Annalisa
2019.
New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions.
Theoretical Computer Science,
Vol. 796,
Issue. ,
p.
34.
Egorova, E. E.
and
Kabatiansky, G. A.
2021.
Separable Collusion-Secure Multimedia Codes.
Problems of Information Transmission,
Vol. 57,
Issue. 2,
p.
178.
Tsunoda, Yu
and
Fujiwara, Yuichiro
2022.
Weak Superimposed Codes of Improved Asymptotic Rate and Their Randomized Construction.
p.
784.
Qian, Bingchen
Wang, Xin
and
Ge, Gennian
2023.
Improved Lower Bounds for Strongly Separable Matrices and Related Combinatorial Structures.
IEEE Transactions on Information Theory,
Vol. 69,
Issue. 5,
p.
2801.