Loading [a11y]/accessibility-menu.js
Improved Algorithms and Bounds for List Union-Free Families | IEEE Journals & Magazine | IEEE Xplore

Improved Algorithms and Bounds for List Union-Free Families


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 ...Show More

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.
Published in: IEEE Transactions on Information Theory ( Volume: 70, Issue: 4, April 2024)
Page(s): 2456 - 2463
Date of Publication: 18 September 2023

ISSN Information:

Funding Agency:


References

References is not available for this document.