#### Filter Results:

- Full text PDF available (51)

#### Publication Year

2000

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- J. Nicholas Laneman, Emin Martinian, Gregory W. Wornell, John G. Apostolopoulos
- IEEE Transactions on Information Theory
- 2005

We consider transmitting a source across a pair of independent, nonergodic channels with random states (e.g., slow-fading channels) so as to minimize the average distortion. The general problem is unsolved. Hence, we focus on comparing two commonly used source and channel encoding systems which correspond to exploiting diversity either at the physical layer… (More)

- Emin Martinian, Jonathan S. Yedidia
- ArXiv
- 2003

We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is the dual of the binary erasure channel (BEC) coding problem. We show that duals of capacity achieving codes for the BEC yield codes which approach the minimum possible rate for the… (More)

- Emin Martinian, Carl-Erik W. Sundberg
- IEEE Transactions on Information Theory
- 2004

We present a new class of systematic, time-invariant, convolutional encoders suitable for low delay burst erasure correction. Specifically, we show that the new encoders have the shortest possible decoding delay required to correct all bursts of a given length with a fixed redundancy. By comparing the new encoders to maximum distance separable (MDS) codes,… (More)

- E. Martinian, M. Trott
- 2007 IEEE International Symposium on Information…
- 2007

Delay-optimal burst erasure correction codes have the shortest possible decoding delay required to correct all bursts of a given length with a fixed redundancy. We provide a simple construction that yields linear convolutional delay-optimal burst erasure codes for any choice of coding parameters while keeping the finite field small.

- Emin Martinian
- 2004

This thesis explore dynamics in source coding and channel coding. We begin by introducing the idea of distortion side information, which does not directly depend on the source but instead affects the distortion measure. Such distortion side information is not only useful at the encoder but under certain conditions knowing it at the encoder is optimal and… (More)

- Emin Martinian, Martin J. Wainwright
- Data Compression Conference (DCC'06)
- 2006

We propose a new construction for low-density source codes with multiple parameters that can be tuned to optimize the performance of the code. In addition, we introduce a set of analysis techniques for deriving upper bounds for the expected distortion of our construction, as well as more general low-density constructions. We show that (with an optimal… (More)

We consider multiview video compression: the problem of jointly compressing multiple views of a scene recorded by different cameras. To take advantage of the correlation between views, we compare the performance of disparity compensated view prediction and view synthesis prediction to independent coding of all views using H.264/AVC. The proposed view… (More)

- Martin J. Wainwright, Emin Martinian
- IEEE Transactions on Information Theory
- 2009

In this paper, we describe and analyze the source and channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-density parity-check (LDPC) code. Our first pair of theorems establishes that there exist codes from this ensemble, with all degrees remaining bounded independently of… (More)

We consider the secure biometric storage problem and develop a solution using syndrome codes. Specifically, biometrics such as fingerprints, irises, and faces are often used for authentication, access control, and encryption instead of passwords. While it is well known that passwords should never be stored in the clear, current systems often store… (More)

Diversity techniques often arise as appealing means for improving performance of multimedia communication over certain types of channels with independent parallel components (e.g., multiple antennas, frequency bands, or time slots). Diversity can be obtained by channel coding across parallel components at the physical layer. Alternatively, the physical… (More)