1245 search results - page 156 / 249 » Binary Sparse Coding |
121
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
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...
141
Voted
ICSE
2005
IEEE-ACM
16 years 3 months ago
2005
IEEE-ACM
Software systems evolve over time due to changes in requirements, optimization of code, fixes for security and reliability bugs etc. Code churn, which measures the changes made to...
115
click to vote
SIPS
2007
IEEE
15 years 9 months ago
2007
IEEE
– Luby Transform codes (LT) were originally designed for the Binary Erasure Channel (BEC) encountered owing to randomly dropped packets in the statistical multiplexing aided clas...
138
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
134
click to vote
LCTRTS
2010
Springer
15 years 5 months ago
2010
Springer
DSP processors usually provide dedicated address generation units (AGUs) to assist address computation. By carefully allocating variables in the memory, DSP compilers take advanta...