A coding problem in steganography
From MaRDI portal
Publication:1008965
Recommendations
Cites work
Cited in
(16)- \(\mathbb {Z}_2\mathbb {Z}_4\)-additive perfect codes in steganography
- An enumeration of 1-perfect ternary codes
- Fast BCH Syndrome Coding for Steganography
- Coverings, centered codes, and combinatorial steganography
- Linear codes for high payload steganography
- The properties and constructions of linear steganographic codes
- Hamming codes for wet paper steganography
- Leveraging linear network error correction for steganographic network codes
- Steganography from a coding theory point of view
- Steganography and error-correcting codes
- Steganography using overlapping codebook partition
- Correspondence between steganographic protocols and error correcting codes
- Steganography from perfect codes on Cayley graphs over Gaussian integers, Eisenstein-Jacobi integers and Lipschitz integers
- Steganographic schemes from perfect codes on Cayley graphs
- A further study of large payloads matrix embedding
- 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)