Results 11 to 20 of about 546,736 (277)
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 +6 more sources
Reliability of Multicast Under Random Linear Network Coding [PDF]
IEEE Transactions on Communications, 2018 To appear on IEEE Transactions on ...
Evgeny Tsimbalo +2 more
openaire +6 more sources
Fulcrum Rateless Multicast Distributed Coding Design
IEEE Access, 2023 Establishing reliable and efficient multicast services in heterogeneous networks under an erasure channel is one of the current priorities in coding theory, particularly in Network Coding (NC) over data networks.
Yair Rivera Julio +2 more
doaj +1 more source
Efficient Communications in V2V Networks with Two-Way Lanes Based on Random Linear Network Coding
Entropy, 2023 Vehicle-to-vehicle (V2V) communication has gained significant attention in the field of intelligent transportation systems. In this paper, we focus on communication scenarios involving vehicles moving in the same and opposite directions. Specifically, we
Yiqian Zhang, Tiantian Zhu, Congduan Li
doaj +1 more source
Random Shortening of Linear Codes and Applications
, 2023 Random linear codes (RLCs) are well known to have nice combinatorial properties and near-optimal parameters in many different settings. However, getting explicit constructions matching the parameters of RLCs is challenging, and RLCs are hard to decode efficiently.
Chen, Xue +3 more
openaire +2 more sources
A Shannon-Theoretic Approach to the Storage–Retrieval Trade-Off in PIR Systems
Information, 2023 We consider the storage–retrieval rate trade-off in private information retrieval (PIR) systems using a Shannon-theoretic approach. Our focus is mostly on the canonical two-message two-database case, for which a coding scheme based on random codebook ...
Chao Tian, Hua Sun, Jun Chen
doaj +1 more source
Design and Analysis of Systematic Batched Network Codes
Entropy, 2023 Systematic codes are of important practical interest for communications. Network coding, however, seems to conflict with systematic codes: although the source node can transmit message packets, network coding at the intermediate network nodes may ...
Licheng Mao +3 more
doaj +1 more source
On the list-decodability of random linear codes [PDF]
Proceedings of the forty-second ACM symposium on Theory of computing, 2010 The list-decodability of random linear codes is shown to be as good as that of general random codes. Specifically, for every fixed finite field Fq, p ∈ (0,1 - 1/q) and ε >; 0, it is proved that with high probability a random linear code C in Fqn of rate (1-Hq(p)-ε) can be list decoded from a fraction p of errors with lists of size at most O(1/ε ...
Venkatesan Guruswami +2 more
openaire +3 more sources
Scalable Network Coding for Heterogeneous Devices over Embedded Fields
Entropy, 2022 In complex network environments, there always exist heterogeneous devices with different computational powers. In this work, we propose a novel scalable random linear network coding (RLNC) framework based on embedded fields, so as to endow heterogeneous ...
Hanqi Tang +4 more
doaj +1 more source
Index Coded Automatic Repeat Request (ARQ)
Entropy, 2020 In this paper, an index-coded Automatic Repeat Request (ARQ) is studied in the perspectives of transmission efficiency and memory overhead. Motivated by reducing significant computational complexity from huge matrix inverse computation of random linear ...
Sang Won Choi
doaj +1 more source