English
Related papers

Related papers: Secrecy Coding for the Binary Symmetric Wiretap Ch…

200 papers

We consider the problem of coded distributed computing where a large linear computational job, such as a matrix multiplication, is divided into $k$ smaller tasks, encoded using an $(n,k)$ linear code, and performed over $n$ distributed…

Information Theory · Computer Science 2021-10-06 Mahdi Soleymani , Mohammad Vahid Jamali , Hessam Mahdavifar

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 propose a computationally efficient multilevel coding scheme to achieve the capacity of an ISI channel using layers of binary inputs. The transmitter employs multilevel coding with linear mapping. The receiver uses multistage decoding…

Information Theory · Computer Science 2007-07-13 Mei Chen , Teng Li , Oliver M. Collins

We analyze Linear Programming (LP) decoding of graphical binary codes operating over soft-output, symmetric and log-concave channels. We show that the error-surface, separating domain of the correct decoding from domain of the erroneous…

Information Theory · Computer Science 2016-11-15 Michael Chertkov , Mikhail Stepanov

In this paper, we study the performance of finite-length LDPC codes in the waterfall region. We propose an algorithm to predict the error performance of finite-length LDPC codes over various binary memoryless channels. Through numerical…

Information Theory · Computer Science 2013-09-30 Md. Noor-A-Rahim , Khoa D. Nguyen , Gottfried Lechner

We examine the task of privacy amplification from information-theoretic and coding-theoretic points of view. In the former, we give a one-shot characterization of the optimal rate of privacy amplification against classical adversaries in…

Information Theory · Computer Science 2018-11-26 Joseph M. Renes

The adversarial wiretap channel (AWTC) model is a secure communication model in which adversary can directly read and write the transmitted bits in legitimate communication with fixed fractions. In this paper we propose a secure polar…

Information Theory · Computer Science 2021-01-01 Yizhi Zhao

We study variable-length feedback (VLF) codes over binary-input memoryless symmetric (BMS) channels using posterior matching with small-enough-difference (SED) partitioning. Prior analyses of SED-based schemes rely on bounded log-likelihood…

Information Theory · Computer Science 2026-04-06 Recep Can Yavas

This is a tale of two linear programming decoders, namely channel coding linear programming decoding (CC-LPD) and compressed sensing linear programming decoding (CS-LPD). So far, they have evolved quite independently. The aim of the present…

Information Theory · Computer Science 2009-10-08 Alexandros G. Dimakis , Pascal O. Vontobel

A polar coding scheme is proposed for the Wiretap Broadcast Channel with two legitimate receivers and one eavesdropper. We consider a model in which the transmitter wishes to send a private and a confidential message that must be reliably…

Information Theory · Computer Science 2019-02-19 Jaume del Olmo Alos , Javier R. Fonollosa

Network coding is an efficient means to improve the spectrum efficiency of satellite communications. However, its resilience to eavesdropping attacks is not well understood. This paper studies the confidentiality issue in a bidirectional…

Information Theory · Computer Science 2016-11-17 Ashkan Kalantari , Gan Zheng , Zhen Gao , Zhu Han , Björn Ottersten

We develop a low-complexity coding scheme to achieve covert communications over binary-input discrete memoryless channels (BI-DMCs). We circumvent the impossibility of covert communication with linear codes by introducing non-linearity…

Information Theory · Computer Science 2018-11-27 Ishaque Ashar Kadampot , Mehrdad Tahmasbi , Matthieu R Bloch

In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector…

Information Theory · Computer Science 2009-11-13 Tadashi Wadayama

Maintaining the pair similarity relationship among originally high-dimensional data into a low-dimensional binary space is a popular strategy to learn binary codes. One simiple and intutive method is to utilize two identical code matrices…

Information Retrieval · Computer Science 2018-11-28 Xiaoshuang Shi , Fuyong Xing , Zizhao Zhang , Manish Sapkota , Zhenhua Guo , Lin Yang

This paper focuses on the analysis and optimization of a class of linear one-bit precoding schemes for a downlink massive MIMO system under Rayleigh fading channels. The considered class of linear one-bit precoding is fairly general,…

Information Theory · Computer Science 2023-06-28 Zheyu Wu , Junjie Ma , Ya-Feng Liu , A. Lee Swindlehurst

In this paper, we investigate the secure coding issue for a wiretap channel model with fixed main channel and varying wiretap channel, by assuming that legitimate parties can obtain the wiretapping channel state information (CSI) after some…

Information Theory · Computer Science 2020-01-22 Yizhi Zhao , Hongmei Chi

We consider coding schemes for channels with non-uniform inputs (NUI), where standard linear block codes can not be applied directly. We show that multilevel coding (MLC) with a set of linear codes and a deterministic mapper can achieve the…

Information Theory · Computer Science 2007-07-13 Jing Jiang , Krishna R. Narayanan

In this work, the critical role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is established. Unlike previous works, where a noiseless public discussion channel is used for feedback, the feed-forward and…

Information Theory · Computer Science 2016-11-18 Lifeng Lai , Hesham El Gamal , H. Vincent Poor

In this paper, we consider encoding strategies for the Z-channel with noiseless feedback. We analyze the combinatorial setting where the maximum number of errors inflicted by an adversary is proportional to the number of transmissions,…

Information Theory · Computer Science 2021-02-11 Christian Deppe , Vladimir Lebedev , Georg Maringer , Nikita Polyanskii

We examine LDPC codes decoded using linear programming (LP). Four contributions to the LP framework are presented. First, a new method of tightening the LP relaxation, and thus improving the LP decoder, is proposed. Second, we present an…

Information Theory · Computer Science 2016-11-17 David Burshtein , Idan Goldenberg