Results 21 to 30 of about 42,043 (174)
Performance statistics of broadcasting networks with receiver diversity and Fountain codes
Journal of Information and Telecommunication, 2023 The performance of broadcasting networks employing Fountain codes with receiver diversity techniques is investigated in the present work. Particularly, we derive the closed-form expressions of the cumulative distribution function (CDF), the probability ...
Lam-Thanh Tu +4 more
doaj +1 more source
Fountain codes with varying probability distributions [PDF]
2010 6th International Symposium on Turbo Codes & Iterative Information Processing, 2010 5 pages, 1 figure. Changes, including a different simulation example in Section IV, are made to improve clarity. Theory remains unchanged. Resubmitted to the 6th International Symposium on Turbo Codes & Iterative Information Processing (ISTC 2010).
Chong, Kai Fong Ernest +3 more
openaire +2 more sources
Fountain Coding with Decoder Side Information [PDF]
2008 IEEE International Conference on Communications, 2008 In this contribution, we consider the application of digital fountain (DF) codes to the problem of data transmission when side information is available at the decoder. The side information is modelled as a "virtual" channel output when original information sequence is the input.
Sejdinovic, D +3 more
openaire +4 more sources
Efficient learning-driven data transmission algorithm for cloud-to-thing continuum
Journal of King Saud University: Computer and Information Sciences, 2023 In the cloud-to-thing continuum paradigm, the efficient transmission of learning-driven data is critical for facilitating real-time decision-making and continuous learning processes. Fountain codes have gained popularity as Forward Error Correction (FEC)
Haibo Yi
doaj +1 more source
Design of Anti-Eavesdropping Scheme for SLT-LT Codes Based on Random Symbol Sets
IEEE Access, 2022 In recent years, physical layer security technology has provided a new way to solve the problem of secure transmissions in wireless communications from an information theory perspective by using physical layer security coding and the inherent ...
Si Zhang +3 more
doaj +1 more source
Adaptive Classification Fountain Codes for Reentry Communication
IEEE Access, 2019 Radio blackout due to a plasma sheath during reentry has attracted much attention over several decades. However, radio blackout has long puzzled the aerospace industry and has not yet been completely resolved.
Haojie Zhang +4 more
doaj +1 more source
Fountain Communication using Concatenated Codes [PDF]
IEEE Transactions on Communications, 2013 This paper extends linear-complexity concatenated coding schemes to fountain communication over the discrete-time memoryless channel. Achievable fountain error exponents for one-level and multi-level concatenated fountain codes are derived. It is also shown that concatenated coding schemes possess interesting properties in several multi-user fountain ...
Wang, Zheng, Luo, Jie
openaire +2 more sources
Opportunistic Fountain Coding With Coordinative Routing [PDF]
IEEE Wireless Communications Letters, 2022 Fountain codes are widely employed to improve reliability and efficiency in wireless communication systems due to their simple coding mechanisms. In this letter, we propose an opportunistic decoding and recoding mechanism with coordinative routing algorithm for fountain codes to improve the expected transmission counts (ETX) performance and to reduce ...
Tong Peng +3 more
openaire +2 more sources
Improved online fountain codes
IET Communications, 2018 Online fountain codes have been proven to require lower overhead and fewer feedbacks than growth codes for successful decoding. In an attempt to improve the intermediate symbol recovery rate, the authors propose sending a number of degree‐1 input symbols prior to the build‐up phase based on a simple application of probability theory.
Yuli Zhao +4 more
openaire +1 more source
Fountain Codes Over GF(q) [PDF]
Wireless Communications and Mobile Computing, 2011 ABSTRACTBinary fountain codes such as Luby transform codes are a class of erasure codes which have demonstrated an asymptotic performance close to the Shannon limit when decoded with the belief propagation algorithm. When these codes are generalized toGF(q) forq > 2, their performance approaches the Shannon limit much faster than the usual binary ...
Xiangming Li, Tao Jiang
openaire +1 more source