Sciweavers

1245 search results - page 5 / 249
» Binary Sparse Coding
Sort
View
ICC
2007
IEEE
15 years 6 months ago
Some Results on the Binary Minimum Distance of Reed-Solomon Codes and Block Turbo Codes
— 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 ...
Raphaël Le Bidan, Ramesh Pyndiah, Patrick Add...
176
Voted
CVPR
2011
IEEE
14 years 7 months ago
Robust Sparse Coding for Face Recognition
Recently the sparse representation (or coding) based classification (SRC) has been successfully used in face recognition. In SRC, the testing image is represented as a sparse lin...
Meng Yang, Lei Zhang
TIT
2008
68views more  TIT 2008»
14 years 11 months ago
On the Hardness of Decoding the Gale-Berlekamp Code
The Gale
Ron M. Roth, Krishnamurthy Viswanathan
CGO
2011
IEEE
14 years 3 months ago
Flow-sensitive pointer analysis for millions of lines of code
—Many program analyses benefit, both in precision and performance, from precise pointer analysis. An important dimension of pointer analysis precision is flow-sensitivity, whic...
Ben Hardekopf, Calvin Lin
122
Voted
DCC
2002
IEEE
15 years 11 months ago
Quantizers with Uniform Encoders and Channel Optimized Decoders
Scalar quantizers with uniform encoders and channel optimized decoders are studied for uniform sources and binary symmetric channels. It is shown that the Natural Binary Code and ...
Benjamin Farber, Kenneth Zeger