Results 61 to 70 of about 2,319 (194)
Raptor codes are known as precoded rateless codes that achieve the capacity of BEC. However the maximum degree of Raptor codes needs to be unbounded to achieve the capacity.
Kasai, Kenta +2 more
core +1 more source
Distributed Rateless Codes with Unequal Error Protection Property for Space Information Networks
In this paper, we propose a novel distributed unequal error protection (UEP) rateless coding scheme (DURC) for space information networks (SIN). We consider the multimedia data transmissions in a dual-hop SIN communication scenario, where multiple ...
Jian Jiao +5 more
doaj +1 more source
Intermediate Performance of Rateless Codes [PDF]
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
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
Growth Codes: Intermediate Performance Analysis and Application to Video [PDF]
Growth codes are a subclass of Rateless codes that have found interesting applications in data dissemination problems. Compared to other Rateless and conventional channel codes, Growth codes show improved intermediate performance which is particularly ...
Frossard, Pascal +2 more
core +1 more source
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
Rateless Codes with Progressive Recovery for Layered Multimedia Delivery
This paper proposes a novel approach, based on unequal error protection, to enhance rateless codes with progressive recovery for layered multimedia delivery. With a parallel encoding structure, the proposed Progressive Rateless codes (PRC) assign unequal
Chen, Zhao +3 more
core +1 more source
Dynamic control of Coding in Delay Tolerant Networks [PDF]
Delay tolerant Networks (DTNs) leverage the mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are out of range of each other.
Altman, Eitan +2 more
core +8 more sources
Augmented LT codes over binary extension fields with increased ratio of full‐degree columns
An augmented scheme of LT codes is proposed to improve the decoding success rate. The method involves substituting the 1 in full‐degree columns of the generator matrix of conventional LT codes with binary extension field elements and simultaneously increasing the ratio of full‐degree columns in the ideal soliton distribution, which allows for higher ...
Changyue Jiang +3 more
wiley +1 more source
In this paper, a novel framework to enhance the reliability of wireless sensor networks (WSNs) by addressing the high probability of outage (OP) resulting from limited energy resources and unreliable channels.
The-Anh Ngo +3 more
doaj +1 more source

