q-ary (1, k)-overlap-free codes with given restrictions
From MaRDI portal
(Redirected from Publication:6635103)
\(q\)-ary \((1, k)\)-overlap-free codes with given restrictions
\(q\)-ary \((1, k)\)-overlap-free codes with given restrictions
Recommendations
Cites work
- Q-Ary Non-Overlapping Codes: A Generating Function Approach
- A Gray code for a regular language
- A New Approach to Cross-Bifix-Free Sets
- A simple suboptimal construction of cross-bifix-free codes
- A strong non-overlapping Dyck code
- A trace partitioned Gray code forq-ary generalized Fibonacci strings
- Constructions and bounds for \(q\)-ary \((1,k)\)-overlap-free codes
- Constructions and bounds for codes with restricted overlaps
- Constructions of binary constant-weight cyclic codes and cyclically permutable codes
- Cross-Bifix-Free Codes Within a Constant Factor of Optimality
- DC-free coset codes
- Efficient and Explicit Balanced Primer Codes
- Efficient balanced codes
- scientific article; zbMATH DE number 3133919 (Why is no real title available?)
- scientific article; zbMATH DE number 3423953 (Why is no real title available?)
- In search of maximum non-overlapping codes
- Mutually uncorrelated codes for DNA storage
- Mutually Uncorrelated Primers for DNA-Based Data Storage
- New Classes of Balanced Quaternary and Almost Balanced Binary Sequences With Optimal Autocorrelation Value
- Non-Overlapping Codes
- On error-correcting balanced codes
- Self-complementary balanced codes and quasi-symmetric designs
- Variable-Length Non-Overlapping Codes
This page was built for publication: \(q\)-ary \((1, k)\)-overlap-free codes with given restrictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635103)
