Results 71 to 80 of about 2,036 (196)
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
Whether and Where to Code in the Wireless Relay Channel
The throughput benefits of random linear network codes have been studied extensively for wirelined and wireless erasure networks. It is often assumed that all nodes within a network perform coding operations.
Lucani, Daniel E. +2 more
core +1 more source
Throughput of Rateless Codes Over Broadcast Erasure Channels [PDF]
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov modulated erasure channel that is i.i.d. across users, but can be correlated in time. We characterize the system throughput asymptotically in n.
Yang, Yang, Shroff, Ness B.
openaire +3 more sources
HARQ‐Chaotic: Analog Chaotic Code Applied in HARQ Scheme of Wireless Communication System
This paper proposes a novel symbol‐level combining hybrid automatic repeat request (HARQ) scheme based on analog chaotic code and named HARQ‐Chaotic. The transmitter of HARQ‐Chaotic adopts analog chaotic code to encode Quadrature Amplitude Modulation (QAM) symbols of retransmission packets to combat fading and noise. As the analog chaotic code can only
Wei Yu +6 more
wiley +1 more source
Performance and time improvement of LT code-based cloud storage
Outsourcing data on cloud storage services has already attracted great attention due to the prospect of rapid data growth and storing efficiencies for customers.
Nastaran Chakani +2 more
doaj +1 more source
Near-Capacity Adaptive Analog Fountain Codes for Wireless Channels
In this paper, we propose a capacity-approaching analog fountain code (AFC) for wireless channels. In AFC, the number of generated coded symbols is potentially limitless.
Li, Yonghui +2 more
core +1 more source
Timely Updates over an Erasure Channel [PDF]
Using an age of information (AoI) metric, we examine the transmission of coded updates through a binary erasure channel to a monitor/receiver. We start by deriving the average status update age of an infinite incremental redundancy (IIR) system in which ...
Najm, Elie +3 more
core +2 more sources
An Efficient Rateless Scheme Based on the Extendibility of Systematic Polar Codes
In this paper, a new rateless scheme based on the extendibility of systematic polar codes is proposed, which is applicable for the scenario without channel state information (CSI).
Bowen Feng, Qinyu Zhang, Jian Jiao
doaj +1 more source
Research of LT Code Based on Key Information Feedback in Deep Space Communication
CCSDS LDPC code cannot effectively solve the problems of communication interruptions and high communication error rates in deep space communication. An application scheme of digital fountain code for deep space communication is thoroughly studied in this
Hai Tian +3 more
doaj +1 more source
Efficient Symbol Sorting for High Intermediate Recovery Rate of LT Codes
LT codes are modern and efficient rateless forward error correction (FEC) codes with close to channel capacity performance. Nevertheless, in intermediate range where the number of received encoded symbols is less than the number of source symbols, LT ...
Rahnavard, Nazanin +2 more
core +1 more source

