A coding problem in steganography
From MaRDI portal
Publication:1008965
DOI10.1007/s10623-007-9135-9zbMath1182.94057OpenAlexW2031350503MaRDI QIDQ1008965
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
Related Items (3)
An enumeration of 1-perfect ternary codes ⋮ Steganographic schemes from perfect codes on Cayley graphs ⋮ Steganography from perfect codes on Cayley graphs over Gaussian integers, Eisenstein-Jacobi integers and Lipschitz integers
Cites Work
This page was built for publication: A coding problem in steganography