scientific article; zbMATH DE number 7731171
From MaRDI portal
Publication:6134947
zbMath1522.94025MaRDI QIDQ6134947
François Pirot, Jean-Sébastien Sereni, Lutz H. Strüngmann, Elena Fimmel, Christian J. Michel
Publication date: 23 August 2023
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/86/ajc_v86_p233.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Theory of error-correcting codes and error-detecting codes (94B99) Prefix, length-variable, comma-free codes (94A45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximal dinucleotide comma-free codes
- The maximum independent sets of de Bruijn graphs of diameter 3
- Strong trinucleotide circular codes
- Diletter circular codes over finite alphabets
- A 2006 review of circular codes in genes
- Varieties of comma-free codes
- Mixed circular codes
- Avoiding cross-bifix-free binary words
- Strong comma-free codes in genetic information
- On the hierarchy of trinucleotide \(n\)-circular codes and their corresponding amino acids
- A simple suboptimal construction of cross-bifix-free codes
- n -Nucleotide circular codes in graph theory
- Non-Overlapping Codes
- Comma-Free Codes
- A New Result on Comma-Free Codes of Even Word-Length
- Maximal Prefix-Synchronized Codes
- Combinatorial problems motivated by comma‐free codes
- Finite Completion of comma-free codes Part 1
- Finite Completion of comma-free codes Part 2
- A New Approach to Cross-Bifix-Free Sets
- Cross-Bifix-Free Codes Within a Constant Factor of Optimality
- On the construction of comma-free codes
- Maximal and variable word-length comma-free codes
This page was built for publication:
