Abstract
For multilevel block codes with mutually independent binary component codes, Sayegh (1986) has shown optimum binary codes which maximize the minimum Euclidean distance. Our proposed multilevel codes, however, are constructed from mutually interdependent binary component codes. To investigate how interdependency should be composed for good minimum distance, the algebraic structures of the codes are discussed. Cyclic codes over Z/sub M/ for M-PSK presented by Piret (1995) can be constructed by the multilevel coding method. Comparing with these codes, furthermore, we can obtain better minimum distances. Such multilevel codes have the algebraic structure of a cyclic (additive) group over GF(M). The authors show the constellations of QPSK and 8-PSK with three mappings.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
