English
Related papers

Related papers: Information Rates and Error Exponents for Probabil…

200 papers

In this work we explore possibilities for coding when information worlds have different (semantic) values. We introduce a loss function that expresses the overall performance of a coding scheme for discrete channels and exchange the usual…

Information Theory · Computer Science 2015-03-19 Marcelo Firer , Luciano Panek , Laura Rifo

We present a novel autoencoder-based learning of joint geometric and probabilistic constellation shaping for coded-modulation systems. It can maximize either the mutual information (for symbol-metric decoding) or the generalized mutual…

Information Theory · Computer Science 2021-12-10 Vahid Aref , Mathieu Chagnon

Consider communication over the binary erasure channel BEC using random low-density parity-check codes with finite-blocklength n from `standard' ensembles. We show that large error events is conveniently described within a scaling theory,…

Information Theory · Computer Science 2007-07-13 Abdelaziz Amraoui , Andrea Montanari , Tom Richardson , Rudiger Urbanke

For the information transmission over a binary symmetric channel the random coding is used. The transmission of exponential number of messages is considered. The exact decoding error probability exponent is derived. The proof is based on…

Information Theory · Computer Science 2026-05-20 Marat V. Burnashev

In most error correction coding (ECC) frameworks, the typical error metric is the bit error rate (BER) which measures the number of bit errors. For this metric, the positions of the bits are not relevant to the decoding, and in many noise…

Signal Processing · Electrical Eng. & Systems 2021-10-11 Chai Wah Wu

Probabilistic constellation shaping enables easy rate adaption and has been proven to reduce the gap to Shannon capacity. Constellation point probabilities are optimized to maximize either the mutual information or the bit-wise mutual…

Information Theory · Computer Science 2025-06-23 Shrinivas Chimmalgi , Laurent Schmalen , Vahid Aref

The Pinching-Antenna SyStem (PASS) is a revolutionary flexible antenna technology designed to enhance wireless communication by establishing strong line-of-sight (LoS) links, reducing free-space path loss and enabling antenna array…

Information Theory · Computer Science 2025-06-13 Zhaolin Wang , Chongjun Ouyang , Xidong Mu , Yuanwei Liu , Zhiguo Ding

In the Shannon lecture at the 2019 International Symposium on Information Theory (ISIT), Ar{\i}kan proposed to employ a one-to-one convolutional transform as a pre-coding step before the polar transform. The resulting codes of this…

Information Theory · Computer Science 2024-01-19 Mohammad Rowshan , Andreas Burg , Emanuele Viterbo

The FEC limit paradigm is the prevalent practice for designing optical communication systems to attain a certain bit-error rate (BER) without forward error correction (FEC). This practice assumes that there is an FEC code that will reduce…

Information Theory · Computer Science 2024-01-25 Alex Alvarado , Erik Agrell , Domanic Lavery , Robert Maher , Polina Bayvel

Quantum error correction (QEC) enables reliable computation on noisy hardware by encoding logical information across many physical qubits and periodically measuring parities to detect errors. A decoder is the classical algorithm that uses…

Programming Languages · Computer Science 2026-03-23 Abtin Molavi , Feras Saad , Aws Albarghouthi

Probabilistic Component Latent Analysis (PLCA) is a statistical modeling method for feature extraction from non-negative data. It has been fruitfully applied to various research fields of information retrieval. However, the EM-solved…

Methodology · Statistics 2017-03-16 D. Cazau , G. Nuel

Polarization-adjusted convolutional (PAC) codes are special concatenated codes in which we employ a one-to-one convolutional transform as a precoding step before the polar transform. In this scheme, the polar transform (as a mapper) and the…

Information Theory · Computer Science 2021-03-24 Mohammad Rowshan , Emanuele Viterbo

The problem of computing a linear combination of sources over a multiple access channel is studied. Inner and outer bounds on the optimal tradeoff between the communication rates are established when encoding is restricted to random…

Information Theory · Computer Science 2018-10-30 Pinar Sen , Sung Hoon Lim , Young-Han Kim

In this paper, we propose an iterative source error correction (ISEC) decoding scheme for deep-learning-based joint source-channel coding (Deep JSCC). Given a noisy codeword received through the channel, we use a Deep JSCC encoder and…

Machine Learning · Computer Science 2023-02-21 Changwoo Lee , Xiao Hu , Hun-Seok Kim

Exponential error bounds for the finite-alphabet interference channel (IFC) with two transmitter-receiver pairs, are investigated under the random coding regime. Our focus is on optimum decoding, as opposed to heuristic decoding rules that…

Information Theory · Computer Science 2008-10-14 Raul Etkin , Neri Merhav , Erik Ordentlich

Free-space optical (FSO) transmission enables fast, secure, and efficient next-generation communications with abundant spectrum resources. However, atmospheric turbulence, pointing errors, path loss, and atmospheric loss induce random…

Signal Processing · Electrical Eng. & Systems 2025-11-25 Jingtian Liu , Xiongwei Yang , Yi Wei , Jianjun Yu , Feng Zhao

Image Phase Alignment Super-sampling (ImPASS) is a computational method for combining displaced low-resolution images into a single high-resolution image. The general steps include measuring the relative displacements, up-sampling, aligning…

Optics · Physics 2026-01-09 James N. Caron

This paper presents an innovative approach to mitigating the peak-to-average power ratio (PAPR). The proposed method uses a deep learning model called autoencoders (AEs) to simplify the process and avoid the complex calculations of…

Signal Processing · Electrical Eng. & Systems 2025-03-03 Omar Alnaseri , Ibtesam R. K. Al-Saedi , Yassine Himeur , Hongxiang Li

We consider an ensemble of constant composition codes that are subsets of linear codes: while the encoder uses only the constant-composition subcode, the decoder operates as if the full linear code was used, with the motivation of…

Information Theory · Computer Science 2022-06-22 Neri Merhav , Georg Bocherer

This paper presents a new supervised representation learning framework, namely structured probabilistic coding (SPC), to learn compact and informative representations from input related to the target task. SPC is an encoder-only…

Computation and Language · Computer Science 2024-05-03 Dou Hu , Lingwei Wei , Yaxin Liu , Wei Zhou , Songlin Hu