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

DOI10.1007/S10623-022-01063-XOpenAlexW4282826247WikidataQ114226822 ScholiaQ114226822MaRDI QIDQ2099160FDOQ2099160

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

• Title not available (Why is that?)
• Perfect Codes for Metrics Induced by Circulant Graphs
• Cyclotomic graphs and perfect codes
• Perfect Codes From Cayley Graphs Over Lipschitz Integers
• Grid Colorings in Steganography
• A coding problem in steganography
• Steganographic schemes from perfect codes on Cayley graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2099160)