Improved Algorithms and Bounds for List Union-Free Families

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 s...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on information theory Vol. 70; no. 4; p. 1
Main Authors Rescigno, Adele A., Vaccaro, Ugo
Format Journal Article
LanguageEnglish
Published New York IEEE 01.04.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithms
Combinatorial analysis
Complexity theory
Compressed sensing
Linear matrix inequalities
Probabilistic logic
Testing
Time complexity
Upper bound
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2023.3316435