Computer Science - Information Theory Publications (50)

Search

Computer Science - Information Theory Publications

We explicitly determine the values of reduced cyclotomic periods of order $2^m$, $m\ge 4$, for finite fields of characteristic $p\equiv 3$ or $5\pmod{8}$. These evaluations are applied to obtain explicit factorizations of the corresponding reduced period polynomials. As another application, the weight distributions of certain irreducible cyclic codes are described. Read More


We generalise Gabidulin codes to the case of infinite fields, eventually with characteristic zero. For this purpose, we consider an abstract field extension and any automorphism in the Galois group. We derive some conditions on the automorphism to be able to have a proper notion of rank metric which is in coherence with linearized polynomials. Read More


This paper considers the remote state estimation in a cyber-physical system (CPS) using multiple sensors. The measurements of each sensor are transmitted to a remote estimator over a shared channel, where simultaneous transmissions from other sensors are regarded as interference signals. In such a competitive environment, each sensor needs to choose its transmission power for sending data packets taking into account of other sensors' behavior. Read More


Next generation wireless networks require massive uplink connections as well as high spectral efficiency. It is well known that, theoretically, it is not possible to achieve the sum capacity of multi-user communications with orthogonal multiple access. To meet the challenging requirements of next generation networks, researchers have explored non-orthogonal and overloaded transmission technologies-known as new radio multiple access (NR-MA) schemes-for fifth generation (5G) networks. Read More


This paper considers multiple-input multiple-output (MIMO) relay communication in multi-cellular (interference) systems in which MIMO source-destination pairs communicate simultaneously. It is assumed that due to severe attenuation and/or shadowing effects, communication links can be established only with the aid of a relay node. The aim is to minimize the maximal mean-square-error (MSE) among all the receiving nodes under constrained source and relay transmit powers. Read More


This paper considers a wireless powered communication network (WPCN) with group cooperation, where two communication groups cooperate with each other via wireless power transfer and time sharing to fulfill their expected information delivering and achieve "win-win" collaboration. To explore the system performance limits, we formulate optimization problems to respectively maximize the weighted sum-rate and minimize the total consumed power. The time assignment, beamforming vector and power allocation are jointly optimized under available power and quality of service requirement constraints of both groups. Read More


MmWave communications, one of the cornerstones of future 5G mobile networks, are characterized at the same time by a potential multi-gigabit capacity and by a very dynamic channel, sensitive to blockage, wide fluctuations in the received signal quality, and possibly also sudden link disruption. While the performance of physical and MAC layer schemes that address these issues has been thoroughly investigated in the literature, the complex interactions between mmWave links and transport layer protocols such as TCP are still relatively unexplored. This paper uses the ns-3 mmWave module, with its channel model based on real measurements in New York City, to analyze the performance of the Linux TCP/IP stack (i) with and without link-layer retransmissions, showing that they are fundamental to reach a high TCP throughput on mmWave links and (ii) with Multipath TCP (MP-TCP) over multiple LTE and mmWave links, illustrating which are the throughput-optimal combinations of secondary paths and congestion control algorithms in different conditions. Read More


This paper studies physical layer security in a wireless ad hoc network with numerous legitimate transmitter-receiver pairs and eavesdroppers. A hybrid full-/half-duplex receiver deployment strategy is proposed to secure legitimate transmissions, by letting a fraction of legitimate receivers work in the full-duplex (FD) mode sending jamming signals to confuse eavesdroppers upon their information receptions, and letting the other receivers work in the half-duplex mode just receiving their desired signals. The objective of this paper is to choose properly the fraction of FD receivers for achieving the optimal network security performance. Read More


Coded caching scheme is a technique which reduce the load during peak traffic times in a wireless network system. Placement delivery array (PDA in short) was first introduced by Yan et al.. Read More


We give a categorical treatment, in the spirit of Baez and Fritz, of relative entropy for probability distributions defined on Polish spaces. We define a category called PolStat suitable for reasoning about statistical inference on Polish spaces. We define relative entropy as a functor into Lawvere's category $[0,\infty]$ and we show convexity, lower semicontinuity and uniqueness. Read More


We introduce a unified ensemble for turbo-like codes (TCs) that contains the four main classes of TCs: parallel concatenated codes, serially concatenated codes, hybrid concatenated codes, and braided convolutional codes. We show that for each of the original classes of TCs, it is possible to find an equivalent ensemble by proper selection of the design parameters in the unified ensemble. We also derive the density evolution (DE) equations for this ensemble over the binary erasure channel. Read More


Turbo compressed sensing (Turbo-CS) is an efficient iterative algorithm for sparse signal recovery with partial orthogonal sensing matrices. In this paper, we extend the Turbo-CS algorithm to solve compressed sensing problems involving more general signal structure, including compressive image recovery and low-rank matrix recovery. A main difficulty for such an extension is that the original Turbo-CS algorithm requires prior knowledge of the signal distribution that is usually unavailable in practice. Read More


This paper considers a multipair amplify-and-forward massive MIMO relaying system with one-bit ADCs and one-bit DACs at the relay. The channel state information is estimated via pilot training, and then utilized by the relay to perform simple maximum-ratio combining/maximum-ratio transmission processing. Leveraging on the Bussgang decomposition, an exact achievable rate is derived for the system with correlated quantization noise. Read More


We study the question of extracting a sequence of functions $\{\boldsymbol{f}_i, \boldsymbol{g}_i\}_{i=1}^s$ from observing only the sum of their convolutions, i.e., from $\boldsymbol{y} = \sum_{i=1}^s \boldsymbol{f}_i\ast \boldsymbol{g}_i$. Read More


There is an overwhelming number of news articles published every day around the globe. Following the evolution of a news-story is a difficult task given that there is no such mechanism available to track back in time to study the diffusion of the relevant events in digital news feeds. The techniques developed so far to extract meaningful information from a massive corpus rely on similarity search, which results in a myopic loopback to the same topic without providing the needed insights to hypothesize the origin of a story that may be completely different than the news today. Read More


In this preliminary work, we study the problem of {\it distributed} authentication in wireless networks. Specifically, we consider a system where multiple Bob (sensor) nodes listen to a channel and report their {\it correlated} measurements to a Fusion Center (FC) which makes the ultimate authentication decision. For the feature-based authentication at the FC, channel impulse response has been utilized as the device fingerprint. Read More


A smart meter (SM) measures a consumer's electricity consumption and reports it automatically to a utility provider (UP) in almost real time. Despite many advantages of SMs, their use also leads to serious concerns about consumer privacy. In this paper, SM privacy is studied by considering the presence of a renewable energy source (RES) and a battery, which can be used to partially hide the consumer's energy consumption behavior. Read More


Linear codes with few weights have many applications in secret sharing schemes, authentication codes, communication and strongly regular graphs. In this paper, we consider linear codes with three weights in arbitrary characteristic. To do this, we generalize the recent contribution of Mesnager given in [Cryptography and Communications 9(1), 71-84, 2017]. Read More


Distributed storage systems are known to be susceptible to long tails in response time. In modern online storage systems such as Bing, Facebook, and Amazon, the long tails of the service latency are of particular concern. with 99. Read More


To exploit the sparsity of the considered system, the diffusion proportionate-type least mean square (PtLMS) algorithms assign different gains to each tap in the convergence stage while the diffusion sparsity-constrained LMS (ScLMS) algorithms pull the components towards zeros in the steady-state stage. In this paper, by minimizing a differentiable cost function that utilizes the Riemannian distance between the updated and previous weight vectors as well as the L0 norm of the weighted updated weight vector, we propose a diffusion L0-norm constraint improved proportionate LMS (L0-IPLMS) algorithm, which combines the benefits of the diffusion PtLMS and diffusion ScLMS algorithms and performs the best performance among them. Simulations in a system identification context confirm the improvement of the proposed algorithm. Read More


In this work we characterize the combinatorial metrics admitting a MacWilliams-type identity and describe the group of linear isometries of such metrics. Considering coverings that are not connected, we classify the metrics satisfying the MacWilliams extension property. Read More


Distance-based attenuation is a critical aspect of wireless communications. As opposed to the ubiquitous power-law path loss model, this paper proposes a stretched exponential path loss model that is suitable for short-range communication. In this model, the signal power attenuates over a distance $r$ as $e^{-\alpha r^{\beta}}$, where $\alpha,\beta$ are tunable parameters. Read More


This paper presents outdoor wideband small-scale spatial fading and autocorrelation measurements and results in the 73 GHz millimeter-wave (mmWave) band conducted in downtown Brooklyn, New York. Both directional and omnidirectional receiver (RX) antennas are studied. Two pairs of transmitter (TX) and RX locations were tested with one line-of-sight (LOS) and one non-lineof- sight (NLOS) environment, where a linear track was employed at each RX to move the antenna in half-wavelength increments. Read More


This paper presents details and applications of a novel channel simulation software named NYUSIM, which can be used to generate realistic temporal and spatial channel responses to support realistic physical- and link-layer simulations and design for fifth-generation (5G) cellular communications. NYUSIM is built upon the statistical spatial channel model for broadband millimeter-wave (mmWave) wireless communication systems developed by researchers at New York University (NYU). The simulator is applicable for a wide range of carrier frequencies (500 MHz to 100 GHz), radio frequency (RF) bandwidths (0 to 800 MHz), antenna beamwidths (7? to 360? for azimuth and 7? to 45? for elevation), and operating scenarios (urban microcell, urban macrocell, and rural macrocell), and also incorporates multiple-input multiple-output (MIMO) antenna arrays at the transmitter and receiver. Read More


Multiple-input multiple-output (MIMO) systems are well suited for millimeter-wave (mmWave) wireless communications where large antenna arrays can be integrated in small form factors due to tiny wavelengths, thereby providing high array gains while supporting spatial multiplexing, beamforming, or antenna diversity. It has been shown that mmWave channels exhibit sparsity due to the limited number of dominant propagation paths, thus compressed sensing techniques can be leveraged to conduct channel estimation at mmWave frequencies. This paper presents a novel approach of constructing beamforming dictionary matrices for sparse channel estimation using the continuous basis pursuit (CBP) concept, and proposes two novel low-complexity algorithms to exploit channel sparsity for adaptively estimating multipath channel parameters in mmWave channels. Read More


Polar codes have gained significant amount of attention during the past few years and have been selected as a coding scheme for the next generation of mobile broadband standard. Among decoding schemes, successive-cancellation list (SCL) decoding provides a reasonable trade-off between the error-correction performance and hardware implementation complexity when used to decode polar codes, at the cost of limited throughput. The simplified SCL (SSCL) and its extension SSCL-SPC increase the speed of decoding by removing redundant calculations when encountering particular information and frozen bit patterns (rate one and single parity check codes), while keeping the error-correction performance unaltered. Read More


We obtain estimates for the Mean Squared Error (MSE) for the multitaper spectral estimator and certain compressive acquisition methods for multi-band signals. We confirm a fact discovered by Thomson [Spectrum estimation and harmonic analysis, Proc. IEEE, 1982]: assuming bandwidth $W$ and $N$ time domain observations, the average of the square of the first $K=2NW$ Slepian functions approaches, as $K$ grows, an ideal band-pass kernel for the interval $[-W,W]$. Read More


In a former paper the authors introduced two new systematic authentication codes based on the Gray map over a Galois ring. In this paper, it is proved the one-to-one onto correspondence between keys and encoding maps for the second introduced authentication code. Read More


This paper proposes a novel entropy encoding technique for lossless data compression. Representing a message string by its lexicographic index in the permutations of its symbols results in a compressed version matching Shannon entropy of the message. Commercial data compression standards make use of Huffman or arithmetic coding at some stage of the compression process. Read More


The capacity of the semi-deterministic relay channel (SD-RC) with non-causal channel state information (CSI) only at the encoder and decoder is characterized. The capacity is achieved by a scheme based on cooperative-bin-forward. This scheme allows cooperation between the transmitter and the relay without the need to decode a part of the message by the relay. Read More


We present a new family of maximum rank distance (MRD) codes. The new class contains codes that are neither equivalent to a generalised Gabidulin nor to a twisted Gabidulin code, the only two known general constructions of linear MRD codes. Read More


This paper presents a millimeter-wave (mmWave) wideband sliding correlator channel sounder with flexibility to operate at various transmission rates. The channel sounder can transmit and receive up to 1 GHz of RF null-to-null bandwidth while measuring a 2 nanosecond multipath time resolution. The system architecture takes advantage of field-programmable gate arrays (FPGAs), high-speed digital-to-analog converters (DACs), and low phase noise Rubidium (Rb) references for synchronization. Read More


This paper presents millimeter wave (mmWave) penetration loss measurements and analysis at 73 GHz using a wideband sliding correlator channel sounder in an indoor office environment. Penetration loss was measured using a carefully controlled measurement setup for many common indoor building materials such as glass doors, glass windows, closet doors, steel doors, and whiteboard writing walls. Measurements were conducted using narrowbeam transmitter (TX) and receiver (RX) horn antennas that were boresight-aligned with a test material between the antennas. Read More


We propose a new partial decoding algorithm for one-point Hermitian codes that can decode up to the same number of errors as the Guruswami--Sudan decoder. Simulations suggest that it has a similar failure probability as the latter one. The algorithm is based on a recent generalization of the power decoding algorithm for Reed--Solomon codes and does not require an expensive root-finding step. Read More


When Physical Unclonable Functions (PUFs) are used for cryptographic purposes, error correction in combination with a helper data scheme is an essential component due to the fuzzy nature of a PUF. All known schemes require both a code and additional helper data to recover PUF responses. Recently, M\"uelich and Bossert proposed a scheme that only requires a code. Read More


This work addresses the recovery and demixing problem of signals that are sparse in some general dictionary. Involved applications include source separation, image inpainting, super-resolution, and restoration of signals corrupted by clipping, saturation, impulsive noise, or narrowband interference. We employ the $\ell_q$-norm ($0 \le q < 1$) for sparsity inducing and propose a constrained $\ell_q$-minimization formulation for the recovery and demixing problem. Read More


This work addresses the robust reconstruction problem of a sparse signal from compressed measurements. We propose a robust formulation for sparse reconstruction which employs the $\ell_1$-norm as the loss function for the residual error and utilizes a generalized nonconvex penalty for sparsity inducing. The $\ell_1$-loss is less sensitive to outliers in the measurements than the popular $\ell_2$-loss, while the nonconvex penalty has the capability of ameliorating the bias problem of the popular convex LASSO penalty and thus can yield more accurate recovery. Read More


In high-speed railway (HSR) communication systems, distributed antenna is usually employed to support frequent handover and enhance the signal to noise ratio to user equipments. In this case, dynamic time-domain power allocation and antenna selection (PAWAS) could be jointly optimized to improve the system performances. This paper consider this problem in such a simple way where dynamic switching between multiple-input-multiple-output (MIMO) and single-input-multiple-output (SIMO) is allowed and exclusively utilized, while the channel states and traffic demand are taken into account. Read More


This paper presents a new decoding for polynomial residue codes, called the minimum degree-weighted distance decoding. The newly proposed decoding is based on the degree-weighted distance and different from the traditional minimum Hamming distance decoding. It is shown that for the two types of minimum distance decoders, i. Read More


Based on unique decoding of the polynomial residue code with non-pairwise coprime moduli, a polynomial with degree less than that of the least common multiple (lcm) of all the moduli can be accurately reconstructed when the number of residue errors is less than half the minimum distance of the code. However, once the number of residue errors is beyond half the minimum distance of the code, the unique decoding may fail and lead to a large reconstruction error. In this paper, assuming that all the residues are allowed to have errors with small degrees, we consider how to reconstruct the polynomial as accurately as possible in the sense that a reconstructed polynomial is obtained with only the last $\tau$ number of coefficients being possibly erroneous, when the residues are affected by errors with degrees upper bounded by $\tau$. Read More


We establish existence of Stein kernels for probability measures on $\mathbb{R}^d$ satisfying a Poincar\'e inequality, and obtain bounds on the Stein discrepancy of such measures. Applications to quantitative central limit theorems are discussed, including a new CLT in Wasserstein distance $W_2$ with optimal rate and dependence on the dimension. As a byproduct, we obtain a stability version of an estimate of the Poincar\'e constant of probability measures under a second moment constraint. Read More


Minimax robust decentralized detection is studied for parallel sensor networks. Random variables corresponding to sensor observations are assumed to follow a distribution function, which belongs to an uncertainty class. It has been proven that, for some uncertainty classes, if all probability distributions are absolutely continuous with respect to a common measure, the joint stochastic boundedness property, which is the fundamental rule for the derivations in Veerevalli's work, does not hold. Read More


The exponential increase in mobile data traffic forces network operators to deal with a capacity shortage. One of the most promising technologies for 5G networks is proactive caching. Using a network of cache enabled small cells, traffic during peak hours can be reduced through proactively caching the content that is most probable to be requested. Read More


This paper proposes a new algorithm to improve the throughput of the MIMO interference channel, under imperfect channel state information (CSI). Each transmitter and receiver has respectively M and N antennas and network operates in a time division duplex mode. With the knowledge of channel estimation error variance, mean of signal-to-interference-plus-noise ratio (SINR) is approximated. Read More


In this short paper, we develop a probabilistic algorithm for the elliptic curve discrete logarithm problem. This algorithm is not generic in nature, it uses some properties of the elliptic curve. Read More


Outsourcing integrated circuit (IC) manufacturing to offshore foundries has grown exponentially in recent years. Given the critical role of ICs in the control and operation of vehicular systems and other modern engineering designs, such offshore outsourcing has led to serious security threats due to the potential of insertion of hardware trojans - malicious designs that, when activated, can lead to highly detrimental consequences. In this paper, a novel game-theoretic framework is proposed to analyze the interactions between a hardware manufacturer, acting as attacker, and an IC testing facility, acting as defender. Read More


This paper addresses carrier frequency offset (CFO) estimation and training sequence design for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems over frequency selective fading channels. By exploiting the orthogonality of the training sequences in the frequency domain, integer CFO (ICFO) is estimated. {With the uniformly spaced non-zero pilots in the training sequences} and the corresponding geometric mapping, fractional CFO (FCFO) is estimated through the roots of a real polynomial. Read More


Differential privacy is a strong privacy notion based on indistinguishability of outputs of two neighboring datasets, which represent two states of one's information is within or without of a dataset. However, when facing dependent records, the representation would lose its foundation. Motivated by the observation, we introduce a variant of differential privacy notion based on the influence of outputs to an individual's inputs. Read More