IEEE Transactions on Information Theory · 2001 · 30 citations · 8 references
EngineeringElectrical EngineeringMathematicsAlgorithmsDigital CommunicationInformation TheoryChannel CodingCoding TheoryError Control CodingError-correcting CodesModulationAmplitude ModulationCodes Over Finite RingsHamming CodesHamming DistanceLinear CodesModulation SchemesQuadratic FieldsQuadrature Amplitude Modulation
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.
8
An introduction to the theory of numbers
Journal of the Franklin Institute · 1960 · 3.7K citations
Generalized minimum distance decoding
G. David Forney · IEEE Transactions on Information Theory · 1966 · 568 citations
E. F. Assmus, H. F. Mattson · Journal of Combinatorial Theory · 1969 · 329 citations
Kurt Huber · IEEE Transactions on Information Theory · 1994 · 197 citations