A novel scheme for joint source/channel coding of still images is proposed. By using efficient lapped transforms, channel-optimized robust quantizers and classification methods we show that significant improvements over traditional source/channel coding of images can be obtained while keeping the complexity low.

Most of the conventional communication systems use channel interleaving as well as hard decision decoding in their designs, which lead to discarding channel memory and soft-decision information. This simplification is usually done since the complexity of handling the memory or soft-decision information is rather high. In this work, we design two lossy joint source-channel coding (JSCC) schemes ...

We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Blocks (GRBB). We extend Fleischer’s improvement [7] of Garg and Könemann [8] fully polynomial time approximation scheme for edge capacitated multicommodity flows to multiterminal multicommodity flows in graphs with capacities on ver...

Storage area networks, remote backup storage systems, and similar information systems frequently modify stored data with updates from new versions. In these systems, it is desirable for the data to not only be compressed but to also be easily modified during updates. A malleable coding scheme considers both compression efficiency and ease of alteration, promoting some form of reuse or recycling...

The multiterminal hypothesis testing for arbitrarily varying sources (AVS) is considered. This is an extension of Han’s [1] and Ahlswede-Csiszár [2] schemes for a more general class of sources. In part, the solutions can be easily specialized for earlier known particular cases.

This work is motivated by the results of Csiszár and Narayan (IEEE Trans. on Inform. Theory, Dec. 2004), which highlight innate connections between secrecy generation by multiple terminals and multiterminal Slepian-Wolf near-lossless data compression (sans secrecy restrictions). We propose a new approach for constructing secret keys based on the long-known Slepian-Wolf code for sources connecte...

– An MN-Gallager Code over Galois fields, q, based on the Dynamical Block Posterior probabilities (DBP) for messages with a given set of autocorrelations is presented with the following main results: a) for a binary symmetric channel the threshold, fc, is extrapolated for infinite messages using the scaling relation for the median convergence time, tmed ∝ 1/(fc− f); b) a degradation in the thre...

This dissertation is concerned with a communications scenario in which a large number of sensor nodes, deployed on a field, take local measurements of some physical process and cooperate to send back the collected data to a far receiver. The first part considers the problem of communicating multiple correlated sources over independent channels and with partial cooperation among encoders, and pr...