• Aucun résultat trouvé

Unequal Erasure Protection

Dependency-aware unequal erasure protection codes

Dependency-aware unequal erasure protection codes

... Classical unequal erasure protection schemes split the data to be protected into classes which are encoded inde- ...The unequal protection scheme presented in this document is based on ...

7

Unequal Erasure Protection and Object Bundle Protection with the Generalized Object Encoding Approach

Unequal Erasure Protection and Object Bundle Protection with the Generalized Object Encoding Approach

... Providing Unequal Erasure Protection When a data ow contains information of dierent priority levels, it is natural to try to oer an unequal protection where high priority data ...

29

Memory Consumption Analysis for the GOE and PET Unequal Erasure Protection Schemes

Memory Consumption Analysis for the GOE and PET Unequal Erasure Protection Schemes

... NTRODUCTION Unequal Erasure Protection (UEP) is an attractive approach to protect data flows that contain information of different priority ...

7

Cross-layer optimization of unequal protected layered video over hierarchical modulation

Cross-layer optimization of unequal protected layered video over hierarchical modulation

... to unequal protection at PHY and APP, we also consider erasure codes at the Transport layer, which allows recovering lost packets thanks to redundant ...more protection to specific parts of ...

7

On-the-fly erasure coding for real-time video applications

On-the-fly erasure coding for real-time video applications

... In the presence of VBR sources as video, this behavior is furthermore confirmed as FEC schemes lack adaptability compared to Tetrys. Indeed, recovering from a given number of losses means waiting for the reception of (at ...

16

Hecke algebras with unequal parameters and Vogan's left cell invariants

Hecke algebras with unequal parameters and Vogan's left cell invariants

... Abstract. In 1979, Vogan introduced a generalised τ -invariant for charac- terising primitive ideals in enveloping algebras. Via a known dictionary this translates to an invariant of left cells in the sense of Kazhdan ...

16

Polynomial Ring Transforms for Efficient XOR-based Erasure Coding

Polynomial Ring Transforms for Efficient XOR-based Erasure Coding

... The measured parameters are: • average field matrix: average number of 1 in the GC matrices divided by k.m.w • best field matrix: lowest number of 1 among the GC matrices divided by k.m.w [r] ...

6

Fault-tolerant distributed computing scheme based on erasure codes

Fault-tolerant distributed computing scheme based on erasure codes

... ABSTRACT. Some emerging classes of distributed computing systems, such peer-to-peer or grid computing computing systems, are composed of heterogeneous computing resources potentially unreliable. This paper proposes to ...

6

Secrecy Capacity-Memory Tradeoff of Erasure Broadcast Channels

Secrecy Capacity-Memory Tradeoff of Erasure Broadcast Channels

... In this paper, we follow the secrecy requirement in [6] where an external eavesdropper is not allowed to learn anything about all the files in the library, but here delivery communication takes place over an ...

32

The Mojette Erasure Code for Distributed File Systems

The Mojette Erasure Code for Distributed File Systems

... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ...

3

Spatial Implementation for Erasure Coding by Finite Radon Transform

Spatial Implementation for Erasure Coding by Finite Radon Transform

... Internet. Erasure coding aims at recovering information that has been lost during a transmission ...strategy, erasure coding differs by adding redundancy to recover lost information without the need to ...

5

PYRIT: Polynomial Ring Transforms for Fast Erasure Coding

PYRIT: Polynomial Ring Transforms for Fast Erasure Coding

... 1 + x + x We propose three methods to make the correspondence between a field and a ring: • Embedding: just consider a field element as a ring element • Parity: add a parity bit • Sparse[r] ...

4

Enabling Data Processing under Erasure Coding in the Fog

Enabling Data Processing under Erasure Coding in the Fog

... [5] Intel Intelligent Storage Acceleration Library (ISA-L) https://software.intel.com/en-us/storage/ISA-L [6] Apache Hadoop, 2019, Available online http://hadoop.apache.org [7] K. V. Rashmi, M. Chowdhury, J. Kosaian, et ...

2

Decentralized joint cache-channel coding over erasure broadcast channels

Decentralized joint cache-channel coding over erasure broadcast channels

... the eavesdropper is assumed to be weaker than all legitimate receivers. So its erasure probability δz satisfies 0 < δs ≤ δw ≤ δz ≤ 1. (9) Communication needs to be kept secret from the eavesdropper in the ...

7

Acknowledgement design for collision-recovery-enabled wireless erasure networks

Acknowledgement design for collision-recovery-enabled wireless erasure networks

... wireless erasure network, we show that the senders’ queues behave as if the transmissions are controlled by a centralized scheduler which has access to channel state realizations at the beginning of each time ...

9

Contribution to the optimization of Unequal Area Rectangular Facility Layout Problem

Contribution to the optimization of Unequal Area Rectangular Facility Layout Problem

... Application of the gradient based local search algorithm and evolutionary algorithms based hybrid method on some test problems shows that the proposed methodology [r] ...

167

Collision Helps - Algebraic Collision Recovery for Wireless Erasure Networks

Collision Helps - Algebraic Collision Recovery for Wireless Erasure Networks

... In every slot, a sender can broadcast a packet to its neigh- bors. Owing to the fading nature of the wireless channel, not all packet transmissions result in a successful reception at every neighbor. Each link between ...

7

Coding and scheduling optimization over packet erasure broadcast channels

Coding and scheduling optimization over packet erasure broadcast channels

... 2-3 Adaptive linear network coding based transmission model: For the packet flow f, the transmitter (Tx) maintains a coding bucket Gf, whose size is adaptively determined b[r] ...

97

Unequal Ageing in Europe Women’s Independence and Pensions

Unequal Ageing in Europe Women’s Independence and Pensions

... recently by Jefferson (2009), can generate a number of hypotheses that can be used to explain observed differences in gender balance in pensions: (1) gaps in coverage in systems linkin[r] ...

177

Unequal Uncertainties and Uncertain Inequalities: An Axiomatic Approach

Unequal Uncertainties and Uncertain Inequalities: An Axiomatic Approach

... However, the procedure suggested by Ben Porath, Gilboa and Schmeidler (1997) is not the only possible evaluation principle that takes into account both ex ante and ex post inequalities..[r] ...

30

Show all 1768 documents...

Sujets connexes