Consider a target moving at a constant velocity on a unit-circumference circle, starting at an
arbitrary location. To acquire the target, any region of the circle can be probed to obtain a …

A communication problem in considered, where no mathematical model is specified for the
channel. The achievable rates are determined as a function of the channel input and output …

In analogy to the well-known notion of finite-state compressibility of individual sequences,
due to Lempel and Ziv, we define a similar notion of “finite-state encryptability” of an …

We refine and extend Ziv's model and results regarding perfectly secure encryption of
individual sequences. According to this model, the encrypter and the legitimate decrypter …

We consider the problem of universal decoding for arbitrary, finite-alphabet unknown
channels in the random coding regime. For a given random coding distribution and a given …

The idea of modeling an unknown channel using a broadcast channel was first introduced
by Cover 1 in 1972. This paper builds on his line of thought to consider priority encoding of …

Rateless coding has recently been the focus of much practical as well as theoretical
research. In this paper, rateless codes are shown to find a natural application in channels …

Arbitrary varying channels (AVC) are used to model communication settings in which a
channel state may vary arbitrarily over time. Their primary objective is to circumvent …

We consider communication over channels whose statistics are not known in full, but can be
parameterized as a finite family of memoryless channels. A typical approach to address …

A universal decoding procedure is proposed for the intersymbol interference (ISI) Gaussian
channels. The universality of the proposed decoder is in the sense of being independent of …