Bounds and algorithms for generalized superimposed codes
We introduce a class of generalized superimposed codes that include several cases already studied in the literature. We give bounds on their size and algorithms for their construction. •We introduce a generalization of superimposed codes that includes combinatorial structures already studied in the...
Saved in:
Published in: | Information processing letters Vol. 182; p. 106365 |
---|---|
Main Authors: | , |
Format: | Journal Article |
Language: | English |
Published: |
Elsevier B.V
01-08-2023
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | We introduce a class of generalized superimposed codes that include several cases already studied in the literature. We give bounds on their size and algorithms for their construction.
•We introduce a generalization of superimposed codes that includes combinatorial structures already studied in the literature.•We give algorithms for their constructions.•We give bounds on their lengths (the relevant parameter in the application scenarios where superimposed codes are used).•We show that our results improve, on several respects, previously known results. |
---|---|
ISSN: | 0020-0190 1872-6119 |
DOI: | 10.1016/j.ipl.2023.106365 |