Loading...
Loading...
Browse, search and filter the latest cybersecurity research papers from arXiv
The domain-independent universal Normalized Information Distance based on Kolmogorov complexity has been (in approximate form) successfully applied to a variety of difficult clustering problems. In this paper we investigate theoretical properties of the un-normalized algorithmic information distance $d_K$. The main question we are asking in this work is what properties this curious distance has, besides being a metric. We show that many (in)finite-dimensional spaces can(not) be isometrically scale-embedded into the space of finite strings with metric $d_K$. We also show that $d_K$ is not an Euclidean distance, but any finite set of points in Euclidean space can be scale-embedded into $(\{0,1\}^*,d_K)$. A major contribution is the development of the necessary framework and tools for finding more (interesting) properties of $d_K$ in future, and to state several open problems.
The optimization of the \gls{pdpr} is a recourse that helps wireless systems to acquire channel state information while minimizing the pilot overhead. While the optimization of the \gls{pdpr} in cellular networks has been studied extensively, the effect of the \gls{pdpr} in \gls{ris}-assisted networks has hardly been examined. This paper tackles this optimization when the communication is assisted by a RIS whose phase shifts are adjusted on the basis of the statistics of the channels. For a setting representative of a macrocellular deployment, the benefits of optimizing the PDPR are seen to be significant over a broad range of operating conditions. These benefits, demonstrated through the ergodic minimum mean squared error, for which a closed-form solution is derived, become more pronounced as the number of RIS elements and/or the channel coherence grow large.
This paper considers wireless communication assisted by a reconfigurable intelligent surface (RIS), focusing on the two-timescale approach, in which the RIS phase shifts are optimized based on channel statistics to mitigate the overheads associated with channel estimation. It is shown that, while the power captured by the RIS scales linearly with the number of its elements, the two-timescale beamforming gain upon re-radiation towards the receiver saturates rapidly as the number of RIS elements increases, for a broad class of power angular spectra (PAS). The ultimate achievable gain is determined by the decay rate of the PAS in the angular domain, which directly influences how rapidly spatial correlations between RIS elements diminish. The implications of this saturation on the effectiveness of RIS-assisted communications are discussed.
Cell-free massive multiple-input multiple-output (MIMO) implemented in virtualized cloud radio access networks (V-CRAN) has emerged as a promising architecture to enhance spectral efficiency (SE), network flexibility, and energy efficiency (EE) in next-generation wireless systems. In this work, we develop a holistic optimization framework for the efficient deployment of cell-free massive MIMO in V-CRAN with multiple mobile network operators (MNOs). Specifically, we formulate a set of mixed-integer programming (MIP) models to jointly optimize access point (AP) selection, user equipment (UE) association, cloud resource allocation, and MNO assignment while minimizing the maximum total power consumption (TPC) across MNOs. We consider two different scenarios based on whether UEs can be assigned to arbitrary MNOs or not. The numerical results demonstrate the impact of different deployment assumptions on power consumption, highlighting that flexible UE-MNO assignment significantly reduces TPC. The findings provide key insights into optimizing resource management in cell-free massive MIMO V-CRAN, paving the way for energy-efficient wireless network implementations.
Cell-free massive MIMO is a key 6G technology, offering superior spectral and energy efficiency. However, its dense deployment of low-cost access points (APs) makes hardware impairments unavoidable. While narrowband impairments are well-studied, their impact in wideband systems remains unexplored. This paper provides the first comprehensive analysis of hardware impairments, such as nonlinear distortion in low-noise amplifiers, phase noise, in-phase-quadrature imbalance, and low-resolution analog-to-digital converters, on uplink spectral efficiency in cell-free massive MIMO. Using an OFDM waveform and centralized processing, APs share channel state information for joint uplink combining. Leveraging Bussgang decomposition, we derive a distortion-aware combining vector that optimizes spectral efficiency by modeling distortion as independent colored noise.
Let $\mathbb {F}_q$ be a finite field and $G$ a finte group with $(|G|,q)=1$. By a group code in $\mathbb {F}_q[G]$ we mean a two-sided ideal in $\mathbb {F}_q[G]$. We will prove a general criterion for the existence of group codes with given hull dimension, and then apply it to deduce explicit criterions for existence of group codes with hull dimension $\leq3$. In particular our criterion for the existence of $1$-dimensional hulls generalizes that of privious work which consider only abelian groups $G$.
Any agents we can possibly build are subject to capacity constraints, as memory and compute resources are inherently finite. However, comparatively little attention has been dedicated to understanding how agents with limited capacity should allocate their resources for optimal performance. The goal of this paper is to shed some light on this question by studying a simple yet relevant continual learning problem: the capacity-constrained linear-quadratic-Gaussian (LQG) sequential prediction problem. We derive a solution to this problem under appropriate technical conditions. Moreover, for problems that can be decomposed into a set of sub-problems, we also demonstrate how to optimally allocate capacity across these sub-problems in the steady state. We view the results of this paper as a first step in the systematic theoretical study of learning under capacity constraints.
Cell-Free (CF) Massive Multiple-Input Multiple-Output (MaMIMO) is considered one of the leading candidates for enabling next-generation wireless communication. With the growing interest in the Internet of Things (IoT), the Grant-Free (GF) access scheme has emerged as a promising solution to support massive device connectivity. The integration of GF and CF-MaMIMO introduces significant challenges, particularly in designing distributed algorithms for activity detection and pilot contamination mitigation. In this paper, we propose a distributed algorithm that addresses these challenges. Our method first employs a component-wise iterative distributed Maximum Likelihood (ML) approach for activity detection, which considers both the pilot and data portions of the received signal. This is followed by a Pseudo-Prior Hybrid Variational Bayes and Expectation Propagation (PP-VB-EP) algorithm for joint data detection and channel estimation. Compared to conventional VB-EP, the proposed PP-VB-EP demonstrates improved convergence behavior and reduced sensitivity to initialization, especially when data symbols are drawn from a finite alphabet. The pseudo prior used in PP-VB-EP acts as an approximated posterior and serves as a regularization term that prevents the Message Passing (MP) algorithm from diverging. To compute the pseudo prior in a distributed fashion, we further develop a distributed version of the Variable-Level Expectation Propagation (VL-EP) algorithm.
Generalized Bicycle (GB) codes offer a compelling alternative to surface codes for quantum error correction. This paper focuses on (2,2)-Generalized Bicycle codes, constructed from pairs of binary circulant matrices with two non-zero elements per row. Leveraging a lower bound on their minimum distance, we construct three novel infinite families of optimal (2,2)-GB codes with parameters [[ 2n^2, 2, n ]], [[ 4r^2, 2, 2r ]], and [[(2t + 1)^2 + 1, 2, 2t + 1 ]]. These families match the performance of Kitaev's toric code and the best 2D weight-4 surface codes, reaching known theoretical limits. In particular, the second family breaks a long-held belief by providing optimal even-distance GB codes, previously deemed impossible. All are CSS codes derived from Cayley graphs. Recognizing that standard equivalence relations do not preserve their CSS structure, we introduce a CSS-preserving equivalence relation for rigorous comparison of Cayley graph-based CSS codes. Under this framework, the first two families are inequivalent to all previously known optimal weight-4 2D surface codes, while the third family is equivalent to the best-known odd-distance 2D surface code. Finally, we classify all extremal, non-equivalent (2,2)-GB codes with length below 200 and present a comparison table with existing notable 2D weight-4 surface codes.
In information geometry, statistical models are considered as differentiable manifolds, where each probability distribution represents a unique point on the manifold. A Riemannian metric can be systematically obtained from a divergence function using Eguchi's theory (1992); the well-known Fisher-Rao metric is obtained from the Kullback-Leibler (KL) divergence. The geometric derivation of the classical Cram\'er-Rao Lower Bound (CRLB) by Amari and Nagaoka (2000) is based on this metric. In this paper, we study a Riemannian metric obtained by applying Eguchi's theory to the Basu-Harris-Hjort-Jones (BHHJ) divergence (1998) and derive a generalized Cram\'er-Rao bound using Amari-Nagaoka's approach. There are potential applications for this bound in robust estimation.
In the user-centric cell-free massive MIMO (UC-mMIMO) network scheme, user mobility necessitates updating the set of serving access points to maintain the user-centric clustering. Such updates are typically performed through handoff (HO) operations; however, frequent HOs lead to overheads associated with the allocation and release of resources. This paper presents a deep reinforcement learning (DRL)-based solution to predict and manage these connections for mobile users. Our solution employs the Soft Actor-Critic algorithm, with continuous action space representation, to train a deep neural network to serve as the HO policy. We present a novel proposition for a reward function that integrates a HO penalty in order to balance the attainable rate and the associated overhead related to HOs. We develop two variants of our system; the first one uses mobility direction-assisted (DA) observations that are based on the user movement pattern, while the second one uses history-assisted (HA) observations that are based on the history of the large-scale fading (LSF). Simulation results show that our DRL-based continuous action space approach is more scalable than discrete space counterpart, and that our derived HO policy automatically learns to gather HOs in specific time slots to minimize the overhead of initiating HOs. Our solution can also operate in real time with a response time less than 0.4 ms.
We prove a sharp bound between sampling numbers and entropy numbers in the uniform norm for general convex sets of bounded functions.
DNA data storage systems encode digital data into DNA strands, enabling dense and durable storage. Efficient data retrieval depends on coverage depth, a key performance metric. We study the random access coverage depth problem and focus on minimizing the expected number of reads needed to recover information strands encoded via a linear code. We compute the asymptotic performance of a recently proposed code construction, establishing and refining a conjecture in the field by giving two independent proofs. We also analyze a geometric code construction based on balanced quasi-arcs and optimize its parameters. Finally, we investigate the full distribution of the random variables that arise in the coverage depth problem, of which the traditionally studied expectation is just the first moment. This allows us to distinguish between code constructions that, at first glance, may appear to behave identically.
At present, state-of-the-art forecasting models are short of the ability to capture spatio-temporal dependency and synthesize global information at the stage of learning. To address this issue, in this paper, through the adaptive fuzzified construction of temporal data, we propose a novel convolutional architecture with partially asymmetric design based on the scheme of sliding window to realize accurate time series forecasting. First, the construction strategy of traditional fuzzy time series is improved to further extract short and long term temporal interrelation, which enables every time node to automatically possess corresponding global information and inner relationships among them in a restricted sliding window and the process does not require human involvement. Second, a bilateral Atrous algorithm is devised to reduce calculation demand of the proposed model without sacrificing global characteristics of elements. And it also allows the model to avoid processing redundant information. Third, after the transformation of time series, a partially asymmetric convolutional architecture is designed to more flexibly mine data features by filters in different directions on feature maps, which gives the convolutional neural network (CNN) the ability to construct sub-windows within existing sliding windows to model at a more fine-grained level. And after obtaining the time series information at different levels, the multi-scale features from different sub-windows will be sent to the corresponding network layer for time series information fusion. Compared with other competitive modern models, the proposed method achieves state-of-the-art results on most of popular time series datasets, which is fully verified by the experimental results.
The coverage depth problem in DNA data storage is about minimizing the expected number of reads until all data is recovered. When they exist, MDS codes offer the best performance in this context. This paper focuses on the scenario where the base field is not large enough to allow the existence of MDS codes. We investigate the performance for the coverage depth problem of codes defined over a small finite field, providing closed formulas for the expected number of reads for various code families. We also compare the results with the theoretical bounds in asymptotic regimes. The techniques we apply range from probability, to duality theory and combinatorics.
Artstein-Avidan and Milman [Annals of mathematics (2009), (169):661-674] characterized invertible reverse-ordering transforms on the space of lower-semi-continuous extended real-valued convex functions as affine deformations of the ordinary Legendre transform. In this note, we prove that all those generalized Legendre transforms on functions correspond to the ordinary Legendre transform on dually corresponding affine-deformed functions. That is, generalized convex conjugates are convex conjugates of affine-deformed functions. We conclude this note by sketching how this result can be interpreted from the lens of information geometry.
Maximum distance separable (MDS) codes are considered optimal because the minimum distance cannot be improved for a given length and code size. The most prominent MDS codes are likely the generalized Reed-Solomon (GRS) codes. In 1989, Roth and Lempel constructed a type of MDS code that is not a GRS code (referred to as non-GRS). In 2017, Beelen et al. introduced twisted Reed-Solomon (TRS) codes and demonstrated that many MDS TRS codes are indeed non-GRS. Following this, the definition of TRS codes was generalized to the most comprehensive form, which we refer to as generalized twisted Reed-Solomon (GTRS) codes. In this paper, we prove that two families of GTRS codes are non-GRS and provide a systematic generator matrix for a class of GTRS codes. Inspired by the form of the systematic generator matrix for GTRS codes,we also present a construction of non-GRS MDS codes.
Wireless communication can be simply subjected to malicious attacks due to its open nature and shared medium. Detecting jamming attacks is the first and necessary step to adopt the anti-jamming strategies. This paper presents novel cooperative jamming detection methods that use the low-rank structure of the received signal matrix. We employed the likelihood ratio test to propose detectors for various scenarios. We regarded several scenarios with different numbers of friendly and jamming nodes and different levels of available statistical information on noise. We also provided an analytical examination of the false alarm performance of one of the proposed detectors, which can be used to adjust the detection threshold. We discussed the synthetic signal generation and the Monte Carlo (MC)-based threshold setting method, where knowledge of the distribution of the jamming-free signal, as well as several parameters such as noise variance and channel state information (CSI), is required to accurately generate synthetic signals for threshold estimation. Extensive simulations reveal that the proposed detectors outperform several existing methods, offering robust and accurate jamming detection in a collaborative network of sensing nodes.