Browsing by Advisor "Kashyap, Navin"
Now showing items 1-9 of 9
-
Algebraic Techniques for Error Correction in Random Networks
Abstract The transmission of data in the presence of errors and erasures over random networks, in situations where there is only partial information regarding the underlying network topology, has been interpreted in ... -
Capacity Computation and Coding for Input-Constrained Channels
The setting of the transmission of information over noisy, binary-input, memoryless channels is today well-understood, owing to the work of several information theorists, beginning with Claude Shannon. It is known that it ... -
Coding Schemes for Secure and Reliable DNA-Based Data Storage
In DNA-based data storage, the desired information is encoded into the quaternary sequence of synthetic DNA molecules, called oligos. We look at secure communication via information-containing oligos in the usual three-party ... -
Exploring the Fundamental Limits of Information-Theoretically Secure Key Generation and DNA-Based Data Storage
In this dissertation, we carry out an exploration of the fundamental limits of information-theoretic security in two different settings: multiterminal key agreement and DNA-based data storage. Most of the dissertation ... -
Lattice Codes for Secure Communication and Secret Key Generation
(2018-05-22)In this work, we study two problems in information-theoretic security. Firstly, we study a wireless network where two nodes want to securely exchange messages via an honest-but-curious bidirectional relay. There is no ... -
On Linear Codes in Projective Spaces
The projective space $\mathbb{P}_q(n)$ of order $n$ over a finite field $\mathbb{F}_q$ is defined as the collection of all subspaces of the ambient space $\mathbb{F}_q^n$. The Grassmannian $\mathcal{G}_q(n, k)$ is the set ... -
On Some Questions Involving Prefix Codes
Let A be a finite alphabet and A be the set of all finite sequences of the elements of A. A word is any member of A . A prefix code X is a set of words satisfying the prefix property, i.e., no word in the set is a prefix ... -
Probabilistic Forwarding of Coded Packets for Broadcasting over Networks
Motivated by applications in sensor networks and the Internet of Things (IoT), in this dissertation, we consider the problem of energy-efficient broadcasting from a source node in a large dense network. Flooding, as a ... -
Secret Key Generation in the Multiterminal Source Model : Communication and Other Aspects
(2018-07-04)This dissertation is primarily concerned with the communication required to achieve secret key (SK) capacity in a multiterminal source model. The multiterminal source model introduced by Csiszár and Narayan consists of a ...