Asymptotically optimal perfect steganographic systems

DOI10.1134/S0032946009020094zbMath1173.94426OpenAlexW2154651642MaRDI QIDQ734309

D. B. Ryabko, Boris Ya. Ryabko

Publication date: 20 October 2009

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946009020094

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

Constructing perfect steganographic systems ⋮ Coverings, centered codes, and combinatorial steganography

Cites Work

• Unnamed Item
• Fast enumeration of combinatorial objects
• The method of types [information theory]
• The Efficient Construction of an Unbiased Random Sequence