On codes having no finite completion
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1414301
- On codes having no finite completion
- On codes having no finite completions
- A note on codes having no finite completions
- scientific article; zbMATH DE number 4092795
- FINITE COMPLETIONS VIA FACTORIZING CODES
- On infinitary finite length codes
- On the Nonexistence of Perfect Codes over Finite Fields
- On a class of infinitary codes
- On the nonexistence of completely transitive codes
Cites work
- Completing codes
- Construction of a family of finite maximal codes
- Each regular code is included in a maximal regular code
- scientific article; zbMATH DE number 3926268 (Why is no real title available?)
- scientific article; zbMATH DE number 3943051 (Why is no real title available?)
- scientific article; zbMATH DE number 3654376 (Why is no real title available?)
- scientific article; zbMATH DE number 3247161 (Why is no real title available?)
- scientific article; zbMATH DE number 3024723 (Why is no real title available?)
- On codes having no finite completions
- On completion of codes with finite deciphering delay
Cited in
(9)- A note on codes having no finite completions
- scientific article; zbMATH DE number 5117090 (Why is no real title available?)
- scientific article; zbMATH DE number 4092795 (Why is no real title available?)
- Une famille remarquable de codes indecomposables
- A completion algorithm for codes with bounded synchronization delay
- On codes having no finite completion
- scientific article; zbMATH DE number 1414301 (Why is no real title available?)
- On codes with a finite deciphering delay: Constructing uncompletable words
- Three-word codes \(\{a, aba, u\}\) and \(\{a, ab, v\}\) having finite completions
This page was built for publication: On codes having no finite completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4341033)
