𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Completion of recognizable bifix codes

✍ Scribed by Zhang Liang; Shen Zhonghui

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
541 KB
Volume
145
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

HajΓ³s factorizations and completion of c
HajΓ³s factorizations and completion of codes
✍ Nguyen Huong Lam πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 804 KB

Given a Haj6s factorization of Z,, De Felice has shown that an + Jb + bag is finitely completable to a d-code, d <3. In this article, we prove that the code u" + aPbaQ is finitely completable but not always to a d-code with d < 3.

Completion of codes with finite bi-decod
Completion of codes with finite bi-decoding delays
✍ Liang Zhang; K.P. Shum; Shou-Li Peng πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 274 KB

Let A \* be a free monoid generated by a set A and let X βŠ† A \* be a code with property P. The embedding of X into a complete code Y βŠ† A \* with the same property P is called the completion of X . The method of completion of rational biΓΏx codes and codes with ΓΏnite decoding delays have been investig

Dual distances of completely regular cod
Dual distances of completely regular codes
✍ B. Courteau; A. Montpetit πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 467 KB

Courteau, B. and A. Montpetit, Dual distances of completely regular codes, Discrete Mathematics 89 (1991) 7-15. In this paper we prove two theorems giving arithmetical constraints on the possible values of dual distances of completely regular codes extending some recent results of Calderbank and Gce