Sciweavers

77 search results - page 3 / 16
» LT Codes
Sort
View
VTC
2007
IEEE
130views Communications» more  VTC 2007»
14 years 1 months ago
Amalgamated Generalized Low Density Parity Check and Luby Transform Codes for the Wireless Internet
– Luby Transform codes (LT) were originally designed for the Binary Erasure Channel (BEC) encountered owing to randomly dropped packets in the statistical multiplexing aided Inte...
Thanh Dang Nguyen, Fang-Chun Kuo, Lie-Liang Yang, ...
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
13 years 8 months ago
Concatenated codes can achieve list-decoding capacity
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
ICISC
2007
120views Cryptology» more  ICISC 2007»
13 years 8 months ago
A Note About the Traceability Properties of Linear Codes
We characterize the traceability properties of linear codes. It is well known that any code of length n and minimum distance d is a c-TA code if c2 < n/(n−d). In this paper, w...
Marcel Fernandez, Josep Cotrina Navau, Miguel Sori...
GLOBECOM
2008
IEEE
14 years 1 months ago
Rate Adaptive Binary Erasure Quantization with Dual Fountain Codes
—In this contribution, duals of fountain codes are introduced and their use for lossy source compression is investigated. It is shown both theoretically and experimentally that t...
Dino Sejdinovic, Robert J. Piechocki, Angela Doufe...
TCOM
2010
122views more  TCOM 2010»
13 years 5 months ago
Simple capacity-achieving ensembles of rateless erasure-correcting codes
—This paper is concerned with a simple binary erasure-recovery coding scheme that falls into the family of socalled semi-random low-density-parity-check (SR-LDPC) codes. Based on...
Xiaojun Yuan, Rong Sun, Li Ping