Coverings, centered codes, and combinatorial steganography

DOI10.1134/S0032946009030107zbMATH Open1234.94074OpenAlexW2133774368MaRDI QIDQ1049396FDOQ1049396

Authors: F. Galand, Grigory Kabatiansky 

Publication date: 12 January 2010

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

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

Recommendations

• Steganography and error-correcting codes
• Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
• The properties and constructions of linear steganographic codes
• Linear codes for high payload steganography
• A coding problem in steganography

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62) Other types of codes (94B60)

Cites Work

• Title not available (Why is that?)
• On the Capacity Game of Private Fingerprinting Systems Under Collusion Attacks
• Asymptotically optimal perfect steganographic systems
• Coverings, centered codes, and combinatorial steganography
• Centered error-correcting codes

Cited In (17)

• Steganography from perfect codes on Cayley graphs over Gaussian integers, Eisenstein-Jacobi integers and Lipschitz integers
• Steganography and error-correcting codes
• Steganography using overlapping codebook partition
• The properties and constructions of linear steganographic codes
• Correspondence between steganographic protocols and error correcting codes
• A coding problem in steganography
• Error-tolerant ZZW-construction
• Steganography from a coding theory point of view
• Linear codes for high payload steganography
• Partial covering arrays for data hiding and quantization
• Ensuring Message Embedding in Wet Paper Steganography
• Coverings, centered codes, and combinatorial steganography
• \(\mathbb {Z}_2\mathbb {Z}_4\)-additive perfect codes in steganography
• Steganographic capacity for one-dimensional Markov cover
• Hamming codes for wet paper steganography
• Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\)
• Code based cryptography and steganography

This page was built for publication: Coverings, centered codes, and combinatorial steganography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1049396)