In an influential paper entitled “How much memory is needed to win infinite games”, Dziembowski, Jurdziński, and Walukiewicz have shown that there are Muller games of size O(n) whose winning strategies require memory of size at least n!. This shows that the LAR-memory, based on the latest appearance records introduced by Gurevich and Harrington, is optimal for solving Muller games. We review th...

In this paper, we present a new soft-decision decoding algorithm for Reed-Muller codes. It is based on the GMC decoding algorithm proposed by Schnabl and Bossert [1] which interprets Reed-Muller codes as generalized multiple concatenated codes. We extend the GMC algorithm to list-decoding (L-GMC). As a result, a SDML decoding algorithm for the first order Reed-Muller codes is obtained. Moreover...

We give a brief but complete account of all the essential facts concerning the Reed-Muller and punctured Reed-Muller codes. The treatment is new and includes an easy, direct proof of the fact that the punctured Reed-Muller codes are the codes of the projective geometries over the binary eld. We also establish the existence of two short exact sequences that lead to new proofs that the minimum-we...

PURPOSE To elucidate the role of retinal Muller cells in N-methyl-D-aspartate (NMDA)- or kainic acid (KA)induced retinal damage. METHODS In experimental eyes, NMDA or KA was injected into the vitreous of rat eyes. Immunohistochemistry and western blot analysis were conducted to elucidate expression and localization of glial fibrillary acidic protein (GFAP) and ciliary neurotrophic factor (CNT...

One prerequisite for unimpaired islet graft function is the separation from the presumably cytotoxic and highly immunogenic exocrine tissue (Ulricks and MuUer-Ruchholtz: cf. page 123 in this book; Gray 1989). Three different principles of islet purification are used: (A) "Hand-picking" is a method eSUlblished for purification of islets from the rodent pancreas (Finke, Lacy and Ono 1979). But fo...

First, a new proof of Berman and Charpin’s characterization of the Reed-Muller codes over the binary field or over an arbitrary prime field is presented. These codes are considered as the powers of the radical of a modular algebra. Secondly, the same method is used for the study of the Generalized Reed-Muller codes over a non prime field.