Steganography from perfect codes on Cayley graphs over Gaussian integers, Eisenstein-Jacobi integers and Lipschitz integers

DOI10.1007/s10623-022-01063-xOpenAlexW4282826247WikidataQ114226822 ScholiaQ114226822MaRDI QIDQ2099160

Jon-Lark Kim, Junyong Park

Publication date: 23 November 2022

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-022-01063-x

zbMATH Keywords

Cayley graphperfect codesteganographyGaussian integerEisenstein-Jacobi integerLipschitz integer

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• Unnamed Item
• A coding problem in steganography
• Cyclotomic graphs and perfect codes
• Steganographic schemes from perfect codes on Cayley graphs
• Grid Colorings in Steganography
• Perfect Codes for Metrics Induced by Circulant Graphs
• Perfect Codes From Cayley Graphs Over Lipschitz Integers

This page was built for publication: Steganography from perfect codes on Cayley graphs over Gaussian integers, Eisenstein-Jacobi integers and Lipschitz integers