English
Related papers

Related papers: Structured Random Linear Codes (SRLC): Bridging th…

200 papers

Function-Correcting Codes (FCCs) are a novel class of codes designed to protect function evaluations of messages against errors while minimizing redundancy. A theoretical framework for systematic FCCs to channels matched to the Lee metric…

Information Theory · Computer Science 2026-04-29 Hareesh K. , Rashid Ummer N. T. , B. Sundar Rajan

Locally repairable codes (LRCs) are a class of codes designed for the local correction of erasures. They have received considerable attention in recent years due to their applications in distributed storage. Most existing results on LRCs do…

Information Theory · Computer Science 2015-11-24 Pengfei Huang , Eitan Yaakobi , Hironori Uchikawa , Paul H. Siegel

The arbitrarily varying channel (AVC) is a channel model whose state is selected maliciously by an adversary. Fixed-blocklength coding assumes a worst-case bound on the adversary's capabilities, which leads to pessimistic results. This…

Information Theory · Computer Science 2009-10-06 Anand D. Sarwate , Michael Gastpar

We analyze the trade-off between the undetected error probability (i.e., the probability that the channel decoder outputs an erroneous message without detecting the error) and the total error probability in the short blocklength regime. We…

Information Theory · Computer Science 2025-03-05 Alexander Sauter , A. Oguz Kislal , Giuseppe Durisi , Gianluigi Liva , Balazs Matuz , Erik G. Ström

The problem of error control in random linear network coding is addressed from a matrix perspective that is closely related to the subspace perspective of K\"otter and Kschischang. A large class of constant-dimension subspace codes is…

Information Theory · Computer Science 2019-05-07 Danilo Silva , Frank R. Kschischang , Ralf Kötter

In this work, we consider adaptive linear programming (ALP) decoding of linear codes over the finite field $\mathbb{F}_p$ of size $p$ where $p$ is a prime. In particular, we provide a general construction of valid inequalities for the…

Information Theory · Computer Science 2019-11-20 Eirik Rosnes , Michael Helmling

We consider the problem of joint source-channel coding for semantic communication from a rateless perspective, the purpose of which is to settle the balance between reliability (distortion/perception) and effectiveness (rate) of…

Information Retrieval · Computer Science 2025-01-23 Cheng Peng , Rulong Wang , Yong Xiao

Forward Error Correction (FEC) is used ubiquitously in the communication pipeline. We explore noncooperative decoding where we aim to recover the code rate of a linear block code. We present a metric to characterize the quality of the code…

Information Theory · Computer Science 2026-03-03 Atreya Vedantam , Radha Krishna Ganti

In this paper, we aim to explore the stochastic performance limit of large-field-size Random Linear Streaming Codes (RLSCs) in multi-hop relay networks. In our model, a source transmits a sequence of streaming messages to a destination…

Information Theory · Computer Science 2025-12-18 Kai Huang , Xinyu Xie , Chunpeng Chen , Wenjie Guan , Xiaoran Wang , Jinbei Zhang

In this paper, we propose new coupled codes constructed by overlapping circular spatially-coupled low-density parity-check (SC-LDPC) codes, which show better asymptotic and finite-length decoding performance compared to the conventional…

Information Theory · Computer Science 2018-03-28 Heeyoul Kwak , Bohwan Jun , Pilwoong Yang , Jong-Seon No , Dong-Joon Shin

Sparse random linear network coding (SRLNC) used as a class of erasure codes to ensure the reliability of multicast communications has been widely investigated. However, an exact expression for the decoding success probability of SRLNC is…

Information Theory · Computer Science 2021-08-27 WenLin Chen , Fang Lu , Yan Dong

A code is called a locally repairable code (LRC) if any code symbol is a function of a small fraction of other code symbols. When a locally repairable code is employed in a distributed storage systems, an erased symbol can be recovered by…

Information Theory · Computer Science 2021-11-25 Wei Zhao , Kenneth W. Shum , Shenghao Yang

In this paper, we propose an efficient reliability based segmentation-discarding decoding (SDD) algorithm for short block-length codes. A novel segmentation-discarding technique is proposed along with the stopping rule to significantly…

Information Theory · Computer Science 2019-01-23 Chentao Yue , Mahyar Shirvanimoghaddam , Yonghui Li , Branka Vucetic

As the mobile application landscape expands, wireless networks are tasked with supporting various connection profiles, including real-time communications and delay-sensitive traffic. Among many ensuing engineering challenges is the need to…

Information Theory · Computer Science 2012-02-13 Fatemeh Hamidi-Sepehr , Jean-Francois Chamberland , Henry Pfister

Data centres that use consumer-grade disks drives and distributed peer-to-peer systems are unreliable environments to archive data without enough redundancy. Most redundancy schemes are not completely effective for providing high…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-10-09 Vero Estrada-Galiñanes , Ethan Miller , Pascal Felber , Jehan-François Pâris

In various wireless systems, such as sensor RFID networks and body area networks with implantable devices, the transmitted signals are simultaneously used both for information transmission and for energy transfer. In order to satisfy the…

Information Theory · Computer Science 2016-11-18 Ali Mohammad Fouladgar , Osvaldo Simeone , Elza Erkip

Future networks are expected to support various ultra-reliable low-latency communications via wireless links. To avoid the loss of packets and keep the low latency, sliding network coding (SNC) is an emerging technology by generating…

Information Theory · Computer Science 2022-04-26 Fangzhou Wu , Zhiyuan Tan , Huiying Zhu , Pengpeng Dong

As sensing and instrumentation play an increasingly important role in systems controlled over wired and wireless networks, the need to better understand delay-sensitive communication becomes a prime issue. Along these lines, this article…

Information Theory · Computer Science 2021-03-26 Anoosheh Heidarzadeh , Jean-Francois Chamberland , Parimal Parag , Richard D. Wesel

We consider a single-source, multiple-relay, single-destination lossy network employing Random Linear Network coding at all transmitting nodes. We address the problem of calculating the probability of successful decoding at the destination…

Information Theory · Computer Science 2019-04-12 Evgeny Tsimbalo , Magnus Sandell

Convolutional network-error correcting codes (CNECCs) are known to provide error correcting capability in acyclic instantaneous networks within the network coding paradigm under small field size conditions. In this work, we investigate the…

Information Theory · Computer Science 2010-01-08 K. Prasad , B. Sundar Rajan