A Note on Codes Having no Finite Completions

We search for codes having no finite completions containing a n , for n≤4. We show that such codes cannot be found among n-bayonet codes, namely, every n-bayonet code, n≤4, is shown to be completed to a finite maximal code. We give examples of finitely incompletable codes containing a n , for n≤4, by a more detailed analysis of the factorization technique introduced in [6].