The following pages link to A coding problem in steganography (Q1008965):
Displaying 11 items.
- \(\mathbb {Z}_2\mathbb {Z}_4\)-additive perfect codes in steganography (Q644319) (← links)
- Steganography and error-correcting codes (Q970863) (← links)
- Steganography using overlapping codebook partition (Q971371) (← links)
- Linear codes for high payload steganography (Q1028424) (← links)
- Coverings, centered codes, and combinatorial steganography (Q1049396) (← links)
- A further study of large payloads matrix embedding (Q1750059) (← links)
- Steganography from perfect codes on Cayley graphs over Gaussian integers, Eisenstein-Jacobi integers and Lipschitz integers (Q2099160) (← links)
- Steganographic schemes from perfect codes on Cayley graphs (Q2324771) (← links)
- Hamming codes for wet paper steganography (Q2350929) (← links)
- An enumeration of 1-perfect ternary codes (Q6041863) (← links)
- Leveraging linear network error correction for steganographic network codes (Q6593724) (← links)