Three-Word Codes {a,aba,u} Having a Finite Completion
One-word codes and two-word codes are prefix-suffix-composed codes, then they have a finite completion. There exist n-word codes that have no finite completion when [Formula: see text]. Does every three-word code have a finite completion? Up to now, this famous question in Theory of Codes remains open. In this paper, we construct a series of three-word codes with the form [Formula: see text] that have a finite completion and part of them are prefix-suffix-indecomposable three-word codes.
Authors
- Yingheng Li (ORCID: https://orcid.org/0009-0002-5552-6176)
- Chunhua Cao
- Z. Yan (ORCID: https://orcid.org/0009-0006-0254-576X)
- Yali Yang
- Hao Xie
Institutions
- Kunming University of Science and Technology (CN)
- Yunnan University (CN)
Publication Details
- Journal
- International Journal of Foundations of Computer Science
- Published
- 2025-03-13
- DOI
- https://doi.org/10.1142/s0129054125500091
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China