arXiv daily

Information Theory (cs.IT)

Wed, 31 May 2023

Other arXiv digests in this category:Thu, 14 Sep 2023; Wed, 13 Sep 2023; Tue, 12 Sep 2023; Mon, 11 Sep 2023; Fri, 08 Sep 2023; Tue, 05 Sep 2023; Fri, 01 Sep 2023; Thu, 31 Aug 2023; Wed, 30 Aug 2023; Tue, 29 Aug 2023; Mon, 28 Aug 2023; Fri, 25 Aug 2023; Thu, 24 Aug 2023; Wed, 23 Aug 2023; Tue, 22 Aug 2023; Mon, 21 Aug 2023; Fri, 18 Aug 2023; Thu, 17 Aug 2023; Wed, 16 Aug 2023; Tue, 15 Aug 2023; Mon, 14 Aug 2023; Fri, 11 Aug 2023; Thu, 10 Aug 2023; Wed, 09 Aug 2023; Tue, 08 Aug 2023; Mon, 07 Aug 2023; Fri, 04 Aug 2023; Thu, 03 Aug 2023; Wed, 02 Aug 2023; Tue, 01 Aug 2023; Mon, 31 Jul 2023; Fri, 28 Jul 2023; Thu, 27 Jul 2023; Wed, 26 Jul 2023; Tue, 25 Jul 2023; Mon, 24 Jul 2023; Fri, 21 Jul 2023; Thu, 20 Jul 2023; Wed, 19 Jul 2023; Tue, 18 Jul 2023; Mon, 17 Jul 2023; Fri, 14 Jul 2023; Thu, 13 Jul 2023; Wed, 12 Jul 2023; Tue, 11 Jul 2023; Mon, 10 Jul 2023; Fri, 07 Jul 2023; Thu, 06 Jul 2023; Wed, 05 Jul 2023; Tue, 04 Jul 2023; Mon, 03 Jul 2023; Fri, 30 Jun 2023; Thu, 29 Jun 2023; Wed, 28 Jun 2023; Tue, 27 Jun 2023; Mon, 26 Jun 2023; Fri, 23 Jun 2023; Thu, 22 Jun 2023; Wed, 21 Jun 2023; Tue, 20 Jun 2023; Fri, 16 Jun 2023; Thu, 15 Jun 2023; Tue, 13 Jun 2023; Mon, 12 Jun 2023; Fri, 09 Jun 2023; Thu, 08 Jun 2023; Wed, 07 Jun 2023; Tue, 06 Jun 2023; Mon, 05 Jun 2023; Fri, 02 Jun 2023; Thu, 01 Jun 2023; Tue, 30 May 2023; Mon, 29 May 2023; Fri, 26 May 2023; Thu, 25 May 2023; Wed, 24 May 2023; Tue, 23 May 2023; Mon, 22 May 2023; Fri, 19 May 2023; Thu, 18 May 2023; Wed, 17 May 2023; Tue, 16 May 2023; Mon, 15 May 2023; Fri, 12 May 2023; Thu, 11 May 2023; Wed, 10 May 2023; Tue, 09 May 2023; Mon, 08 May 2023; Fri, 05 May 2023; Thu, 04 May 2023; Wed, 03 May 2023; Tue, 02 May 2023; Mon, 01 May 2023; Fri, 28 Apr 2023; Thu, 27 Apr 2023; Wed, 26 Apr 2023; Tue, 25 Apr 2023; Mon, 24 Apr 2023; Fri, 21 Apr 2023; Thu, 20 Apr 2023; Wed, 19 Apr 2023; Tue, 18 Apr 2023; Mon, 17 Apr 2023; Fri, 14 Apr 2023; Thu, 13 Apr 2023; Wed, 12 Apr 2023; Mon, 10 Apr 2023
1.A new generalization of Reed-Solomon codes

Authors:Chunlei Liu

Abstract: A new generalization of Reed-Solomon codes is given. Like Goppa codes, our codes also approach to the Gilbert bound. Nevertheless, decoding these new codes does not require us to know the roots of the minimal polynomial of the syndromes.

2.Confidential Signal Cancellation Phenomenon in Interference Alignment Networks: Cause and Cure

Authors:Lin Hu, Jiabing Fan, Hong Wen, Jie Tang, Qianbin Chen

Abstract: This paper investigates physical layer security (PLS) in wireless interference networks. Specifically, we consider confidential transmission from a legitimate transmitter (Alice) to a legitimate receiver (Bob), in the presence of non-colluding passive eavesdroppers (Eves), as well as multiple legitimate transceivers. To mitigate interference at legitimate receivers and enhance PLS, artificial noise (AN) aided interference alignment (IA) is explored. However, the conventional leakage minimization (LM) based IA may exhibit confidential signal cancellation phenomenon. We theoretically analyze the cause and then establish a condition under which this phenomenon will occur almost surely. Moreover, we propose a means of avoiding this phenomenon by integrating the max-eigenmode beamforming (MEB) into the traditional LM based IA. By assuming that only statistical channel state informations (CSIs) of Eves and local CSIs of legitimate users are available, we derive a closed form expression for the secrecy outage probability (SOP), and establish a condition under which positive secrecy rate is achievable. To enhance security performance, an SOP constrained secrecy rate maximization (SRM) problem is formulated and an efficient numerical method is developed for the optimal solution. Numerical results confirm the effectiveness and the usefulness of the proposed approach.

3.An Efficient Machine Learning-based Channel Prediction Technique for OFDM Sub-Bands

Authors:Pedro E. G. Silva, Jules M. Moualeu, Pedro H. Nardelli, Rausley A. A. de Souza

Abstract: The acquisition of accurate channel state information (CSI) is of utmost importance since it provides performance improvement of wireless communication systems. However, acquiring accurate CSI, which can be done through channel estimation or channel prediction, is an intricate task due to the complexity of the time-varying and frequency selectivity of the wireless environment. To this end, we propose an efficient machine learning (ML)-based technique for channel prediction in orthogonal frequency-division multiplexing (OFDM) sub-bands. The novelty of the proposed approach lies in the training of channel fading samples used to estimate future channel behaviour in selective fading.

4.Semantic-Functional Communications in Cyber-Physical Systems

Authors:Pedro E. Goria Silva, Pedro H. J. Nardelli, Arthur S. de Sena, Harun Siljak, Niko Nevaranta, Nicola Marchetti, Rausley A. A. de Souza

Abstract: This paper explores the use of semantic knowledge inherent in the cyber-physical system (CPS) under study in order to minimize the use of explicit communication, which refers to the use of physical radio resources to transmit potentially informative data. It is assumed that the acquired data have a function in the system, usually related to its state estimation, which may trigger control actions. We propose that a semantic-functional approach can leverage the semantic-enabled implicit communication while guaranteeing that the system maintains functionality under the required performance. We illustrate the potential of this proposal through simulations of a swarm of drones jointly performing remote sensing in a given area. Our numerical results demonstrate that the proposed method offers the best design option regarding the ability to accomplish a previously established task -- remote sensing in the addressed case -- while minimising the use of radio resources by controlling the trade-offs that jointly determine the CPS performance and its effectiveness in the use of resources. In this sense, we establish a fundamental relationship between energy, communication, and functionality considering a given end application.

5.Low-Complexity Dynamic Directional Modulation: Vulnerability and Information Leakage

Authors:Pedro E. Gória Silva, Adam Narbudowicz, Nicola Marchetti, Pedro H. J. Nardelli, Rausley A. A. de Souza, Jules M. Moualeu

Abstract: In this paper, the privacy of wireless transmissions is improved through the use of an efficient technique termed dynamic directional modulation (DDM), and is subsequently assessed in terms of the measure of information leakage. Recently, a variation of DDM termed low-power dynamic directional modulation (LPDDM) has attracted significant attention as a prominent secure transmission method due to its ability to further improve the privacy of wireless communications. Roughly speaking, this modulation operates by randomly selecting the transmitting antenna from an antenna array whose radiation pattern is well known. Thereafter, the modulator adjusts the constellation phase so as to ensure that only the legitimate receiver recovers the information. To begin with, we highlight some privacy boundaries inherent to the underlying system. In addition, we propose features that the antenna array must meet in order to increase the privacy of a wireless communication system. Last, we adopt a uniform circular monopole antenna array with equiprobable transmitting antennas in order to assess the impact of DDM on the information leakage. It is shown that the bit error rate, while being a useful metric in the evaluation of wireless communication systems, does not provide the full information about the vulnerability of the underlying system.

6.Pareto Frontier for the Performance-Complexity Trade-off in Beyond Diagonal Reconfigurable Intelligent Surfaces

Authors:Matteo Nerini, Bruno Clerckx

Abstract: Reconfigurable intelligent surface (RIS) is an emerging technology allowing to control the propagation environment in wireless communications. Recently, beyond diagonal RIS (BD-RIS) has been proposed to reach higher performance than conventional RIS, at the expense of higher circuit complexity. Multiple BD-RIS architectures have been developed with the goal of reaching a favorable trade-off between performance and circuit complexity. However, the fundamental limits of this trade-off are still unexplored. In this paper, we fill this gap by deriving the expression of the Pareto frontier for the performance-complexity trade-off in BD-RIS. Additionally, we characterize the optimal BD-RIS architectures reaching this Pareto frontier.

7.On the Capacity of Secure $K$-user Product Computation over a Quantum MAC

Authors:Yuxiang Lu, Yuhang Yao, Syed A. Jafar

Abstract: Inspired by a recent study by Christensen and Popovski on secure $2$-user product computation for finite-fields of prime-order over a quantum multiple access channel (QMAC), the generalization to $K$ users and arbitrary finite fields is explored. Combining ideas of batch-processing, quantum $2$-sum protocol, a secure computation scheme of Feige, Killian and Naor (FKN), a field-group isomorphism and additive secret sharing, asymptotically optimal (capacity-achieving for large alphabet) schemes are proposed for secure $K$-user (any $K$) product computation over any finite field. The capacity of modulo-$d$ ($d\geq 2$) secure $K$-sum computation over the QMAC is found to be $2/K$ computations/qudit as a byproduct of the analysis.