English
Related papers

Related papers: Efficient Symbol Sorting for High Intermediate Rec…

200 papers

Locally Decodable Codes (LDCs) are error correcting codes that admit efficient decoding of individual message symbols without decoding the entire message. Unfortunately, known LDC constructions offer a sub-optimal trade-off between rate,…

Information Theory · Computer Science 2025-06-18 Jeremiah Blocki , Justin Zhang

In random-access networks, such as the IEEE 802.11 network, different users may transmit their packets simultaneously, resulting in packet collisions. Traditionally, the collided packets are simply discarded. To improve performance,…

Information Theory · Computer Science 2010-09-22 Lu Lu , Soung Chang Liew , Shengli Zhang

Integrate-and-fire time encoding machines (IF-TEMs) provide an efficient framework for asynchronous sampling of bandlimited signals through discrete firing times. However, conventional IF-TEMs often exhibit excessive oversampling, leading…

Signal Processing · Electrical Eng. & Systems 2025-11-13 Anshu Arora , Kaluguri Yashaswini , Satish Mulleti

We initiate a study of locally decodable codes with randomized encoding. Standard locally decodable codes are error correcting codes with a deterministic encoding function and a randomized decoding function, such that any desired message…

Information Theory · Computer Science 2020-01-14 Kuan Cheng , Xin Li , Yu Zheng

Polar codes are a class of linear block codes that provably achieves channel capacity, and have been selected as a coding scheme for $5^{\rm th}$ generation wireless communication standards. Successive-cancellation (SC) decoding of polar…

Information Theory · Computer Science 2018-09-28 Carlo Condo , Furkan Ercan , Warren J. Gross

In this paper, we propose a physical-layer rateless code for wireless channels. A novel rateless encoding scheme is developed to overcome the high error floor problem caused by the low-density generator matrix (LDGM)-like encoding scheme in…

Information Theory · Computer Science 2013-06-25 Shuang Tian , Yonghui Li , Mahyar Shirvanimoghaddam , Branka Vucetic

We consider data transmission over a network where each edge is an erasure channel and where the inner nodes transmit a random linear combination of their incoming information. We distinguish two channel models in this setting, the row and…

Information Theory · Computer Science 2017-10-18 Heide Gluesing-Luerssen , Anna-Lena Horlemann-Trautmann

This paper analyzes the design and competitiveness of four neural network (NN) architectures recently proposed as decoders for forward error correction (FEC) codes. We first consider the so-called single-label neural network (SLNN) and the…

Signal Processing · Electrical Eng. & Systems 2026-01-28 Yuncheng Yuan , Péter Scheepers , Lydia Tasiou , Yunus Can Gültekin , Federico Corradi , Alex Alvarado

In this paper, we propose a low-complexity method to approximately solve the SINR-constrained optimization problem of symbol-level precoding (SLP). First, assuming a generic modulation scheme, the precoding optimization problem is recast as…

Signal Processing · Electrical Eng. & Systems 2019-03-11 Alireza Haqiqatnejad , Farbod Kayhan , Bjorn Ottersten

Surface codes are among the best candidates to ensure the fault-tolerance of a quantum computer. In order to avoid the accumulation of errors during a computation, it is crucial to have at our disposal a fast decoding algorithm to quickly…

Quantum Physics · Physics 2020-07-15 Nicolas Delfosse , Gilles Zémor

Quantum error correcting codes (QECCs) are the means of choice whenever quantum systems suffer errors, e.g., due to imperfect devices, environments, or faulty channels. By now, a plethora of families of codes is known, but there is no…

Quantum Physics · Physics 2022-03-14 Benjamin Desef , Martin B. Plenio

Several types of AL-FEC (Application-Level FEC) codes for the Packet Erasure Channel exist. Random Linear Codes (RLC), where redundancy packets consist of random linear combinations of source packets over a certain finite field, are a…

Information Theory · Computer Science 2014-08-26 Kazuhisa Matsuzono , Vincent Roca , Hitoshi Asaeda

We propose (k,k') stabilizing codes, which is a type of delayless error correction codes that are useful for control over networks with erasures. For each input symbol, k output symbols are generated by the stabilizing code. Receiving any…

Information Theory · Computer Science 2022-01-17 Jan Østergaard

A new coding scheme for image transmission over noisy channel is proposed. Similar to standard image compression, the scheme includes a linear transform followed by successive refinement scalar quantization. Unlike conventional schemes, in…

Information Theory · Computer Science 2012-10-03 Ozgun Y. Bursalioglu , Giuseppe Caire , Dariush Divsalar

Recent learning-based lossless image compression methods encode an image in the unit of subimages and achieve comparable performances to conventional non-learning algorithms. However, these methods do not consider the performance drop in…

Image and Video Processing · Electrical Eng. & Systems 2021-12-14 Hochang Rhee , Yeong Il Jang , Seyun Kim , Nam Ik Cho

We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we consider can have a finite number of states, such as partial…

Information Theory · Computer Science 2016-11-17 Parastoo Sadeghi , Pascal O. Vontobel , Ramtin Shams

When neural networks (NeuralNets) are implemented in hardware, their weights need to be stored in memory devices. As noise accumulates in the stored weights, the NeuralNet's performance will degrade. This paper studies how to use error…

Information Theory · Computer Science 2020-01-14 Kunping Huang , Paul Siegel , Anxiao , Jiang

The emerging Learned Compression (LC) replaces the traditional codec modules with Deep Neural Networks (DNN), which are trained end-to-end for rate-distortion performance. This approach is considered as the future of image/video…

Image and Video Processing · Electrical Eng. & Systems 2024-07-08 Farhad Pakdaman , Moncef Gabbouj

Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern…

Information Theory · Computer Science 2015-12-25 Gabi Sarkis , Pascal Giard , Alexander Vardy , Claude Thibeault , Warren J. Gross

We demonstrate that error correcting codes (ECCs) can be used to construct a labeled data set for finetuning of "trainable" communication systems without sacrificing resources for the transmission of known symbols. This enables adaptive…

Information Theory · Computer Science 2018-07-03 Stefan Schibisch , Sebastian Cammerer , Sebastian Dörner , Jakob Hoydis , Stephan ten Brink