Results 61 to 70 of about 2,036 (196)
Network Coding as Enabler for Achieving URLLC Under TCP and UDP Environments: A Survey
IEEE Access, 2023 In an era of rapidly evolving technology, the pursuit of higher data rates, extremely low latency, and robust reliability is becoming increasingly crucial.
Patrick Enenche, Dong Ho Kim, Dongho You
doaj +1 more source
Rateless-Coding-Assisted Multi-Packet Spreading over Mobile Networks
, 2014 A novel Rateless-coding-assisted Multi-Packet Relaying (RMPR) protocol is proposed for large-size data spreading in mobile wireless networks. With this lightweight and robust protocol, the packet redundancy is reduced by a factor of $\sqrt n$, while the ...
Dai, Huaiyu +2 more
core +1 more source
Rateless resilient network coding against byzantine adversaries [PDF]
2013 Proceedings IEEE INFOCOM, 2013 This paper considers rateless network error correction codes for reliable multicast in the presence of adversarial errors. Most existing network error correction codes are designed for a given network capacity and maximum number of errors known a priori to the encoder and decoder.
Huang, Wentao +3 more
openaire +3 more sources
Random Linear Network Coding for 5G Mobile Video Delivery [PDF]
, 2018 An exponential increase in mobile video delivery will continue with the demand for higher resolution, multi-view and large-scale multicast video services.
Delic, Savo +3 more
core +4 more sources
Random Access Channel Coding in the Finite Blocklength Regime [PDF]
, 2020 Consider a random access communication scenario over a channel whose operation is defined for any number of possible transmitters. Inspired by the model recently introduced by Polyanskiy for the Multiple Access Channel (MAC) with a fixed, known number of
Effros, Michelle +2 more
core +2 more sources
Intermediate Performance of Rateless Codes [PDF]
2007 IEEE Information Theory Workshop, 2007 Rateless/fountain codes are designed so that all input symbols can be recovered from a slightly larger number of coded symbols, with high probability using an iterative decoder. In this paper we investigate the number of input symbols that can be recovered by the same decoder, but when the number of coded symbols available is less than the total number
openaire +2 more sources
Online fountain code with an improved caching mechanism
IET Communications, Volume 18, Issue 20, Page 1813-1825, December 2024.By catching some selected encoded symbols discarded in the original online fountain codes and giving an optimal degree selection strategy of encoded symbols, the proposed online fountain code improves the receiving rules of the encoded symbols. The proposed online codes outperform the state‐of‐art online fountain codes in terms of overhead factors ...
Yin Zhang +7 more
wiley +1 more source
International Journal of Communication Systems, Volume 37, Issue 13, 10 September 2024.This paper undertakes a review and analysis of advanced channel coding techniques with the aim of their scalability towards B5G/6G networks scenario. A comparative study is presented for channel coding candidates of futuristic networks. Concatenated and derived codes of convolutional, polar, LDPC, Rateless, and Space‐time coding schemes are reviewed ...
Abhilasha Gautam +2 more
wiley +1 more source
Application Layer Systematic Network Coding for Sliced H.264/AVC Video Streaming
Advances in Multimedia, 2012 Application Layer Forward Error Correction (AL-FEC) with rateless codes can be applied to protect the video data over lossy channels. Expanding Window Random Linear Codes (EW RLCs) are a flexible unequal error protection fountain coding scheme which can ...
Sajid Nazir +3 more
doaj +1 more source
Infocast: A New Paradigm for Collaborative Content Distribution from Roadside Units to Vehicular Networks Using Rateless Codes [PDF]
, 2009 In this paper, we address the problem of distributing a large amount of bulk data to a sparse vehicular network from roadside infostations, using efficient vehicle-to-vehicle collaboration.
Fekri, Faramarz +2 more
core +1 more source