A coding problem in steganography
From MaRDI portal
Publication:1008965
DOI10.1007/S10623-007-9135-9zbMATH Open1182.94057OpenAlexW2031350503MaRDI QIDQ1008965FDOQ1008965
Authors: Shiqu Li, Wei Ming Zhang
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-007-9135-9
Recommendations
Cites Work
Cited In (15)
- Steganography from perfect codes on Cayley graphs over Gaussian integers, Eisenstein-Jacobi integers and Lipschitz integers
- Steganographic schemes from perfect codes on Cayley graphs
- Steganography and error-correcting codes
- Steganography using overlapping codebook partition
- A further study of large payloads matrix embedding
- Leveraging linear network error correction for steganographic network codes
- The properties and constructions of linear steganographic codes
- Steganography from a coding theory point of view
- Fast BCH Syndrome Coding for Steganography
- Linear codes for high payload steganography
- An enumeration of 1-perfect ternary codes
- Coverings, centered codes, and combinatorial steganography
- \(\mathbb {Z}_2\mathbb {Z}_4\)-additive perfect codes in steganography
- Hamming codes for wet paper steganography
- Code based cryptography and steganography
This page was built for publication: A coding problem in steganography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008965)