Results 41 to 50 of about 42,043 (174)

On the Limit of Fountain MDC Codes for Video Peer-To-Peer Networks [PDF]

open access: yes, 2012
Video streaming for heterogeneous types of devices, where nodes have different devices characteristics in terms of computational capacity and display, is usually handled by encoding the video with different qualities.
Boreli, Roksana   +4 more
core   +2 more sources

Triangular code: Near-optimal linear time fountain code

open access: yesDigital Communications and Networks, 2023
In this paper, we propose Triangular Code (TC), a new class of fountain code with near-zero redundancy and linear encoding and decoding computational complexities of O(Lklogk), where k is the packet batch size and L is the packet data length. Different from previous works where the optimal performance of codes has been shown under asymptotic assumption,
Jalaluddin Qureshi, Chuan Heng Foh
openaire   +2 more sources

Unequal Error Protected JPEG 2000 Broadcast Scheme with Progressive Fountain Codes

open access: yes, 2012
This paper proposes a novel scheme, based on progressive fountain codes, for broadcasting JPEG 2000 multimedia. In such a broadcast scheme, progressive resolution levels of images/video have been unequally protected when transmitted using the proposed ...
Chen, Zhao   +3 more
core   +1 more source

Opportunistic Error Correction for WLAN Applications [PDF]

open access: yes, 2008
The current error correction layer of IEEE 802.11a WLAN is designed\ud for worst case scenarios, which often do not apply. In this paper,\ud we propose a new opportunistic error correction layer based on\ud Fountain codes and a resolution adaptive ADC ...
Schiphorst, Roel   +2 more
core   +3 more sources

Low-delay dynamic routing using fountain codes [PDF]

open access: yesIEEE Communications Letters, 2009
This paper considers augmenting current maximum throughput routing algorithms to use fountain coding at senders. We demonstrate that this joint routing/coding approach is able to achieve significantly improved delay performance.
Badarla, Venkataramana   +2 more
openaire   +2 more sources

Optimal payload lengths of reliable multicast schemes

open access: yesTongxin xuebao, 2011
Using total transmission time-the time needed to guarantee reliable data dissemination——as judgment criterion,the payload length selection problem was investigated for three multicast solutions which are based on simple feedback retransmission,Reed ...
ZHU Feng1, WU Ling-shuang2, GU Yuan-tao1
doaj   +2 more sources

Fountain Codes with Nonuniform Selection Distributions through Feedback

open access: yes, 2015
One key requirement for fountain (rateless) coding schemes is to achieve a high intermediate symbol recovery rate. Recent coding schemes have incorporated the use of a feedback channel to improve intermediate performance of traditional rateless codes ...
Cassuto, Yuval   +2 more
core   +1 more source

QoE Optimization of Video Multicast with Heterogeneous Channels and Playback Requirements [PDF]

open access: yes, 2015
We propose an application-layer forward error correction (AL-FEC) code rate allocation scheme to maximize the quality of experience (QoE) of a video multicast. The allocation dynamically assigns multicast clients to the quality layers of a scalable video
Bakhshali, Ali   +3 more
core   +2 more sources

An Optimal Tree-Structured Repair Scheme of Multiple Failure Nodes for Distributed Storage Systems

open access: yesIEEE Access, 2021
To reduce recovery cost of repairing multiple failed nodes, many repair schemes have been proposed for erasure codes based distributed storage systems. However, most of the existing researches ignore the network topology of storage devices.
Anan Zhou   +3 more
doaj   +1 more source

On encoding symbol degrees of array BP-XOR codes [PDF]

open access: yes, 2016
Low density parity check (LDPC) codes, LT codes and digital fountain techniques have received significant attention from both academics and industry in the past few years.
A Lubotzky   +26 more
core   +1 more source

Home - About - Disclaimer - Privacy