Combining a note by Rissanen and an idea of enumerative coding we obtain a new implementation of the Ziv-Lempel incremental parsing algorithm for coding and decoding discrete data sequences. Index Terms -Ziv-Lempel algorithm, enumerative coding.

In this paper we investigate residue number system to binary converter algorithms for special moduli sets. A new five moduli set proposed is shown to exhibit high speed forward and reverse conversion properties. The architectures are memoryless and area efficient.

We analyze a network coloring game on hypergraphs which can also describe a voter model. Each node represents a voter and is colored according to its preferred candidate (or undecided). Each hyperedge is a subset of voters that can interact and influence one another. In each round of the game, one hyperedge is chosen randomly, and the voters in the hyperedge can change their colors according to...

W develop a model of a failure-prone, bufferless, paced, automatic transfer line in which material flows through a number of workstations in series, receiving continuous processing along each workstation. When a workstation fails, it stops operating, and so do all the other workstations upstream of it. The quality of the material trapped in the stopped workstations deteriorates with time. If th...

Ahstrrrrt -The Gilbert-Elliott channel is a varying binary symmetr ic channel with crossover probabilities determined by a binary-state Markov process. In general, such a channel has a memory that depends on the transition probabilities between the states. First, a method of calculating the capacity of this channel is introduced and applied to several examples: then the question of coding is ad...