Perfect Codes From Cayley Graphs Over Lipschitz Integers - IEEE Xplore
ieeexplore.ieee.org › document
Jul 14, 2009 · Our constellations are modeled by means of Cayley graphs defined over quotient rings of Lipschitz integers. Previously unexplored perfect codes ...
The tools employed in this study are Cayley graphs of degree eight defined over the integer ring of the quaternions, or the Lipschitz integers. Gaussian and ...
This work focuses on a new class of four-dimensional signal spaces which include tori as subcases and models their signal sets through Cayley-Dickson ...
Oct 22, 2024 · Our constellations are modeled by means of Cayley graphs defined over quotient rings of Lipschitz integers. Previously unexplored perfect codes ...
This paper studies perfect codes and total perfect codes in Cayley graphs, with a focus on the following themes: when a subgroup of a given group is a ...
Jun 14, 2022 · In this paper, we construct steganographic schemes explicitly from r-perfect codes on Cayley graphs over Gaussian integers, Eisenstein–Jacobi integers, and ...
Cayley graphs over quotients of the quaternion integers are going to be used to define a new metric over four dimensional lattices. We will consider perfect ...
Steganography from perfect codes on Cayley graphs over Gaussian ...
link.springer.com › content › pdf
Jun 14, 2022 · In this paper, we construct steganographic schemes explicitly from r-perfect codes on Cayley graphs over Gaussian integers, Eisenstein–Jacobi ...
Jul 18, 2011 · Our constellations are modeled by means of Cayley graphs defined over quotient rings of Lipschitz integers. Previously unexplored perfect codes ...
Given a graph Γ , a subset C of V ( Γ ) is called a perfect code in Γ if every vertex of Γ is at distance no more than one to exactly one vertex in C ...