✦ LIBER ✦

Completing codes in a sofic shift

✍ Scribed by Marie-Pierre Béal; Dominique Perrin

Book ID: 108281567
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 605 KB
Volume: 410
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.07.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Completing prefix codes in submonoids

✍ Jean Néraud 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 200 KB

A restricted shift completeness problem

✍ Anton Baranov; Yurii Belov; Alexander Borichev 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 121 KB

On perfectt-shift codes in abelian group

On perfectt-shift codes in abelian groups

✍ Akihiro Munemasa 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 332 KB

A note on completely regular codes

✍ A.E. Brouwer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 169 KB

We show that puncturing a completely regular even binary code produces a completely regular code again, thus answering a question posed in Brouwer et al. [3], p. 357.

A shift register construction of uncondi

A shift register construction of unconditionally secure authentication codes

✍ Thomas Johansson 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 584 KB

THE CODE SHIFT IN OLD NORSE

✍ Bengt Sigurd 📂 Article 📅 1961 🏛 John Wiley and Sons 🌐 English ⚖ 609 KB