Sciweavers

2621 search results - page 167 / 525
» Near orders and codes
Sort
View
STOC
2009
ACM
187views Algorithms» more  STOC 2009»
16 years 7 months ago
Artin automorphisms, cyclotomic function fields, and folded list-decodable codes
Algebraic codes that achieve list decoding capacity were recently constructed by a careful "folding" of the Reed-Solomon code. The "low-degree" nature of this f...
Venkatesan Guruswami
INFOCOM
2009
IEEE
16 years 1 months ago
Rateless Coding with Feedback
The erasure resilience of rateless codes, such as Luby-Transform (LT) codes, makes them particularly suitable to a wide variety of loss-prone wireless and sensor network applicati...
Andrew Hagedorn, Sachin Agarwal, David Starobinski...
LCTRTS
1999
Springer
15 years 10 months ago
Optimizing for Reduced Code Space using Genetic Algorithms
Code space is a critical issue facing designers of software for embedded systems. Many traditional compiler optimizations are designed to reduce the execution time of compiled cod...
Keith D. Cooper, Philip J. Schielke, Devika Subram...
VTC
2010
IEEE
153views Communications» more  VTC 2010»
15 years 4 months ago
H.264 Wireless Video Telephony Using Iteratively-Detected Binary Self-Concatenated Coding
— In this contribution we propose a robust H.264 coded wireless video transmission scheme using iteratively decoded self-concatenated convolutional coding (SECCC). The proposed S...
Nasruminallah, Muhammad Fasih Uddin Butt, Soon Xin...
DAC
2000
ACM
16 years 7 months ago
Code compression for low power embedded system design
erse approaches at all levels of abstraction starting from the physical level up to the system level. Experience shows that a highlevel method may have a larger impact since the de...
Haris Lekatsas, Jörg Henkel, Wayne Wolf