Cross-bifix-free sets generation via Motzkin paths
RAIRO-Theor. Inf. Appl., 50 1 (2016) 81-91
Published online: 2016-06-02
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
On maximal almost balanced non-overlapping codes and non-overlapping codes with restricted run-lengths
Lidija Stanovnik, Miha Moškon and Miha MrazComputational and Applied Mathematics 44 (3) (2025)
https://doi.org/10.1007/s40314-024-03055-0
In search of maximum non-overlapping codes
Lidija Stanovnik, Miha Moškon and Miha MrazDesigns, Codes and Cryptography 92 (5) 1299 (2024)
https://doi.org/10.1007/s10623-023-01344-z
Constructions of Non-Expandable Cross-Bifix-Free Codes via Expandable Codes
Chunyan Qin, Bocong Chen and Gaojun LuoIEEE Transactions on Information Theory 70 (7) 4946 (2024)
https://doi.org/10.1109/TIT.2024.3354675
Q-Ary Non-Overlapping Codes: A Generating Function Approach
Geyang Wang and Qi WangIEEE Transactions on Information Theory 68 (8) 5154 (2022)
https://doi.org/10.1109/TIT.2022.3167845
Mutually Uncorrelated Codes for DNA Storage
Maya Levy and Eitan YaakobiIEEE Transactions on Information Theory 65 (6) 3671 (2019)
https://doi.org/10.1109/TIT.2018.2873138
A 2D non-overlapping code over a q-ary alphabet
Elena Barcucci, Antonio Bernini, Stefano Bilotta and Renzo PinzaniCryptography and Communications 10 (4) 667 (2018)
https://doi.org/10.1007/s12095-017-0251-8
3115 (2017)
https://doi.org/10.1109/ISIT.2017.8007103
Variable-Length Non-Overlapping Codes
Stefano BilottaIEEE Transactions on Information Theory 63 (10) 6530 (2017)
https://doi.org/10.1109/TIT.2017.2742506