Improved Algorithms and Bounds for List Union-Free Families
Pages 2456 - 2463
Abstract
List union-free families are basic combinatorial structures that appear in different application scenarios, most notably in one-bit compressed sensing. In this paper, we study algorithms for the construction of list union-free families and we provide bounds on the parameters of these families that substantially affect the complexity of the algorithms that utilize them.
References
[1]
J. Acharya, A. Bhattacharyya, and P. Kamath, “Improved bounds for universal one-bit compressive sensing,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jun. 2017, pp. 2353–2357.
[2]
N. Alon and V. Asodi, “Learning a hidden subgraph,” SIAM J. Discrete Math., vol. 18, no. 4, pp. 697–712, Jan. 2005.
[3]
D. J. Balding and D. C. Torney, “Optimal pooling designs with error detection,” J. Combinat. Theory A, vol. 74, no. 1, pp. 131–140, Apr. 1996.
[4]
H. Buhrman, P. B. Miltersen, J. Radhakrishnan, and S. Venkatesh, “Are bitvectors optimal?” SIAM J. Comput., vol. 31, no. 6, pp. 1723–1744, Jan. 2002.
[5]
W. Chu, C. J. Colbourn, and V. R. Syrotiuk, “The effects of synchronization on topology-transparent scheduling,” Wireless Netw., vol. 12, no. 6, pp. 681–690, Dec. 2006.
[6]
A. De Bonis, L. Gasieniec, and U. Vaccaro, “Optimal two-stage algorithms for group testing problems,” SIAM J. Comput., vol. 34, no. 5, pp. 1253–1270, Jan. 2005.
[7]
A. G. D’yachkov and V. V. Rykov, “Bounds on the length of disjunctive codes,” Problemy Peredachi Informatsii, vol. 18, no. 3, pp. 158–166, 1982.
[8]
A. G. D’yachkov, V. V. Rykov, and A. M. Rashad, “Superimposed distance codes,” Problems Control Inform. Theory, vol. 18, no. 4, pp. 237–250, 1989.
[9]
D. Z. Du and F. K. Hwang, Pooling Design and Nonadaptive Group Testing. Singapore: World Scientific, 2006.
[10]
P. Erdös, P. Frankl, and Z. Füredi, “Families of finite sets in which no set is covered by the union of r others,” Israel J. Math., vol. 51, pp. 79–89, Dec. 1985.
[11]
L. Flodin, V. Gandikota, and A. Mazumdar, “Superset technique for approximate recovery in one-bit compressed sensing,” in Proc. Adv. Neural Inf. Process. Syst. (NeurIPS), vol. 32, 2019, pp. 10387–10396.
[12]
Z. Füredi, “On r-cover-free families,” J. Combin. Theory. Ser. A, vol. 73, pp. 172–173, Jan. 1996.
[13]
Y. Gu and Y. Miao, “Union–intersection-bounded families and their applications,” Discrete Appl. Math., vol. 266, pp. 346–354, Aug. 2019.
[14]
T. B. Idalino and L. Moura, “A survey of cover-free families: Constructions, applications and generalizations,” Stinson66—New Advances in Designs, Codes and Cryptography (Fields Institute Communications), C. Colbourn and J. Dinitz Eds. Cham, Switzerland: Springer, 2023, p. 45.
[15]
J. Komlos and A. Greenberg, “An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels,” IEEE Trans. Inf. Theory, vol. IT-31, no. 2, pp. 302–306, Mar. 1985.
[16]
R. Kumar, S. Rajagopalan, and A. Sahai, “Coding constructions for blacklisting problems without computational assumptions,” in Advances in Cryptology (CRYPTO) (Lecture Notes in Computer Science), M. Wiener, Ed. Berlin, Germany: Springer, 1999, pp. 609–623.
[17]
A. J. Macula, “Error-correcting nonadaptive group testing with de-disjunct matrices,” Discrete Appl. Math., vol. 80, nos. 2–3, pp. 217–222, Dec. 1997.
[18]
N. Matsumoto, A. Mazumdar, and S. Pal, “Improved support recovery in universal one-bit compressed sensing,” 2022, arXiv:2210.16657.
[19]
A. Mazumdar and P. Soumyabrata, “Support recovery in universal one-bit compressed sensing,” in Proc. 13th Innov. Theor. Comput. Sci. Conf. (ITCS), 2022, pp. 1–20.
[20]
R. A. Moser and G. Tardös, “A constructive proof of the general Lovász Local Lemma,” J. ACM, vol. 57, no. 2, pp. 1–15, 2010.
[21]
H. Q. Ngo, E. Porat, and A. Rudra, “Efficiently decodable error-correcting list disjunct matrices and applications,” in Automata, Languages and Programming (Lecture Notes in Computer Science), L. Aceto, M. Henzinger, and J. Sgall, Eds. 2011, pp. 557–568.
[22]
E. Porat and A. Rothschild, “Explicit nonadaptive combinatorial group testing schemes,” IEEE Trans. Inf. Theory, vol. 57, no. 12, pp. 7982–7989, Dec. 2011.
[23]
M. Ruszinkó, “On the upper bound of the size of the r-cover-free families,” J. Combinat. Theory A, vol. 66, no. 2, pp. 302–310, May 1994.
[24]
C. Shangguan and G. Ge, “New bounds on the number of tests for disjunct matrices,” IEEE Trans. Inf. Theory, vol. 62, no. 12, pp. 7518–7521, Dec. 2016.
[25]
D. R. Stinson and R. Wei, “Generalized cover-free families,” Discrete Math., vol. 279, nos. 1–3, pp. 463–477, Mar. 2004.
[26]
R. de Wolf. (2012). Efficient Data Structures From Union-Free Families of Sets. [Online]. Available: https://homepages.cwi.nl/~rdewolf/unionfree_datastruc.pdf
Recommendations
An Improved Bound on the List Error Probability and List Distance Properties
List decoding of binary block codes for the additive white Gaussian noise (AWGN) channel is considered. The output of a list decoder is a list of the most likely codewords, that is, the signal points closest to the received signal in the Euclidean-...
Combinatorics of Unique Maximal Factorization Families (UMFFs)
Special Issue on StringologySuppose a set W of strings contains exactly one rotation (cyclic shift) of every primitive string on some alphabet Σ. Then W is a circ-UMFF if and only if every word in Σ$^+$ has a unique maximal factorization over W. The classic circ-UMFF is the set of ...
Combinatorics of Unique Maximal Factorization Families (UMFFs)
Special Issue on StringologySuppose a set W of strings contains exactly one rotation (cyclic shift) of every primitive string on some alphabet Σ. Then W is a circ-UMFF if and only if every word in Σ$^+$ has a unique maximal factorization over W. The classic circ-UMFF is the set of ...
Comments
Information & Contributors
Information
Published In
0018-9448 © 2023 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.
Publisher
IEEE Press
Publication History
Published: 18 September 2023
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025