Computer Science > Information Theory
arXiv:2409.10511 (cs)
[Submitted on 16 Sep 2024]
Title:Weak Superimposed Codes of Improved Asymptotic Rate and Their Randomized Construction
View a PDF of the paper titled Weak Superimposed Codes of Improved Asymptotic Rate and Their Randomized Construction, by Yu Tsunoda and Yuichiro Fujiwara
View PDFHTML (experimental)Abstract:Weak superimposed codes are combinatorial structures related closely to generalized cover-free families, superimposed codes, and disjunct matrices in that they are only required to satisfy similar but less stringent conditions. This class of codes may also be seen as a stricter variant of what are known as locally thin families in combinatorics. Originally, weak superimposed codes were introduced in the context of multimedia content protection against illegal distribution of copies under the assumption that a coalition of malicious users may employ the averaging attack with adversarial noise. As in many other kinds of codes in information theory, it is of interest and importance in the study of weak superimposed codes to find the highest achievable rate in the asymptotic regime and give an efficient construction that produces an infinite sequence of codes that achieve it. Here, we prove a tighter lower bound than the sharpest known one on the rate of optimal weak superimposed codes and give a polynomial-time randomized construction algorithm for codes that asymptotically attain our improved bound with high probability. Our probabilistic approach is versatile and applicable to many other related codes and arrays.
| Comments: | 6 pages, accepted for presentation at the 2022 IEEE International Symposium on Information Theory (ISIT) |
| Subjects: | Information Theory (cs.IT) |
| Cite as: | arXiv:2409.10511 [cs.IT] |
| (orarXiv:2409.10511v1 [cs.IT] for this version) | |
| https://doi.org/10.48550/arXiv.2409.10511 arXiv-issued DOI via DataCite | |
| Journal reference: | Proc. IEEE International Symposium on Information Theory (ISIT), pp. 784-789, 2022 |
| Related DOI: | https://doi.org/10.1109/ISIT50566.2022.9834680 DOI(s) linking to related resources |
Full-text links:
Access Paper:
- View PDF
- HTML (experimental)
- TeX Source
- Other Formats
View a PDF of the paper titled Weak Superimposed Codes of Improved Asymptotic Rate and Their Randomized Construction, by Yu Tsunoda and Yuichiro Fujiwara
References & Citations
Bookmark
Bibliographic and Citation Tools
Bibliographic Explorer(What is the Explorer?)
Connected Papers(What is Connected Papers?)
Litmaps(What is Litmaps?)
scite Smart Citations(What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv(What is alphaXiv?)
CatalyzeX Code Finder for Papers(What is CatalyzeX?)
DagsHub(What is DagsHub?)
Gotit.pub(What is GotitPub?)
Hugging Face(What is Huggingface?)
Papers with Code(What is Papers with Code?)
ScienceCast(What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower(What are Influence Flowers?)
CORE Recommender(What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community?Learn more about arXivLabs.