Year: 2023
Type: article
Abstract: A class of binary sequences, constrained with respect to the length of zero runs, is considered. For such sequences, termed (d, k)-sequences, new combinatorial and computational results are established. Explicit expressions for enumerating (d, k)-sequences of finite length are obtained. Efficient computational procedures for calculating the capacity of a (d, k)-code are given. A simple method for constructing a near-optimal (d, k)-code is proposed. Illustrative numerical examples demonstrate further the theoretical results.
Author: Zaharias M. Psillakis
Institution: University of Patras
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W4385841869