Abstract
A technique was recently reported to construct high-rate variable-length constrained sequence codes. In this study, the authors outline an algorithm that simplifies the search procedure that is integral to that technique. This algorithm enables examination of a large search space limited only by length and/or number of codewords in order to determine codeword and sourceword lengths that result in high-rate codes. They also describe a straightforward approach to construct codewords and sourcewords of the required lengths in order to complete the design of instantaneously-decodeable capacity-approaching codes that satisfy the specified sequence constraints. They provide results that demonstrate the usefulness of this approach.
Sign-in/Register to access full text options 
Free) 
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
