English
Related papers

Related papers: Coding for Network-Coded Slotted ALOHA

200 papers

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

Matching algorithms can be used for identifying errors in quantum systems, being the most famous the Blossom algorithm. Recent works have shown that small distance quantum error correction codes can be efficiently decoded by employing…

Quantum Physics · Physics 2019-11-27 Savvas Varsamopoulos , Koen Bertels , Carmen G. Almudever

Quantum annealing (QA) has emerged as a promising candidate for fast solvers for combinatorial optimization problems (COPs) and has attracted the interest of many researchers. Since COP is logically encoded in the Ising interaction among…

Quantum Physics · Physics 2025-05-01 Yoshihiro Nambu

The interesting properties of classical Goppa code and its effective decoding algorithm (algorithm of patterson) make the most appropriate candidate for use in the MC Eliece cryptosystem. Information leakage which results from the…

Cryptography and Security · Computer Science 2014-03-11 Ahmed Drissi , Ahmed Asimi

We introduce a sliding window decoder based on belief propagation (BP) with guided decimation for the purposes of decoding quantum low-density parity-check codes in the presence of circuit-level noise. Windowed decoding keeps the decoding…

Quantum Physics · Physics 2024-03-29 Anqi Gong , Sebastian Cammerer , Joseph M. Renes

In this paper, we study a layered random access scheme based on non-orthogonal multiple access (NOMA) to improve the throughput of multichannel ALOHA. At a receiver, successive interference cancellation (SIC) is carried out across layers to…

Information Theory · Computer Science 2017-12-11 Jinho Choi

In ALOHA-type packetized network, the transmission times of packets follow a stochastic process. In this paper, we advocate a deterministic approach for channel multiple-access. Each user is statically assigned a periodic protocol signal,…

Information Theory · Computer Science 2009-09-29 Kenneth W. Shum , Chi Wan Sung

We consider the scenario of broadcasting for real-time applications and loss recovery via instantly decodable network coding. Past work focused on minimizing the completion delay, which is not the right objective for real-time applications…

Networking and Internet Architecture · Computer Science 2014-05-14 Anh Le , Arash S. Tehrani , Alexandros G. Dimakis , Athina Markopoulou

Batched sparse (BATS) codes were proposed as a reliable communication solution for networks with packet loss. In the finite-length regime, the error probability of BATS codes under belief propagation (BP) decoding has been studied in the…

Information Theory · Computer Science 2025-02-12 Mingyang Zhu , Shenghao Yang , Ming Jiang , Chunming Zhao

In this letter, we develop a converse bound on the asymptotic load threshold of coded slotted ALOHA (CSA) schemes with K-multi packet reception capabilities at the receiver. Density evolution is used to track the average probability of…

Information Theory · Computer Science 2017-10-13 Cedomir Stefanovic , Enrico Paolini , Gianluigi Liva

The training complexity of deep learning-based channel decoders scales exponentially with the codebook size and therefore with the number of information bits. Thus, neural network decoding (NND) is currently only feasible for very short…

Information Theory · Computer Science 2017-02-23 Sebastian Cammerer , Tobias Gruber , Jakob Hoydis , Stephan ten Brink

In recent years, coded distributed computing (CDC) has attracted significant attention, because it can efficiently facilitate many delay-sensitive computation tasks against unexpected latencies in distributed computing systems. Despite such…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-07-12 Baoqian Wang , Junfei Xie , Kejie Lu , Yan Wan , Shengli Fu

In decoding linear block codes, it was shown that noticeable reliability gains can be achieved by introducing learnable parameters to the Belief Propagation (BP) decoder. Despite the success of these methods, there are two key open…

Information Theory · Computer Science 2023-04-13 Sravan Kumar Ankireddy , Hyeji Kim

Monotone chain polar codes generalize classical polar codes to multivariate settings, offering a flexible approach for achieving the entire admissible rate region in the distributed lossless coding problem. However, this flexibility also…

Information Theory · Computer Science 2025-09-04 Zichang Ren , Chunhang Zheng , Dou Li , Yuping Zhao

Random access protocols relying on the transmission of packet replicas in multiple slots and exploiting interference cancellation at the receiver have been shown to achieve per- formance competitive with that of orthogonal schemes. So far…

Information Theory · Computer Science 2017-07-03 Federico Clazzer , Enrico Paolini , Iacopo Mambelli , Cedomir Stefanovic

A new class of folded subspace codes for noncoherent network coding is presented. The codes can correct insertions and deletions beyond the unique decoding radius for any code rate $R\in[0,1]$. An efficient interpolation-based decoding…

Information Theory · Computer Science 2015-04-22 Hannes Bartz , Vladimir Sidorenko

This paper investigates the fundamental building blocks of physical-layer network coding (PNC). Most prior work on PNC focused on its application in a simple two-way-relay channel (TWRC) consisting of three nodes only. Studies of the…

Networking and Internet Architecture · Computer Science 2014-05-23 Jianghao He , Soung-Chang Liew

In the current context of massive IoT, the Pure-Aloha scheme used in LoRaWAN is reaching its limit, and Slotted-Aloha is being considered as an alternative, as it offers twice Pure-Aloha's packet success rate. It however requires…

Networking and Internet Architecture · Computer Science 2024-05-24 Amavi Dossa , El Mehdi Amhoud

We give an algorithm for finding network encoding and decoding equations for error-free multicasting networks with multiple sources and sinks. The algorithm given is efficient (polynomial complexity) and works on any kind of network…

Information Theory · Computer Science 2007-07-13 Angela I. Barbero Diez , Oyvind Ytrehus

This work introduces a novel, fully differentiable linear-time complexity transformer decoder and a transformer decoder to correct 5G New Radio (NR) LDPC. We propose a scalable approach to decode linear block codes with $O(n)$ complexity…

Machine Learning · Computer Science 2025-01-27 Mario Hernandez , Fernando Pinero
‹ Prev 1 4 5 6 7 8 10 Next ›