Mathematics - Information Theory Publications (50)

Search

Mathematics - Information Theory Publications

The Internet of Things (IoT) being a promising technology of the future is expected to connect billions of devices. The increased number of communication is expected to generate mountains of data and the security of data can be a threat. The devices in the architecture are essentially smaller in size and low powered. Read More


We consider an energy harvesting two-hop network where a source is communicating to a destination through a relay. During a given communication session time, the source collects measurement updates from a physical phenomenon and sends them to the relay, which then forwards them to the destination. The objective is to send these updates to the destination as timely as possible; namely, such that the total age of information is minimized by the end of the communication session, subject to energy causality constraints at the source and the relay, and data causality constraints at the relay. Read More


De, Trevisan and Tulsiani [CRYPTO 2010] show that every distribution over $n$-bit strings which has constant statistical distance to uniform (e.g., the output of a pseudorandom generator mapping $n-1$ to $n$ bit strings), can be distinguished from the uniform distribution with advantage $\epsilon$ by a circuit of size $O( 2^n\epsilon^2)$. Read More


In error-correcting codes, locality refers to several different ways of quantifying how easily a small amount of information can be recovered from encoded data. In this work, we study a notion of locality called the s-Disjoint-Repair-Group Property (s-DRGP). This notion can interpolate between two very different settings in coding theory: that of Locally Correctable Codes (LCCs) when s is large---a very strong guarantee---and Locally Recoverable Codes (LRCs) when s is small---a relatively weaker guarantee. Read More


Channel estimation is useful in millimeter wave (mmWave) MIMO communication systems. Channel state information allows optimized designs of precoders and combiners under different metrics such as mutual information or signal-to-interference-noise (SINR) ratio. At mmWave, MIMO precoders and combiners are usually hybrid, since this architecture provides a means to trade-off power consumption and achievable rate. Read More


Consider a fading Gaussian MIMO channel with $N_\mathrm{t}$ transmit and $N_\mathrm{r}$ receive antennas. The transmitter selects $L_\mathrm{t}$ antennas corresponding to the strongest channels. For this setup, we study the distribution of the input-output mutual information when $N_\mathrm{t}$ grows large. Read More


A general class of nonlinear Least Square Error (LSE) precoders in multi-user multiple-input multiple-output systems is analyzed using the replica method from statistical mechanics. A single cell downlink channel with $N$ transmit antennas at the base station and $K$ single-antenna users is considered. The data symbols are assumed to be iid Gaussian and the precoded symbols on each transmit antenna are restricted to be chosen from a predefined set $\mathbb{X}$. Read More


Hypothesis testing is a statistical inference framework for determining the true distribution among a set of possible distributions for a given dataset. Privacy restrictions may require the curator of the data or the respondents themselves to share data with the test only after applying a randomizing privacy mechanism. This work considers mutual information (MI) as the privacy metric for measuring leakage. Read More


Recent regulatory changes proposed by the Federal Communications Commission (FCC) permitting unlicensed use of television white space (TVWS) channels present new opportunities for designing wireless networks that make efficient use of this spectrum. The favorable propagation characteristics of these channels and their widespread availability, especially in rural areas, make them well-suited for providing broadband services in sparsely populated regions where economic factors hinder deployment of such services on licensed spectrum. In this context, this paper explores the deployment of an outdoor Wi-Fi-like network operating in TVWS channels, referred to commonly as a Super Wi-Fi network. Read More


Millimeter wave (mmWave) communications have been considered as a key technology for future 5G wireless networks. In order to overcome the severe propagation loss of mmWave channel, mmWave multiple-input multiple-output (MIMO) systems with analog/digital hybrid precoding and combining transceiver architecture have been widely considered. However, physical layer security (PLS) in mmWave MIMO systems and the secure hybrid beamformer design have not been well investigated. Read More


In phase retrieval problems, a signal of interest (SOI) is reconstructed based on the magnitude of a linear transformation of the SOI observed with additive noise. The linear transform is typically referred to as a measurement matrix. Many works on phase retrieval assume that the measurement matrix is a random Gaussian matrix, which, in the noiseless scenario with sufficiently many measurements, guarantees invertability of the transformation between the SOI and the observations, up to an inherent phase ambiguity. Read More


For noisy compressive sensing systems, the asymptotic distortion with respect to an arbitrary distortion function is determined when a general class of least-square based reconstruction schemes is employed. The sampling matrix is considered to belong to a large ensemble of random matrices including i.i. Read More


Physical layer security has been considered as an important security approach in wireless communications to protect legitimate transmission from passive eavesdroppers. This paper investigates the physical layer security of a wireless multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) communication system in the presence of a multiple-antenna eavesdropper. We first propose a transmit-filter-assisted secure MIMO-OFDM system which can destroy the orthogonality of eavesdropper's signals. Read More


This paper investigates the problem of hybrid precoder and combiner design for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems operating in millimeter-wave (mmWave) bands. We propose a novel iterative scheme to design the codebook-based analog precoder and combiner in forward and reverse channels. During each iteration, we apply compressive sensing (CS) technology to efficiently estimate the equivalent MIMO-OFDM mmWave channel. Read More


In this paper, a practical wireless transmission scheme is proposed to transmit confidential messages to the desired user securely and precisely by the joint use of multiple tools including artificial noise (AN) projection, phase alignment (PA)/beamforming, and random subcarrier selection (RSCS) based on OFDM, and directional modulation (DM), short for RSCS-OFDM-DM. This RSCS-OFDM-DM scheme provides an extremely low-complexity structure for the desired receiver and makes the secure and precise wireless transmission realizable in practical. For illegitimate eavesdroppers, the receive power of confidential messages is so weak that their receivers cannot intercept these confidential messages successfully once it is corrupted by AN. Read More


Analog/digital hybrid precoder and combiner have been widely used in millimeter wave (mmWave) multiple-input multiple-output (MIMO) systems due to its energy-efficient and economic superiorities. Infinite resolution of phase shifters (PSs) for the analog beamformer can achieve very close performance compared to the full-digital scheme but will result in high complexity and intensive power consumption. Thus, more cost effective and energy efficient low resolution PSs are typically used in practical mmWave MIMO systems. Read More


Millimeter-wave (mmWave) communications have been considered as a key technology for future 5G wireless networks because of the orders-of-magnitude wider bandwidth than current cellular bands. In this paper, we consider the problem of codebook-based joint analog-digital hybrid precoder and combiner design for spatial multiplexing transmission in a mmWave multiple-input multiple-output (MIMO) system. We propose to jointly select analog precoder and combiner pair for each data stream successively aiming at maximizing the channel gain while suppressing the interference between different data streams. Read More


We consider a user-centric co-operative cellular network, where base stations close to a mobile co-operate to detect its signal using a (joint) linear minimum-mean-square-error receiver. The base stations, which have multiple antennas, and mobiles are modeled as independent Poisson Point Processes to avoid dependence on specific node locations. Combining stochastic geometry and infinite random matrix theory, we derive a simple expression for the spectral efficiency of this complex system as the number of antennas grows large. Read More


In the coded caching framework proposed by Maddah Ali and Niesen, there are two classes of coding schemes known in the literature, namely uncoded prefetching schemes and coded prefetching schemes. In this work, we provide a connection between the uncoded prefetching scheme proposed by Maddah Ali and Niesen (and its improved version by Yu et al.) and the coded prefetching scheme proposed by Tian and Chen, when the number of files is no larger than that of users. Read More


Most of the codes that have an algebraic decoding algorithm are derived from the Reed Solomon codes. They are obtained by taking equivalent codes, for example the generalized Reed Solomon codes, or by using the so-called subfield subcode method, which leads to Alternant codes and Goppa codes over the underlying prime field, or over some intermediate subfield. The main advantages of these constructions is to preserve both the minimum distance and the decoding algorithm of the underlying Reed Solomon code. Read More


We consider the problem of querying a string (or, a database) of length $N$ bits to determine all the locations where a substring (query) of length $M$ appears either exactly or is within a Hamming distance of $K$ from the query. We assume that sketches of the original signal can be computed off line and stored. Using the sparse Fourier transform computation based approach introduced by Pawar and Ramchandran, we show that all such matches can be determined with high probability in sub-linear time. Read More


Transversality is a simple and effective method for implementing quantum computation fault-tolerantly. However, no quantum error-correcting code (QECC) can transversally implement a quantum universal gate set (Eastin and Knill, Phys. Rev. Read More


We derive a lower bound on the differential entropy of a log-concave random variable $X$ in terms of the $p$-th absolute moment of $X$. The new bound leads to a reverse entropy power inequality with an explicit constant, and to new bounds on the rate-distortion function and the channel capacity. Specifically, we study the rate-distortion function for log-concave sources and distortion measure $| x - \hat x|^r$, and we establish that the difference between the rate distortion function and the Shannon lower bound is at most $\log(2 \sqrt{\pi e}) \approx 2. Read More


This paper considers the design of the beamformers for a multiple-input single-output (MISO) downlink system that seeks to mitigate the impact of the imperfections in the channel state information (CSI) that is available at the base station (BS). The goal of the design is to minimize the outage probability of specified signal-to-interference-and-noise ratio (SINR) targets, while satisfying per-antenna power constraints (PAPCs), and to do so at a low computational cost. Based on insights from the offset maximization technique for robust beamforming, and observations regarding the structure of the optimality conditions, low-complexity iterative algorithms that involve the evaluation of closed-form expressions are developed. Read More


In this paper, we investigate secure transmission over the large-scale multiple-antenna wiretap channel with finite alphabet inputs. First, we investigate the case where instantaneous channel state information (CSI) of the eavesdropper is known at the transmitter. We show analytically that a generalized singular value decomposition (GSVD) based design, which is optimal for Gaussian inputs, may exhibit a severe performance loss for finite alphabet inputs in the high signal-to-noise ratio (SNR) regime. Read More


We study a lossy source coding problem for a memoryless remote source. The source data is broadcast over an arbitrarily varying channel (AVC) controlled by an adversary. One output of the AVC is received as input at the encoder, and another output is received as side information at the decoder. Read More


In this paper the focus is on subsampling as well as reconstructing the second-order statistics of signals residing on nodes of arbitrary undirected graphs. Second-order stationary graph signals may be obtained by graph filtering zero-mean white noise and they admit a well-defined power spectrum whose shape is determined by the frequency response of the graph filter. Estimating the graph power spectrum forms an important component of stationary graph signal processing and related inference tasks such as Wiener prediction or inpainting on graphs. Read More


Wireless surveillance is becoming increasingly important to protect the public security by legitimately eavesdropping suspicious wireless communications. This paper studies the wireless surveillance of a two-hop suspicious communication link by a half-duplex legitimate monitor. By exploring the suspicious link's two-hop nature, the monitor can adaptively choose among the following three eavesdropping modes to improve the eavesdropping performance: (I) \emph{passive eavesdropping} to intercept both hops to decode the message collectively, (II) \emph{proactive eavesdropping} via {\emph{noise jamming}} over the first hop, and (III) \emph{proactive eavesdropping} via {\emph{hybrid jamming}} over the second hop. Read More


The proliferation of mobile Internet and connected devices, offering a variety of services at different levels of performance, represents a major challenge for the fifth generation wireless networks and beyond. This requires a paradigm shift towards the development of key enabling techniques for the next generation wireless networks. In this respect, visible light communication (VLC) has recently emerged as a new communication paradigm that is capable of providing ubiquitous connectivity by complementing radio frequency communications. Read More


The smart meter (SM) privacy problem is addressed together with the cost of energy for the consumer. It is assumed that a storage device, e.g. Read More


In this article a framework is presented for the joint optimization of the analog transmit and receive filter with respect to a channel estimation problem. At the receiver, conventional signal processing systems restrict the bandwidth of the analog pre-filter $B$ to the rate of the analog-to-digital converter $f_s$ in order to comply with the well-known Nyquist sampling theorem. In contrast, here we consider a transceiver that by design violates the common paradigm $B\leq f_s$. Read More


Multiple antennas have been exploited for spatial multiplexing and diversity transmission in a wide range of communication applications. However, most of the advances in the design of high speed wireless multiple-input multiple output (MIMO) systems are based on information-theoretic principles that demonstrate how to efficiently transmit signals conforming to Gaussian distribution. Although the Gaussian signal is capacity-achieving, signals conforming to discrete constellations are transmitted in practical communication systems. Read More


In this paper, we introduce a wideband dictionary framework for estimating sparse signals. By formulating integrated dictionary elements spanning bands of the considered parameter space, one may efficiently find and discard large parts of the parameter space not active in the signal. After each iteration, the zero-valued parts of the dictionary may be discarded to allow a refined dictionary to be formed around the active elements, resulting in a zoomed dictionary to be used in the following iterations. Read More


In vehicular scenarios context awareness is a key enabler for road safety. However, the amount of contextual information that can be collected by a vehicle is stringently limited by the sensor technology itself (e.g. Read More


Increasing data traffic demands over wireless spectrum have necessitated spectrum sharing and coexistence between heterogeneous systems such as radar and cellular communications systems. In this context, we specifically investigate the co-channel coexistence between an air traffic control (ATC) radar and a wide area cellular communication (comms) system. We present a comprehensive characterization and analysis of interference caused by the comms system on the ATC radar with respect to multiple parameters such as radar range, protection radius around the radar, and radar antenna elevation angle. Read More


The multivariate linear regression model with shuffled data and additive Gaussian noise arises in various correspondence estimation and matching problems. Focusing on the denoising aspect of this problem, we provide a characterization the minimax error rate that is sharp up to logarithmic factors. We also analyze the performance of two versions of a computationally efficient estimator, and establish their consistency for a large range of input parameters. Read More


The scalable calculation of matrix determinants has been a bottleneck to the widespread application of many machine learning methods such as determinantal point processes, Gaussian processes, generalised Markov random fields, graph models and many others. In this work, we estimate log determinants under the framework of maximum entropy, given information in the form of moment constraints from stochastic trace estimation. The estimates demonstrate a significant improvement on state-of-the-art alternative methods, as shown on a wide variety of UFL sparse matrices. Read More


Inspired by the Z2Z4-additive codes, linear codes over Z2^r x(Z2+uZ2)^s have been introduced by Aydogdu et al. more recently. Although these family of codes are similar to each other, linear codes over Z2^r x(Z2+uZ2)^s have some advantages compared to Z2Z4-additive codes. Read More


Fast polarization is an important and useful property of polar codes. It was proved for the binary polarizing $2 \times 2$ kernel by Arikan and Telatar. The proof was later generalized by Sasoglu. Read More


In this paper we study Z2Z4Z8-additive codes, which are the extension of recently introduced Z2Z4-additive codes. We determine the standard forms of the generator and parity-check matrices of Z2Z4Z8-additive codes. Moreover, we investigate Z2Z4Z8-cyclic codes giving their generator polynomials and spanning sets. Read More


In the paper, we make an investigation of robust beamforming for secure directional modulation in the multi-user multiple-input and multiple output (MU-MIMO) systems in the presence of direction angle measurement errors. When statistical knowledge of direction angle measurement errors is unavailable, a novel robust beamforming scheme of combining main-lobe-integration (MLI) and leakage is proposed to simultaneously transmit multiple different independent parallel confidential message streams to the associated multiple distinct desired users. The proposed scheme includes two steps: designing the beamforming vectors of the useful confidential messages and constructing artificial noise (AN) projection matrix. Read More


A method for compression of large graphs and non-negative matrices to a block structure is proposed. Szemer\'edi's regularity lemma is used as heuristic motivation of the significance of stochastic block models. Another ingredient of the method is Rissanen's minimum description length principle (MDL). Read More


We present quasi-linear time systematic encoding algorithms for multiplicity codes. The algorithms have their origins in the fast multivariate interpolation and evaluation algorithms of van der Hoeven and Schost (2013), which we generalise to address certain Hermite-type interpolation and evaluation problems. By providing fast encoding algorithms for multiplicity codes, we remove an obstruction on the road to the practical application of the private information retrieval protocol of Augot, Levy-dit-Vehel and Shikfa (2014). Read More


It is well known that the entropy $H(X)$ of a finite random variable is always greater or equal to the entropy $H(f(X))$ of a function $f$ of $X$, with equality if and only if $f$ is one-to-one. In this paper, we give tights bounds on $H(f(X))$ when the function $f$ is not one-to-one, and we illustrate a few scenarios where this matters. As an intermediate step towards our main result, we prove a lower bound on the entropy of a probability distribution, when only a bound on the ratio between the maximum and the minimum probability is known. Read More


The fifth-generation (5G) networks are expected to be able to satisfy users' different quality-of-service (QoS) requirements. Network slicing is a promising technology for 5G networks to provide services tailored for users' specific QoS demands. Driven by the increased massive wireless data traffic from different application scenarios, efficient resource allocation schemes should be exploited to improve the flexibility of network resource allocation and capacity of 5G networks based on network slicing. Read More


Millimeter wave (mmWave) communication technologies have recently emerged as an attractive solution to meet the exponentially increasing demand on mobile data traffic. Moreover, ultra dense networks (UDNs) combined with mmWave technology are expected to increase both energy efficiency and spectral efficiency. In this paper, user association and power allocation in mmWave based UDNs is considered with attention to load balance constraints, energy harvesting by base stations, user quality of service requirements, energy efficiency, and cross-tier interference limits. Read More


We study the problem of constructing good space-time codes for broadcasting $K$ independent messages over a MIMO network to $L$ users, where each user demands all the messages and already has a subset of messages as side information. As a first attempt, we consider the $2\times 2$ case and propose golden-coded index coding by partitioning the golden codes into $K$ subcodes, one for each message. The proposed scheme is shown to have the property that for any side information configuration, the minimum determinant of the code increases exponentially with the amount of information contained in the side information. Read More


Recently, error correcting codes in the erasure channel have drawn great attention for various applications such as distributed storage systems and wireless sensor networks, but many of their decoding algorithms are not practical because they have higher decoding complexity and longer delay. Thus, the automorphism group decoder (AGD) for cyclic codes in the erasure channel was introduced, which has good erasure decoding performance with low decoding complexity. In this paper, we propose new two-stage AGDs (TS-AGDs) for cyclic codes in the erasure channel by modifying the parity check matrix and introducing the preprocessing stage to the AGD scheme. Read More


In this paper we consider a channel model that is often used to describe the mobile wireless scenario: multiple-antenna additive white Gaussian noise channels subject to random (fading) gain with full channel state information at the receiver. Dynamics of the fading process are approximated by a piecewise-constant process (frequency non-selective isotropic block fading). This work addresses the finite blocklength fundamental limits of this channel model. Read More


Finding the optimal encoding strategies can be challenging for communication using quantum channels, as classical and quantum capacities may be superadditive. Entanglement assistance can often simplify this task, as the entanglement-assisted classical capacity for any channel is additive, making entanglement across channel uses unnecessary. If the entanglement assistance is limited, the picture is much more unclear. Read More