Probabilistic Existence Results for Parent-Identifying Schemes
From MaRDI portal
Publication:5211437
DOI10.1109/TIT.2019.2927020zbMath1432.94135arXiv1906.01031OpenAlexW2955640348WikidataQ127524743 ScholiaQ127524743MaRDI QIDQ5211437
Minquan Cheng, Ying Miao, Yujie Gu, Grigory Kabatiansky
Publication date: 28 January 2020
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.01031
combinatorial structures for parent-identifying schemesequivalent relationship between the parent-identifying schemes and forbidden configurations
Related Items (7)
Multimedia IPP codes with efficient tracing ⋮ On non-binary traceability set systems ⋮ Sparse Hypergraphs with Applications to Coding Theory ⋮ Improved upper bounds for parent-identifying set systems and separable codes ⋮ On 2-parent-identifying set systems of block size 4 ⋮ Union-intersection-bounded families and their applications ⋮ A study of the separating property in Reed-Solomon codes by bounding the minimum distance
This page was built for publication: Probabilistic Existence Results for Parent-Identifying Schemes