We show here how to construct a cellular automaton whose asymptotic set (the set of configurations it converges to) is maximally complex: it contains only configurations of maximal...
We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state o...
Abstract— For a multiple-input single-output (MISO) downlink channel with ¢ transmit antennas, it has been recently proved that zero-forcing beamforming (ZFBF) to a subset of (a...
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours an...
Given a cellular (mobile telephone) network, whose geographical coverage area is divided into hexagonal cells, phone calls are serviced by assigning frequencies to them so that no...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye,...