\(q\)-ary \((1, k)\)-overlap-free codes with given restrictions

DOI10.1016/j.disc.2024.114236MaRDI QIDQ6635103

Xiao Miao Wang, Yu Fang, Unnamed Author

Publication date: 9 November 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

error-correcting codebalanced code\((1, k)\)-overlap-free codenon-overlapping code

Mathematics Subject Classification ID

Combinatorial codes (94B25) Prefix, length-variable, comma-free codes (94A45)

Cites Work

• Unnamed Item
• Unnamed Item
• A strong non-overlapping Dyck code
• Self-complementary balanced codes and quasi-symmetric designs
• A simple suboptimal construction of cross-bifix-free codes
• Non-Overlapping Codes
• Efficient balanced codes
• DC-free coset codes
• Constructions of binary constant-weight cyclic codes and cyclically permutable codes
• Variable-Length Non-Overlapping Codes
• Mutually Uncorrelated Primers for DNA-Based Data Storage
• On error-correcting balanced codes
• A trace partitioned Gray code forq-ary generalized Fibonacci strings
• Q-Ary Non-Overlapping Codes: A Generating Function Approach
• Efficient and Explicit Balanced Primer Codes
• Mutually Uncorrelated Codes for DNA Storage
• A New Approach to Cross-Bifix-Free Sets
• New Classes of Balanced Quaternary and Almost Balanced Binary Sequences With Optimal Autocorrelation Value
• Cross-Bifix-Free Codes Within a Constant Factor of Optimality
• In search of maximum non-overlapping codes
• Constructions and bounds for codes with restricted overlaps
• Constructions and bounds for \(q\)-ary \((1,k)\)-overlap-free codes
• A Gray code for a regular language

This page was built for publication: \(q\)-ary \((1, k)\)-overlap-free codes with given restrictions