Results 31 to 40 of about 4,215 (309)
Hierarchical erasure correction of linear codes [PDF]
Finite Fields and Their Applications, 2020 Linear codes over finite extension fields have widespread applications in theory and practice. In some scenarios, the decoder has a sequential access to the codeword symbols, giving rise to a hierarchical erasure structure. In this paper we develop a mathematical framework for hierarchical erasures over extension fields, provide several bounds and ...
Netanel Raviv +3 more
openaire +3 more sources
Expanding window fountain codes for unequal error protection [PDF]
, 2007 A novel approach to provide unequal error protection (UEP) using rateless codes over erasure channels, named Expanding Window Fountain (EWF) codes, is developed and discussed.
Vukobratovic, D +11 more
core +1 more source
Secure Network Coding With Erasures and Feedback [PDF]
IEEE Transactions on Information Theory, 2013 Secure network coding assumes that the underlying network links are lossless, thus it can be applied over lossy networks after channel error correction. Yet it is well known that channel losses, such as packet erasures, can be constructively used for secrecy over a link.
Laszlo Czap +3 more
openaire +2 more sources
Memory and Complexity Analysis of On-the-Fly Coding Schemes for Multimedia Multicast Communications [PDF]
, 2012 A new class of erasure codes for delay-constraint applications, called on-the-fly coding, have recently been introduced for their improvements in terms of recovery delay and achievable capacity.
Emmanuel Lochin +7 more
core +1 more source
VLSI Architectures for Reed–Solomon Codes: Classic, Nested, Coupled, and Beyond
IEEE Open Journal of Circuits and Systems, 2020 Classic Reed-Solomon (RS) codes and binary Bose-Chaudhuri-Hocquenghem (BCH) codes, which can be considered as a special case of RS codes, are utilized for error correction in numerous systems, such as Flash memories, optical communications, wireless ...
Xinmiao Zhang
doaj +1 more source
Codes for erasures over directed graphs [PDF]
2017 IEEE Information Theory Workshop (ITW), 2017 5 pages, ITW 2017 ...
Lev Yohananov, Eitan Yaakobi
openaire +2 more sources
Systematic Luby Transform Codes and their Soft Decoding [PDF]
, 2007 Luby Transform codes (LT) were originally designed for the Binary Erasure Channel (BEC) encountered owing to randomly dropped packets in the statistical multiplexing aided classic wireline-based Internet, where transmitted packets are not affected by the
T. D. Nguyen +5 more
core +1 more source
Content-access QoS in peer-to-peer networks using a fast MDS erasure code [PDF]
, 2005 This paper describes an enhancement of content access Quality of Service in peer to peer (P2P) networks. The main idea is to use an erasure code to distribute the information over the peers.
Laurent Lancérica +7 more
core +1 more source
Low-cost Multi-node Failure Repair Method for Erasure Codes [PDF]
Jisuanji gongcheng, 2017 Current erasure code repair methods have problems such as high expenses and low efficiency.Aiming at these problems,this paper brings forward a multi-node failure repair method with low cost.By means of network distance based node choosing method ...
ZHENG Liming,LI Xiaodong
doaj +1 more source
Erasure codes with simplex locality
CoRR, 2014 submitted in December 2013 to Mathematical Theory of Networks and Systems (MTNS) International Symposium ...
Margreta Kuijper, Diego Napp
openaire +2 more sources