A projection of binary Reed–Muller codes ( ) onto GF (4) is presented. For an ( ) code, this operation yields a linear quaternary code with the same length, dimension, and minimum distance as the Reed–Muller ( 1 2) code. Based upon this projection, multilevel construction is given for ( ), where the constituent codes applied to the different levels are themselves the Reed–Muller codes ( 2 2) an...

This work considers a finite-duration variant of Muller games, and their connection to infinite-duration Muller games. In particular, it studies the question of how long a finiteduration Muller game must be played before the winner of the finite-duration game is guaranteed to be able to win the corresponding infinite-duration game. Previous work by McNaughton has shown that this must occur afte...

A method has been developed for the preparation of large numbers of glial (Muller) cells from the turtle retina. After proteolytic dissociation of the retina, Muller cells were separated from retinal neurons by velocity sedimentation at unit gravity. Fractions containing >90 percent morphologically identifiable Muller cells were prepared by this procedure. Fractions containing only Muller cells...

L. J. RATHER, PATRICIA RATHER and JOHN B. FRERICHS, Johannes Miller and the nineteenth-century origins oftumour cell theory, Canton MA, Science History Publications, 1986, 8vo, pp. ix, 193, illus., $15.00. No single scholar has done more to make classic texts ofGerman pathologists accessible to an English-language readership than L. J. Rather. Following the substantial volumes of Rudolf Virchow...

We introduce weighted automata over in…nite words with Muller acceptance condition and we show that their behaviors coincide with the semantics of weighted restricted MSO-sentences. Furthermore, we establish an equivalence property of weighted Muller and weighted Büchi automata over certain semirings. Keywords: Weighted logics, Weighted Muller automata, In…nitary formal power series, Weighted B...

Gopalan, Klivans, and Zuckerman proposed a listdecoding algorithm for Reed-Muller codes. Their algorithm works up to a given list-decoding radius. Dumer, Kabatiansky, and Tavernier improved the complexity of the algorithm for binary Reed-Muller codes by using the well-known Plotkin construction. In this study, we propose a list-decoding algorithm for non-binary Reed-Muller codes as a generaliza...