Lattice constellations and codes from quadratic number fields

We propose new classes of linear codes over integer rings of quadratic extensions of Q, the field of rational numbers. The codes are considered with respect to a Mannheim metric, which is a Manhattan metric module a two-dimensional (2-D) grid, in particular, codes over Gaussian integers and Eisenstein-Jacobi integers are extensively studied. Decoding algorithms are proposed for these codes when up to two coordinates of a transmitted code vector are affected by errors of arbitrary Mannheim weight. Moreover, we show that the proposed codes are maximum-distance separable (MDS), with respect to the Hamming distance. The practical interest in such Mannheim-metric codes is their use in coded modulation schemes based on quadrature amplitude modulation (QAM)-type constellations, for which neither the Hamming nor the Lee metric is appropriate.

[1]  K. Huber,et al.  Codes Over Gaussian Integers , 1993, Proceedings. IEEE International Symposium on Information Theory.

[2]  Hans-Andrea Loeliger,et al.  Signal sets matched to groups , 1991, IEEE Trans. Inf. Theory.

[3]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[4]  H. Mattson,et al.  New 5-designs , 1969 .

[5]  G. David Forney,et al.  Generalized minimum distance decoding , 1966, IEEE Trans. Inf. Theory.

[6]  J. Armitage,et al.  Introduction to Number Theory , 1966, The Mathematical Gazette.

[7]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[8]  F. Dodd Number Theory in the Quadratic Field With Golden Section Unit , 1984 .

[9]  Pierre Samuel,et al.  Algebraic theory of numbers , 1971 .