Abstract
Following V.V. Ginzburg (1984), a hierarchy of codes is proposed to match the geometric partitioning of a signal set. The authors show that coset codes (including Ungerboeck, lattice, and binary codes) and indeed any codes which rely on partitioning of the signal set are all subclasses of the proposed coding scheme. The combination of such codes in a multilevel scheme often leads to reduced complexity in comparison with previously published schemes. A variety of decoder structures is discussed. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.