Results 11 to 20 of about 624,831 (326)
Punctured Low-Bias Codes Behave Like Random Linear Codes [PDF]
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022 Random linear codes are a workhorse in coding theory, and are used to show the existence of codes with the best known or even near-optimal trade-offs in many noise models. However, they have little structure besides linearity, and are not amenable to tractable error-correction algorithms.
Venkatesan Guruswami, Jonathan Mosheiff
openaire +5 more sources
URLLC with Coded Massive MIMO via Random Linear Codes and GRAND [PDF]
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.
Sahar Allahkaram +2 more
openaire +4 more sources
The Random Coding Bound Is Tight for the Average Linear Code or Lattice [PDF]
IEEE Transactions on Information Theory, 2016 In 1973, Gallager proved that the random-coding bound is exponentially tight for the random code ensemble at all rates, even below expurgation. This result explained that the random-coding exponent does not achieve the expurgation exponent due to the properties of the random ensemble, irrespective of the utilized bounding technique.
Ram Zamir, Meir Feder
exaly +3 more sources
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.
Danilo Gligoroski +2 more
openaire +4 more sources
Practical Random Linear Network Coding on GPUs [PDF]
, 2009 Recently, random linear network coding has been widely applied in peer-to-peer network applications. Instead of sharing the raw data with each other, peers in the network produce and send encoded data to each other. As a result, the communication protocols have been greatly simplified, and the applications experience higher end-to-end throughput and ...
Xiaowen Chu 0001, Kaiyong Zhao, Mea Wang
openaire +3 more sources
Completion Delay of Random Linear Network Coding in Full-Duplex Relay Networks [PDF]
IEEE Transactions on Communications, 2022 As the next-generation wireless networks thrive, full-duplex and relay techniques are combined to improve the network performance. Random linear network coding (RLNC) is another popular technique to enhance the efficiency and reliability of wireless ...
Rina Su +3 more
semanticscholar +1 more source
Electronics, 2022 Considering the significance of an energy efficient, delay tolerant and reliable communication protocol for underwater acoustic wireless sensor network (UWSN), this paper proposes a novel systematic random linear network coding (SRLNC) based transmission
Pramodh Basavaraju +4 more
semanticscholar +1 more source
Squares of Random Linear Codes [PDF]
IEEE Transactions on Information Theory, 2015 Given a linear code $C$, one can define the $d$-th power of $C$ as the span of all componentwise products of $d$ elements of $C$. A power of $C$ may quickly fill the whole space. Our purpose is to answer the following question: does the square of a code "typically" fill the whole space?
I. Cascudo (Ignacio) +3 more
openaire +2 more sources
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 +4 more sources
IEEE Access, 2023 Tactile Internet (TI) has very stringent networking requirements and the transport layer plays a crucial role in meeting these requirements. However, the transport layer has several inherent limitations (e.g., bufferbloat, incast issue, and head of line ...
Shahzad +3 more
doaj +1 more source