Open AccessSimplified search and construction of capacity‐approaching variable‐length constrained sequence codes
Author(s) -
Steadman Andrew,
Fair Ivan
Publication year - 2016
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2016.0077
Subject(s) - sequence (biology) , construct (python library) , algorithm , code word , computer science , variable (mathematics) , mathematics , code (set theory) , order (exchange) , theoretical computer science , decoding methods , set (abstract data type) , mathematical analysis , genetics , biology , programming language , finance , economics
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.