We use control of chaos to encode information into the oscillations of the Belousov-Zhabotinsky reaction. An arbitrary binary message is encoded by forcing the chaotic oscillations to follow a specified trajectory. The information manipulating control requires only small perturbations to vary the binary message. In this paper we extend our recent theoretical work [Bollt and Dolnik, Phys. Rev. E...

A Latin square of order n n is an alttext="n times n"> × encoding="application/x-tex">n \ti...

FiberDistributed DataInterface (FDDI) is a100megabits per second ber optic local area network (LAN) standardbeing developed by the AmericanNational Standard Institute (ANSI). We analyze the impact of various designdecisions onthe error detectioncapabilityof the protocol. Inparticular, we quantifyframe error rate, tokenloss rate, andundetectederror rate. Several characteristics of the 32-bit fra...

We present simple coding strategies, which are variants of the Schalkwijk-Kailath scheme, for communicating reliably over additive white noise channels in the presence of corrupted feedback. More specifically, we consider a framework comprising an additive white forward channel and a backward link which is used for feedback. We consider two types of corruption mechanisms in the backward link. T...

In coding theory it is widely known that the optimal encoding for a given alphabet of symbol codes is the Shannon entropy times the number of symbols to be encoded. However, depending on the structure of the message to be encoded it is possible to beat this optimal by including only frequently occurring aggregates of symbols from the base alphabet. We prove that the change in compressed message...

We propose enhanced spatial multiplexing codes (E-SMCs) to enable various encoding rates. The symbol error rate (SER) performance of the E-SMC is investigated when zero-forcing (ZF) and maximal-ratio combining (MRC) techniques are used at a receiver. The proposed E-SMC allows a transmitted symbol to be repeated over time to achieve further diversity gain at the cost of the encoding rate. With t...

The Adaptive Wavelet Image Compression (AWIC) algorithm is a fast, simple waveletbased image compression technique that follows the classical paradigm of image transformation, quantization, and entropy encoding. A key component of AWIC is a technique of channel symbol definition that provides greatly reduced Huffman table encoding costs, allowing optimal Huffman codewords to be generated and us...

Off-centered, two-sided geometric distributions of the integers are often encountered in lossless image compression applications, as probabilistic models for prediction residuals. Based on a recent characterization of the family of optimal prefix codes for these distributions, which is an extension of the Golomb codes, we investigate adaptive strategies for their symbol-by-symbol prefix coding,...

We show that a symmetric threshold crossing detector can be described by a symbolic dynamics of a static three-symbol encoding which is highly efficient to detect subthreshold events in noisy nonstationary data. After computing instantaneous word statistics and running cylinder entropies, we introduce a mean-field transformation of the three-symbol dynamics considered as a Potts-spin lattice on...