Abstract
For each natural number n≥5 we propose a class of finitely incompletable codes that contain an on a binary alphabet {a,b}. The construction is essentially based on unambiguous pairs unembeddable to a factorization of Zn.
Cite
CITATION STYLE
APA
Lam, N. H. (1994). On codes having no finite completion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 775 LNCS, pp. 691–698). Springer Verlag. https://doi.org/10.1007/3-540-57785-8_182
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free