Informed content delivery across adaptive overlay networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Informed content delivery across adaptive overlay networks
IEEE/ACM Transactions on Networking (TON)
Dynamic spectrum utilization in ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Military communications systems and technologies
Using redundancy to cope with failures in a delay tolerant network
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Network coding for efficient communication in extreme networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
ACM SIGMETRICS Performance Evaluation Review - Special issue on the workshop on MAthematical performance Modeling And Analysis (MAMA 2005)
Lightweight, pollution-attack resistant multicast authentication scheme
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Fine-grained layered multicast with STAIR
IEEE/ACM Transactions on Networking (TON)
Exact emulation of a priority queue with a switch and delay lines
Queueing Systems: Theory and Applications
P5: a protocol for scalable anonymous communication
Journal of Computer Security
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Cross-layer assisted reliability design for wireless multimedia broadcast
Signal Processing - Special section: Advances in signal processing-assisted cross-layer designs
Growth codes: maximizing sensor network data persistence
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A hybrid routing approach for opportunistic networks
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
A Mechanism for Communication-Efficient Broadcast Encryption over Wireless Ad Hoc Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
WEAVER codes: highly fault tolerant erasure codes for storage systems
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
Computer Networks: The International Journal of Computer and Telecommunications Networking
Near-capacity coding for discrete multitone systems with impulse noise
EURASIP Journal on Applied Signal Processing
RT oblivious erasure correcting
IEEE/ACM Transactions on Networking (TON)
A Survey of Results for Deletion Channels and Related Synchronization Channels
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
GRID codes: Strip-based erasure codes with high fault tolerance for storage systems
ACM Transactions on Storage (TOS)
A Combined Matrix Ensemble of Low-Density Parity-Check Codes for Correcting a Solid Burst Erasure
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
R-ADMAD: high reliability provision for large-scale de-duplication archival storage systems
Proceedings of the 23rd international conference on Supercomputing
Memory-efficient segment-based packet-combining schemes in face of deadlines
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Securing bulk content almost for free
Computer Communications
Quasi-systematic doped LT codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Good concatenated code ensembles for the binary erasure channel
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Construction of near-optimum burst erasure correcting low-density parity-check codes
IEEE Transactions on Communications
Fingerprinting with minimum distance decoding
IEEE Transactions on Information Forensics and Security
A finite-length algorithm for LDPC codes without repeated edges on the binary erasure channel
IEEE Transactions on Information Theory
Finite-length scaling for iteratively decoded LDPC ensembles
IEEE Transactions on Information Theory
Reed-Solomon and simplex codes for peak-to-average power ratio reduction in OFDM
IEEE Transactions on Information Theory
Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On universal properties of capacity-approaching LDPC code ensembles
IEEE Transactions on Information Theory
An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices
IEEE Transactions on Information Theory
Authenticated error-correcting codes with applications to multicast authentication
ACM Transactions on Information and System Security (TISSEC)
Quasi-systematic doped LT codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Linear programming bounds on the degree distributions of LDPC code ensembles
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Exact erasure channel density evolution for protograph-based generalized LDPC codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Optimal sparse CDMA detection at high load
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
The generalized area theorem and some of its consequences
IEEE Transactions on Information Theory
The equivalence between Slepian-Wolf coding and channel coding under density evolution
IEEE Transactions on Communications
Generalized MIMO transmit preprocessing using pilot symbol assisted rateless codes
IEEE Transactions on Wireless Communications
Doubly-generalized LDPC codes: stability bound over the BEC
IEEE Transactions on Information Theory
A locally encodable and decodable compressed data structure
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
LDPC codes for the cascaded BSC-BAWGN channel
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Pivoting algorithms for maximum likelihood decoding of LDPC codes over erasure channels
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
On construction of moderate-length LDPC codes over correlated erasure channels
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
IEEE Transactions on Information Theory
INFOCOM'10 Proceedings of the 29th conference on Information communications
Thin layer approach to increase reliability in ad hoc network
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Autonomous routing algorithms for networks with wide-spread failures
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
An efficient P2P content distribution system based on altruistic demand and recoding dissemination
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans - Special issue on model-based diagnostics
Design of packet-based block codes with shift operators
EURASIP Journal on Wireless Communications and Networking
Network coding to combat packet loss in underwater networks
Proceedings of the Fifth ACM International Workshop on UnderWater Networks
Tenor: making coding practical from servers to smartphones
Proceedings of the international conference on Multimedia
Capacity-approaching irregular turbo codes for the binary erasure channel
IEEE Transactions on Communications
Tight thresholds for cuckoo hashing via XORSAT
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithms and theory of computation handbook
Burst decoding of cyclic codes based on circulant parity-check matrices
IEEE Transactions on Information Theory
Simple capacity-achieving ensembles of rateless erasure-correcting codes
IEEE Transactions on Communications
Systematic design of low-density parity-check code ensembles for binary erasure channels
IEEE Transactions on Communications
Bounds on rates of LDPC codes for BEC with varying erasure rate
IEEE Transactions on Communications
New sequences of capacity achieving LDPC code ensembles over the binary erasure channel
IEEE Transactions on Information Theory
Review: A survey of memory error correcting techniques for improved reliability
Journal of Network and Computer Applications
Forward correction and fountain codes in delay-tolerant networks
IEEE/ACM Transactions on Networking (TON)
LT-codes and phase transitions for mutual information
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Maelstrom: transparent error correction for communication between data centers
IEEE/ACM Transactions on Networking (TON)
Local data gathering using opportunistic networking in a urban scenario
Proceedings of the 8th ACM Symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
The set of solutions of random XORSAT formulae
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Complete convergence of message passing algorithms for some satisfiability problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Rateless codes for the multicast stream authentication problem
IWSEC'06 Proceedings of the 1st international conference on Security
Improved decoding of interleaved AG codes
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
IEEE/ACM Transactions on Networking (TON)
Erasure coding in windows azure storage
USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference
Foundations and Trends in Communications and Information Theory
Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables
Random Structures & Algorithms
Applying cube attacks to stream ciphers in realistic scenarios
Cryptography and Communications
ACM Transactions on Storage (TOS)
Achievable complexity-performance tradeoffs in lossy compression
Problems of Information Transmission
Cube cryptanalysis of LBlock with noisy leakage
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
A new model for error-tolerant side-channel cube attacks
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
A new rateless code with unequal error protection property
Computers and Electrical Engineering
Hi-index | 755.56 |
We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs and analyze the algorithm by analyzing a corresponding discrete-time random process. As a result, we obtain a simple criterion involving the fractions of nodes of different degrees on both sides of the graph which is necessary and sufficient for the decoding process to finish successfully with high probability. By carefully designing these graphs we can construct for any given rate R and any given real number ε a family of linear codes of rate R which can be encoded in time proportional to ln(1/ε) times their block length n. Furthermore, a codeword can be recovered with high probability from a portion of its entries of length (1+ε)Rn or more. The recovery algorithm also runs in time proportional to n ln(1/ε). Our algorithms have been implemented and work well in practice; various implementation issues are discussed