<i>Q</i>-Ary Non-Overlapping Codes: A Generating Function Approach-Reference-Cited by-同舟云学术

Q-Ary Non-Overlapping Codes: A Generating Function Approach

Published:2022-08 Issue:8 Volume:68 Page:5154-5164
ISSN:0018-9448
Container-title:IEEE Transactions on Information Theory
language:
Short-container-title:IEEE Trans. Inform. Theory

Author:

Wang Geyang¹^ORCID,Wang Qi²^ORCID

Affiliation:

1. Department of Computer Science and Engineering, Southern University of Science and Technology, Research Institute of Trustworthy Autonomous Systems, Shenzhen, China

2. Department of Computer Science and Engineering, National Center for Applied Mathematics Shenzhen, Southern University of Science and Technology, Shenzhen, China

Funder

National Key Research and Development Program of China

Shenzhen Fundamental Research Programs

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Library and Information Sciences,Computer Science Applications,Information Systems

Link

http://xplorestaging.ieee.org/ielx7/18/9829223/09758795.pdf?arnumber=9758795

Reference25 articles.

1. Non-Overlapping Codes

2. Cross-bifix-free sets generation via Motzkin paths

3. Mutually Uncorrelated Codes for DNA Storage

4. A rewritable, random-access DNA-based storage system;yazdi;Sci Rep,2015

5. Algorithms on Strings

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. q-ary (1,k)-overlap-free codes with given restrictions;Discrete Mathematics;2025-01

2. Constructions of Non-Expandable Cross-Bifix-Free Codes via Expandable Codes;IEEE Transactions on Information Theory;2024-07

3. On the maximum size of variable-length non-overlapping codes;Designs, Codes and Cryptography;2024-06-25

4. In search of maximum non-overlapping codes;Designs, Codes and Cryptography;2024-01-08

5. Constructions and bounds for q-ary (1, k)-overlap-free codes;IEEE Transactions on Information Theory;2023