Browsing Division of Electrical, Electronics, and Computer Science (EECS) by Title
Now showing items 828-847 of 1262
-
On Codes for Private Information Retrieval and Ceph Implementation of a High-Rate Regenerating Code
(2018-07-09)Error-control codes, which are being extensively used in communication systems, have found themselves very useful in data storage as well during the past decade. This thesis deals with two types of codes for data storage, ... -
On Design and Analysis of Energy Efficient Wireless Networks with QoS
(2018-06-13)We consider optimal power allocation policies for a single server, multiuser wireless communication system. The transmission channel may experience multipath fading. We obtain very efficient, low computational complexity ... -
On Dimensional Parameters Of Graphs And Posets
(2013-06-21)In this thesis we study the following dimensional parameters : boxicity, cubicity, threshold dimension and poset dimension. While the first three parameters are defined on graphs, poset dimension is defined on partially ... -
On Generalized Measures Of Information With Maximum And Minimum Entropy Prescriptions
(2008-01-29)Kullback-Leibler relative-entropy or KL-entropy of P with respect to R defined as ∫xlnddPRdP , where P and R are probability measures on a measurable space (X, ), plays a basic role in the definitions of classical information ... -
On Learning and Lower Bound Problems Related to the Iterated Matrix Multiplication Polynomial
The iterated matrix multiplication polynomial (IMM) of width w and length d is the 1x1 entry in the product of d square matrices of size w. The w^2d entries in the d matrices are distinct variables. In this thesis, we study ... -
On Learning k-Parities and the Complexity of k-Vector-SUM
(2018-02-06)In this work, we study two problems: first is one of the central problem in learning theory of learning sparse parities and the other k-Vector-SUM is an extension of the not oriousk-SUM problem. We first consider the problem ... -
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 Maximizing The Performance Of The Bilateral Filter For Image Denoising
(2017-07-07)We address the problem of image denoising for additive white Gaussian noise (AWGN), Poisson noise, and Chi-squared noise scenarios. Thermal noise in electronic circuitry in camera hardware can be modeled as AWGN. Poisson ... -
On Media-Based Modulation for Wireless Communications
Traditionally, symbols chosen from complex modulation alphabets such as QAM and PSK are used to convey information bits, and complex fades introduced by the channel are viewed as detrimental effects that cause amplitude ... -
On Network Coding and Network-Error Correction
(2018-04-24)The paradigm of network coding was introduced as a means to conserve bandwidth (or equivalently increase throughput) in information flow networks. Network coding makes use of the fact that unlike physical commodities, ... -
On Orthogonal Time Frequency Space Modulation for Wireless Communications
Future wireless communication systems are envisioned to support diverse requirements that include high mobility application scenarios such as high-speed trains, and vehicle-to-vehicle and vehicle-toinfrastructure communications. ... -
On Perception-Based Image Compression Schemes
(2012-03-26) -
On Plug-and-Play Regularization using Linear Denoisers
The problem of inverting a given measurement model comes up in several computational imaging applications. For example, in CT and MRI, we are required to reconstruct a high-resolution image from incomplete noisy measurements, ... -
On Reduced-State Optimal Scheduling for Decentralized Medium Access Control of Wireless Data Collection Networks
In the Internet of Things (IoT), devices such as sensors and actuators will almost invariably be connected to the Internet via wireless networks. The sensor and actuator devices in such systems will be resource challenged ... -
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 ... -
On Streaming Codes, Regenerating Codes and Locality-Aided Decoding
This thesis presents results relating to the application of error-correcting codes with different aims and in different settings; to achieve low-latency communication, to improve decoding performance and to enable the ... -
On symmetries of and equivalence tests for two polynomial families and a circuit class
Two polynomials f, g ∈ F[x1, . . . , xn] over a field F are said to be equivalent if there exists an n×n invertible matrix A over F such that g = f(Ax), where x = (x1 · · · xn)T . The equivalence test (in short, ET) for ... -
On The Best-m Feedback Scheme In OFDM Systems With Correlated Subchannels
(2017-07-07)Orthogonal frequency division multiplexing (OFDM) in next generation wireless systems provides high downlink data rates by employing frequency-domain scheduling and rate adaptation at the base station (BS). However, in ...