On codes having no finite completion
From MaRDI portal
Publication:4763927
DOI10.1051/ITA/1995290201451zbMath0819.94019OpenAlexW1536222145MaRDI QIDQ4763927
Publication date: 22 May 1995
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92500
Related Items (2)
An application of Hajós factorizations to variable-length codes ⋮ Finite maximal codes and triangle conjecture
Cites Work
This page was built for publication: On codes having no finite completion