Sciweavers

2655 search results - page 6 / 531
» LT Network Codes
Sort
View
SOFSEM
2010
Springer
13 years 4 months ago
Fast and Compact Prefix Codes
It is well-known that, given a probability distribution over n characters, in the worst case it takes (n log n) bits to store a prefix code with minimum expected codeword length. H...
Travis Gagie, Gonzalo Navarro, Yakov Nekrich
DCC
2002
IEEE
14 years 6 months ago
Subcodes of the Projective Generalized Reed-Muller Codes Spanned by Minimum-Weight Vectors
We use methods of Mortimer [19] to examine the subcodes spanned by minimumweight vectors of the projective generalized Reed-Muller codes and their duals. These methods provide a p...
Peng Ding, Jennifer D. Key
DCC
2004
IEEE
14 years 6 months ago
On a Class of Traceability Codes
Traceability codes are designed to be used in schemes that protect copyrighted digital data against piracy. The main aim of this paper is to give an answer to a Staddon-Stinson-We...
Tran van Trung, Sosina Martirosyan
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
ECCC
1998
118views more  ECCC 1998»
13 years 6 months ago
Chinese Remaindering with Errors
The Chinese Remainder Theorem states that a positive integer m is uniquely speci ed by its remainder modulo k relatively prime integers p1;:::;pk, provided m < Qk i=1 pi. Thus ...
Oded Goldreich, Dana Ron, Madhu Sudan