Abstract
In this paper, we focus on near-optimal designs for variable-length error-correcting (VLEC) codes, while considering the performance in terms of both the average codeword length (ACL) and the symbol-error rate (SER). The criteria for narrowing the search space and enhancing the SER performance are investigated. An efficient code construction algorithm is then devised based on a random search process. Taking advantage of the significantly reduced search complexity, we are able to construct near-optimal VLEC codes for large source alphabets. Numerical results obtained for various free distance values and alphabet sizes show that constructed VLEC codes have both reduced ACL values and enhanced SER performances. Performance improvement is more notable for large source alphabets.
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.
