Information hiding using matroid theory
From MaRDI portal
Publication:2040985
DOI10.1016/j.aam.2021.102205OpenAlexW3156913782MaRDI QIDQ2040985
Publication date: 15 July 2021
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.02991
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Locally decodable codes and private information retrieval schemes.
- Dependencies among dependencies in matroids
- General constructions for information-theoretic private information retrieval
- Higher support matroids
- How to share a secret
- Private information retrieval
- The coset leader and list weight enumerator
- On the efficiency of local decoding procedures for error-correcting codes
- Generalized Hamming weights for linear codes
- Quantization index modulation: a class of provably good methods for digital watermarking and information embedding
- Theory of Cryptography
- A Survey of Single-Database Private Information Retrieval: Techniques and Applications
This page was built for publication: Information hiding using matroid theory