On codes having no finite completion

DOI10.1051/ita/1996300604831zbMath0877.68012OpenAlexW4233939752MaRDI QIDQ4341033

Nguyen Huong Lam

Publication date: 8 December 1997

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92547

zbMATH Keywords

maximal code

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (1)

A completion algorithm for codes with bounded synchronization delay

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On completion of codes with finite deciphering delay
• Construction of a family of finite maximal codes
• On codes having no finite completions
• Each regular code is included in a maximal regular code
• Completing codes

This page was built for publication: On codes having no finite completion