Search
Now showing items 11-19 of 19
Low-PAPR, Low-delay, High-Rate Space-Time Block Codes From Orthogonal Designs
(2011-02-03)
It is well known that communication systems employing multiple transmit and multiple receive antennas provide high data rates along with increased reliability. Some of the design criteria of the space-time block codes ...
Distributed Joint Source-Channel Coding For Multiple Access Channels
(2010-12-31)
We consider the transmission of correlated sources over a multiple access channel(MAC). Multiple access channels are important building blocks in many practical communication systems, e.g., local area networks(LAN), cellular ...
Distributed Coding For Wireless Sensor Networks
(2011-09-08)
Diversity-Mutiplexing Tradeoff Of Asynchronous Cooperative Relay Networks And Diversity Embedded Coding Schemes
(2010-08-23)
This thesis consists of two parts addressing two different problems in fading channels.
The first part deals with asynchronous cooperative relay communication. The assumption of nodes in a cooperative communication relay ...
Guessing And Compression : A Large Deviations Approach
(2011-04-01)
The problem of guessing a random string is studied. It arises in the analysis of the strength of secret-key cryptosystems against guessing attacks. Expected number of guesses, or more generally moments of the number of ...
Contributions on Index Coding, Coded Caching and Gradient Coding
In this thesis, we cover three major areas, namely, index coding, coded caching and gradient coding. We begin by considering unicast index coding problems where a server broadcasts coded messages over a noiseless channel, ...
Efficient Constructions of Streaming Codes
Streaming codes are a class of erasure codes that operate on a stream of packets and enable recovery of dropped or erased packets under a decoding-delay constraint. The primary focus of this thesis is on providing constructions ...
Index Coding over Noisy Channels and Some Applications
A broadcast channel that is very effective for disseminating common content becomes highly inefficient when the users request different content. To address this inefficiency of the broadcast channel over which a server ...