85 search results - page 3 / 17 » Code Roots |
ICC
2007
IEEE
13 years 12 months ago
2007
IEEE
— We study the minimum distance of the binary expansion of high-rate Reed-Solomon (RS) codes and product codes in the polynomial basis and show that the binary codes obtained in ...
CRYPTO
1999
Springer
13 years 9 months ago
1999
Springer
Several variations of rooted tree based solutions have been recently proposed for member revocation in multicast communications [18, 19, 20, 21]. In this paper, we show that by ass...
SIGMETRICS
2008
ACM
13 years 5 months ago
2008
ACM
OSprof is a versatile, portable, and efficient profiling methodology based on the analysis of latency distributions. Although OSprof has offers several unique benefits and has bee...
ICCD
2006
IEEE
14 years 2 months ago
2006
IEEE
Reed-Solomon (RS) codes are among the most widely utilized error-correcting codes in modern communication and computer systems. Among the decoding algorithms of RS codes, the rece...
ICMCS
2005
IEEE
13 years 11 months ago
2005
IEEE
This paper presents an error-resilient coding technique combined with error concealment for embedded wavelet coders. The coded images are partitioned into packets and protected by...