In search of maximum non-overlapping codes

DOI10.1007/S10623-023-01344-ZMaRDI QIDQ6499102zbMATH OpenFDO

Authors Miha Moskon, Miha Mraz

Publication date 8 May 2024

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Mathematics Subject Classification ID

Integer programming (90C10) Synchronization error-correcting codes (94B50)

Recommendations

• \(q\)-ary \((1, k)\)-overlap-free codes with given restrictions
• A 2D non-overlapping code over a q-ary alphabet
• scientific article; zbMATH DE number 7731171
• Overlapping words, codes, disjunctivity and density of languages

Cites work

• scientific article; zbMATH DE number 3480478 (Why is no real title available?)
• scientific article; zbMATH DE number 3423953 (Why is no real title available?)
• scientific article; zbMATH DE number 7731171 (Why is no real title available?)
• Q-Ary Non-Overlapping Codes: A Generating Function Approach
• A New Approach to Cross-Bifix-Free Sets
• A simple suboptimal construction of cross-bifix-free codes
• Cross-Bifix-Free Codes Within a Constant Factor of Optimality
• Cross-bifix-free sets generation via Motzkin paths
• Mutually Uncorrelated Primers for DNA-Based Data Storage
• Mutually uncorrelated codes for DNA storage
• Non-Overlapping Codes
• Strong comma-free codes in genetic information

Cited in

(1)

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

This page was built for publication: In search of maximum non-overlapping codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499102)