Work

Q-Ary (t1, t2)-Overlap-Free Codes

Year: 2025

Type: article

Abstract: A (t1, t2)-overlap-free code is a set of sequences such that for all integers i with t1 ≤ i ≤ t2, no prefix of length i of any sequence is the suffix of any sequence (not necessarily distinct) in the set. In this paper, we first present a generalized construction of (t1, t2)-overlap-free codes and analyze the size of the code via generating functions. We then investigate the non-expandable property of (1, t)-overlap-free codes. Finally, we give the size of the (1, t)-overlap-free codes under certain constraint conditions.

Source: IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences

DOI: 10.1587/transfun.2025eal2050

Authors: Hui YANG, Yang DING

Institution: Shanghai University

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funder: National Natural Science Foundation of China

Awards: G5430614846, G8135953901