The properties and constructions of linear steganographic codes
From MaRDI portal
Recommendations
Cited in
(11)- A coding problem in steganography
- Linear codes for high payload steganography
- Coverings, centered codes, and combinatorial steganography
- Wet paper codes and the dual distance in steganography
- Steganography from perfect codes on Cayley graphs over Gaussian integers, Eisenstein-Jacobi integers and Lipschitz integers
- Steganographic schemes from perfect codes on Cayley graphs
- Code based cryptography and steganography
- Steganography from a coding theory point of view
- Correspondence between steganographic protocols and error correcting codes
- \(\mathbb {Z}_2\mathbb {Z}_4\)-additive perfect codes in steganography
- Steganography and error-correcting codes
This page was built for publication: The properties and constructions of linear steganographic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5432897)