Codes Over Gaussian Integers

@article{Huber1993CodesOG,
  title={Codes Over Gaussian Integers},
  author={K. Huber},
  journal={Proceedings. IEEE International Symposium on Information Theory},
  year={1993},
  pages={359-359}
}
  • K. Huber
  • Published 1993
  • Proceedings. IEEE International Symposium on Information Theory
Gaussian integers are those complex numbers which have integers as real and imaginary parts (for Gaussian integers see e.g. [2], pp.182-187). Primes of the form p s 1 mod 4 can be written in exactly one way as s,um of two squares. Hence such primes p are the product of tw3 conjugate complex Gaussian integers: p = a2+b2 = x.x* where s = a+i.b and * denotes complex conjugation x' = a i . b. Let [.] denote rounding to the closest integer and define rounding of a complex number by [ z t iy] = [z… Expand
Codes Over Rings of Algebraic Integers
New Coding Techniques for Codes over Gaussian Integers
New Four-Dimensional Signal Constellations From Lipschitz Integers for Transmission Over the Gaussian Channel
Hexagonal metric for linear codes over a finite field
  • Ying Gao
  • Mathematics, Computer Science
  • J. Syst. Sci. Complex.
  • 2011
Groups of complex integers used as QAM signals
  • J. Rifà
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 1995
A novice cryptosystem based on nth root of Gaussian integers
Paraunitary-Based Boolean Generator for QAM Complementary Sequences of Length $2^{K}$
...
1
2
3
4
5
...