Results 21 to 30 of about 523,662 (284)
Exact Decoding Probability Under Random Linear Network Coding [PDF]
IEEE Communications Letters, 2011 In this letter, we compute the exact probability that a receiver obtains N linearly independent packets among K ≥ N received packets, when the sender/s use/s random linear network coding over a Galois Field of size q. Such condition maps to the receiver's capability to decode the original information, and its mathematical characterization helps to ...
Trullols Cruces, Óscar +2 more
openaire +4 more sources
URLLC with Coded Massive MIMO via Random Linear Codes and GRAND
2022 IEEE 96th Vehicular Technology Conference (VTC2022-Fall), 2022 A present challenge in wireless communications is the assurance of ultra-reliable and low-latency communication (URLLC). While the reliability aspect is well known to be improved by channel coding with long codewords, this usually implies using interleavers, which introduce undesirable delay.
Allahkaram, Sahar +2 more
openaire +3 more sources
Weighted BATS Codes with LDPC Precoding
Entropy, 2023 Batched Sparse (BATS) codes are a type of network coding scheme that use a combination of random linear network coding (RLNC) and fountain coding to enhance the reliability and efficiency of data transmission. In order to achieve unequal error protection
Wenyue Zhang, Min Zhu
doaj +1 more source
Spinal code based on lightweight hash function [PDF]
Archives of Electrical Engineering, 2019 A spinal code is the type of rateless code, which has been proved to be capacity- achieving over both a binary symmetric channel (BSC) and an additive white Gaussian noise (AWGN) channel. Rateless spinal codes employ a hash function as a coding kernel to
Lina Wang, Xinran Li
doaj +1 more source
A Hypergraph Filtering Based Iterative Decoding Approach for Linear Channel Codes
IEEE Access, 2021 Efficient decoding for general linear channel codes has been a long standing problem. Message passing type algorithms can achieve near-optimal performance for channel codes with sparse check matrices and long code-lengths, but they may suffer from ...
Jiaqi He +4 more
doaj +1 more source
On conjugacy classes of subgroups of the general linear group and cyclic orbit codes [PDF]
, 2011 Orbit codes are a family of codes employable for communications on a random linear network coding channel. The paper focuses on the classification of these codes.
Manganiello, Felice +2 more
core +1 more source
Minimal header overhead for random linear network coding [PDF]
2015 IEEE International Conference on Communication Workshop (ICCW), 2015 The energy used to transmit a single bit of data between the devices in wireless networks is equal to the energy for performing hundreds of instructions in those devices. Thus the reduction of the data necessary to transmit, while keeping the same functionality of the employed algorithms is a formidable and challenging scientific task.
Gligoroski, Danilo +2 more
openaire +2 more sources
On the Non-Adaptive Zero-Error Capacity of the Discrete Memoryless Two-Way Channel
Entropy, 2021 We study the problem of communicating over a discrete memoryless two-way channel using non-adaptive schemes, under a zero probability of error criterion.
Yujie Gu, Ofer Shayevitz
doaj +1 more source
Low Complexity Encoding for Network Codes [PDF]
, 2006 In this paper we consider the per-node run-time complexity of network multicast codes. We show that the randomized algebraic network code design algorithms described extensively in the literature result in codes that on average require a number of ...
Cassuto, Yuval +2 more
core +3 more sources
Structured Random Linear Codes (SRLC): Bridging the Gap between Block and Convolutional Codes [PDF]
, 2014 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 simple yet ...
Asaeda, Hitoshi +2 more
core +3 more sources