Abstract

A graph-theoretic method for analyzing a scheme of combining modulation and error-correcting codes (ECC), in which certain bit positions in the modulation code are left unconstrained for insertion of ECC parity bits is presented in this paper. We establish several properties of the tradeoff function that relates the density of unconstrained positions to the maximum code rate, including concavity and continuity.

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

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.