Abstract
Codes over finite cyclic groups of order a power of 2 for the hermitian distance are used in PSK modulation. In this paper they are approximated by codes over the dyadic integers. The idea is to interpret the hermitian norm as an eigenvalue of the coset graph attached to the dual code. Since the infinite coset graph of a given dyadic code is a projective limit of the finite coset graphs of the finite projected codes, the spectra of the finite codes converge weakly towards the spectrum of the coset graph of the dyadic code. This entails that the probability of error of a code over a large cyclic ring is well approximated for large alphabet size by a measure attached to its dyadic limit.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
