Abstract—We propose a family of systematic rateless codes that are universally capacity-approaching on a binary erasure channel (BEC) regardless of the channel erasure rate. A significant property of the proposed codes is their linear encoding and decoding complexity, which is considerably lower than existing alternatives. Index Terms—Systematic LT codes, Raptor codes. I
In this paper, we introduce new sequences (λn, ρnλ) of capacity achieving low-density parity-check (...
Codes that are capable of generating any number of encoded symbols from a given number of source sym...
As the most advanced rateless fountain codes, Systematic Raptor codes has been adopted by the 3GPP s...
Abstract — We introduce a family of rateless codes, namely the doped accumulate LT (DALT) codes, tha...
Abstract-We propose a family of binary erasure codes, namely, quasi-systematic doped LT (QS-DLT) cod...
Abstract—LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-...
We investigate a systematic construction of binary deterministic rateless codes (BDRCs). The codes a...
Abstract—This paper is concerned with a simple binary erasure-recovery coding scheme that falls into...
This paper presents a novel framework, which enables a design of rateless codes for binary input add...
LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-tolerant ...
This paper proposes a concept called rateless feedback coding. We redesign the existing LT and Rapto...
LT codes are asymptotically optimal rateless erasure codes with highly ecient encoding and decoding...
Based on recent results on the performance of LT codes under inactivation decoding, we show how to d...
Abstract—This paper presents a concept called rateless feed-back coding. We redesign the existing ra...
Abstract — A rateless code—i.e., a rate-compatible family of codes—has the property that codewords o...
In this paper, we introduce new sequences (λn, ρnλ) of capacity achieving low-density parity-check (...
Codes that are capable of generating any number of encoded symbols from a given number of source sym...
As the most advanced rateless fountain codes, Systematic Raptor codes has been adopted by the 3GPP s...
Abstract — We introduce a family of rateless codes, namely the doped accumulate LT (DALT) codes, tha...
Abstract-We propose a family of binary erasure codes, namely, quasi-systematic doped LT (QS-DLT) cod...
Abstract—LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-...
We investigate a systematic construction of binary deterministic rateless codes (BDRCs). The codes a...
Abstract—This paper is concerned with a simple binary erasure-recovery coding scheme that falls into...
This paper presents a novel framework, which enables a design of rateless codes for binary input add...
LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-tolerant ...
This paper proposes a concept called rateless feedback coding. We redesign the existing LT and Rapto...
LT codes are asymptotically optimal rateless erasure codes with highly ecient encoding and decoding...
Based on recent results on the performance of LT codes under inactivation decoding, we show how to d...
Abstract—This paper presents a concept called rateless feed-back coding. We redesign the existing ra...
Abstract — A rateless code—i.e., a rate-compatible family of codes—has the property that codewords o...
In this paper, we introduce new sequences (λn, ρnλ) of capacity achieving low-density parity-check (...
Codes that are capable of generating any number of encoded symbols from a given number of source sym...
As the most advanced rateless fountain codes, Systematic Raptor codes has been adopted by the 3GPP s...
DOI
Add to ORKG