English
Related papers

Related papers: Information Bounds and Flatness Factor Approximati…

200 papers

In wiretap model of secure communication the goal is to provide (asymptotic) perfect secrecy and reliable communication over a noisy channel that is eavesdropped by an adversary with unlimited computational power. This goal is achieved by…

Cryptography and Security · Computer Science 2014-09-05 Pengwei Wang , Reihaneh Safavi-Naini

Due to the sheer complexity of the Laser Interferometer Space Antenna (LISA) space mission, data gaps arising from instrumental irregularities and/or scheduled maintenance are unavoidable. Focusing on merger-dominated massive black hole…

General Relativity and Quantum Cosmology · Physics 2025-03-07 Ollie Burke , Sylvain Marsat , Jonathan R. Gair , Michael L. Katz

Unreliable fading wireless channels are the main challenge for strict performance guarantees in mobile communications. Diversity schemes including massive number of antennas, huge spectrum bands and multi-connectivity links are applied to…

Information Theory · Computer Science 2020-09-21 Karl-Ludwig Besser , Eduard A. Jorswieck

The theta series of a lattice is a power series that characterizes the number of lattice vectors at certain norms. It is closely related to a critical quantity widely used in physical layer security and cryptography, known as the flatness…

Metric Geometry · Mathematics 2025-09-05 Maiara F. Bollauf , Hsuan-Yin Lin

We propose a simple yet complete lattice-based scheme for secret key generation from Gaussian sources in the presence of an eavesdropper, and show that it achieves strong secret key rates up to 1/2 nat from the optimal in the case of…

Information Theory · Computer Science 2013-06-25 Cong Ling , Laura Luzzi , Matthieu R. Bloch

Strong secrecy capacity of compound wiretap channels is studied. The known lower bounds for the secrecy capacity of compound finite-state memoryless channels under discrete alphabets are extended to arbitrary uncertainty sets and continuous…

Information Theory · Computer Science 2015-09-09 Rafael F. Schaefer , Sergey Loyka

In this paper, we present nontrivial upper and lower bounds on the secrecy capacity of the degraded Gaussian diamond-wiretap channel and identify several ranges of channel parameters where these bounds coincide with useful intuitions.…

Information Theory · Computer Science 2015-04-23 Si-Hyeon Lee , Ashish Khisti

We present a novel closed-form lower bound on the Gaussian-input mutual information for noncoherent communication (i.e., in which neither transmitter nor receiver are cognizant of the fading state) over a frequency-flat fading channel with…

Information Theory · Computer Science 2018-04-20 Adriano Pastore

In this work we study the reliability and secrecy performance achievable by practical LDPC codes over the Gaussian wiretap channel. While several works have already addressed this problem in asymptotic conditions, i.e., under the hypothesis…

Information Theory · Computer Science 2016-11-18 Marco Baldi , Giacomo Ricciutelli , Nicola Maturo , Franco Chiaraluce

Fundamental capacity limits are studied for the two-user wireless ergodic fading IC with partial Channel State Information at the Transmitters (CSIT) where each transmitter is equipped with an arbitrary deterministic function of the channel…

Information Theory · Computer Science 2013-02-15 Reza K. Farsani

Recent results have shown that lattice codes can be used to construct good channel codes, source codes and physical layer network codes for Gaussian channels. On the other hand, for Gaussian channels with secrecy constraints, efforts to…

Information Theory · Computer Science 2009-05-19 Xiang He , Aylin Yener

We study the information rates of non-coherent, stationary, Gaussian, multiple-input multiple-output (MIMO) flat-fading channels that are achievable with nearest neighbor decoding and pilot-aided channel estimation. In particular, we…

Information Theory · Computer Science 2014-04-09 A. Taufiq Asyhari , Tobias Koch , Albert Guillén i Fàbregas

This paper presents a secrecy performance study of a wiretap communication system with finite blocklength (FBL) transmissions over Rayleigh fading channels, based on the definition of an average information leakage (AIL) metric. We evaluate…

Information Theory · Computer Science 2024-01-23 Milad Tatar Mamaghani , Xiangyun Zhou , Nan Yang , A. Lee Swindlehurst , H. Vincent Poor

We study the amount of randomness needed for an input process to approximate a given output distribution of a channel in the $E_{\gamma}$ distance. A general one-shot achievability bound for the precision of such an approximation is…

Information Theory · Computer Science 2015-12-01 Jingbo Liu , Paul Cuff , Sergio Verdú

This paper examines the impact of emerging fluid antenna systems (FAS) on reconfigurable intelligent surface (RIS)-aided secure communications. Specifically, we consider a classic wiretap channel, where a fixed-antenna transmitter sends…

Information Theory · Computer Science 2024-08-28 Farshad Rostami Ghadi , Kai-Kit Wong , Masoud Kaveh , F. Javier Lopez-Martinez , Wee Kiat New , Hao Xu

In this paper, a lower bound on the capacity of wireless ad hoc erasure networks is derived in closed form in the canonical case where $n$ nodes are uniformly and independently distributed in the unit area square. The bound holds almost…

Information Theory · Computer Science 2009-01-15 Rayyan G. Jaber , Jeffrey G. Andrews

We consider the multi-antenna wiretap channel in which the transmitter wishes to send a confidential message to its receiver while keeping it secret to the eavesdropper. It has been known that the secrecy capacity of such a channel does not…

Information Theory · Computer Science 2016-11-17 Mari Kobayashi , Pablo Piantanida , Sheng Yang , Shlomo Shamai

This letter considers a fluid antenna system (FAS)-aided secure and covert communication system, where the transmitter adjusts multiple fluid antennas' positions to achieve secure and covert transmission under the threat of an eavesdropper…

Signal Processing · Electrical Eng. & Systems 2024-11-15 Junteng Yao , Liangxiao Xin , Tuo Wu , Ming Jin , Kai-Kit Wong , Chau Yuen , Hyundong Shin

Information leakage in Wyner's wiretap channel model is usually defined as the mutual information between the secret message and the eavesdropper's received signal. We define a new quantity called "conditional information leakage given the…

Information Theory · Computer Science 2019-01-28 Yutaka Jitsumatsu , Ukyo Michiwaki , Yasutada Oohama

To enhance the national security, there is a growing need for government agencies to legitimately monitor suspicious communication links for preventing intended crimes and terror attacks. In this paper, we propose a new wireless information…

Information Theory · Computer Science 2017-02-07 Jie Xu , Lingjie Duan , Rui Zhang
‹ Prev 1 3 4 5 6 7 10 Next ›