We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field achieve the classical Slepian-Wolf rate region. For finite alphabets we show that decoding is equivalent to solving an integer program. The techniques used may be of independent interest for code design for a wide class...

Entropy coded scaler quantization (ECSQ) performs 1.53 dB from optimal lossy compression at high data rates. In this paper, we generalize this result for distributed source coding with side information. 1-D nested scaler quantization with Slepian-Wolf coding is compared to Wyner-Ziv coding of i.i.d. Gaussian sources at high data rates. We show that nested scaler quantization with Slepian-Wolf c...

This paper deals with a coding problem called complementary delivery, where messages from two correlated sources are jointly encoded and each decoder reproduces one of two messages using the other message as the side information. Both lossless and lossy universal complementary delivery coding schemes are investigated. In the lossless case, it is demonstrated that a universal complementary deliv...

The aim of this paper is to introduce a new methodology for the fault diagnosis of induction 15 machines working in transient regime, when time-frequency analysis tools are used. The proposed 16 method relies on the use of the optimized Slepian window for performing the short time Fourier 17 transform (STFT) of the stator current signal. It is shown that for a given sequence length of finite 18...

We consider the model of random binning and finite–temperature decoding for Slepian–Wolf codes, from a statistical–mechanical perspective. While ordinary random channel coding is intimately related to the random energy model (REM) – a statistical–mechanical model of disordered magnetic materials, it turns out that random binning (for Slepian–Wolf coding) is analogous to another, related statist...

Like most results in information theory, the classical Slepian-Wolf theorem is asymptotic. We characterize how quickly the limits put forth by information theory can be reached. Our contribution is two-fold. First, we investigate the non-asymptotic regime for two binary sources that generate sequences with a symmetric joint distribution. Second, we provide tight converse and achievable bounds a...

We consider the optimal transmission of distributedcorrelated discrete memoryless sources across a network withcapacity constraints. We present several previously undiscussedstructural properties of the set of feasible rates and transmissionschemes. We extend previous results concerning the intersectionof polymatroids and contrapolymatroids to characterize whenall of the...

Rotation moment invariants have been of great interest in image processing and pattern recognition. This paper presents a novel kind of rotation moment invariants based on the Slepian functions, which were originally introduced in the method of separation of variables for Helmholtz equations. They were first proposed for time series by Slepian and his coworkers in the 1960s. Recent studies have...