Abstract
Motivated by code design for real-time simultaneous information and energy transfer, we characterize achievable rates and error exponents for discrete memoryless channels using constant subblock composition codes (CSCCs). All subblocks within every codeword in a CSCC have the same fixed composition. For a given channel, this composition may be chosen to balance the tradeoff of receiving high information rate and sufficient energy with every subblock duration. We provide a lower bound on the achievable rate by deriving a loss term relative to unconstrained random codes. We show that the error exponent for CSCCs is related to the error exponent for constant composition codes through the same loss term. We also compare achievable rates using CSCC with joint subblock decoding to the case where received subblocks are decoded independently for relatively faster information access.
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.
