✦ LIBER ✦

A note on binary grammatical codes of trees

✍ Scribed by Andrzej Ehrenfeucht; Paulien ten Pas; Grzegorz Rozenberg

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 916 KB
Volume: 155
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00093-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on binary cyclic codes of blockle

A note on binary cyclic codes of blocklength 63

✍ Richard E. Blahut 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 508 KB

A method of investigating the minimum distance of binary cyclic codes of composite blocklength is described; only the case of blocklength 63 is discussed in any detail. Moreover, the usefulness of the method is left as an unanswered question. 'Your proof of Theorem 5.9.2 is the same as the one in M

A note on optimal area algorithms for up

A note on optimal area algorithms for upward drawings of binary trees

✍ P. Crescenzi; G. Di Battista; A. Piperno 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 793 KB

A Note on Greedy Codes

✍ D. Fon-Der-Flaass 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 214 KB

In their paper (J. Combin. Theory Ser. A 64 (1993), 10 30) Brualdi and Pless prove linearity of some binary codes obtained by a greedy algorithm and establish lower bounds for the dimension of these codes. In this note, we show that actually they have proved a much more general result, and show that

A note on a problem in the theory of gra

A note on a problem in the theory of grammatical complexity

✍ W. Bucher 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 865 KB

A note on the computation of the bit err

A note on the computation of the bit error rate for binary block codes

✍ Michele Elia 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 562 KB

On a personal note governance codes

✍ John Carver; Miriam Carver 📂 Article 📅 2005 🏛 John Wiley and Sons ⚖ 249 KB 👁 2 views