In this paper we present perfect codes for two-dimensional constellations derived from generalized Gaussian graphs, a family of graphs built over quotient ...
A Generalization of Perfect Lee Codes over Gaussian Integers - IEEE Xplore
ieeexplore.ieee.org › iel5
Abstract—In this paper we present perfect codes for two- dimensional constellations derived from generalized Gaussian graphs, a family of graphs built over ...
In this paper we present a generalization of the perfect codes derived from the quotient rings of Gaussian integers. We call this class of codes quasi-perfect, ...
Oct 22, 2024 · The author shows how block codes over Gaussian integers can be used for coding over two-dimensional signal space.
A generalization of perfect Lee codes over Gaussian integers. C Martínez, M Moretó, R Beivide, E Gabidulin. 2006 IEEE International Symposium on Information ...
This graph theory approach determined the existence and construction of perfect codes over the Gaussian integers. Perfect Gaussian codes include, as subcases, ...
In this contribution, we will define an l-dimensional Lee distance which is a generalization of the Lee distance defined only over a prime field, ...
One approach has been to generalize the Lee metric. Huber in [20] gave 1-perfect codes over Gaussian integers and some non-perfect codes with greater correction ...
Quasi-perfect geometrically uniform codes derived from graphs over Gaussian integer rings ... A Generalization of Perfect Lee Codes over Gaussian Integers. 2006 ...
Dec 23, 2022 · The packing radius r(C) of a Lee code C is the greatest integer r such that Sn,r(u)∩Sn,r(v) = ∅ holds for all u, v ∈ C. The covering radius R(C) ...