Sciweavers

1016 search results - page 15 / 204
» Linear error-block codes
Sort
View
CVPR
2011
IEEE
14 years 10 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
2002
78views more  TIT 2002»
15 years 1 months ago
Improved upper bounds on sizes of codes
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...
Beniamin Mounits, Tuvi Etzion, Simon Litsyn
85
Voted
DCC
2005
IEEE
16 years 1 months ago
Extendability of Ternary Linear Codes
Tatsuya Maruta
STOC
2010
ACM
257views Algorithms» more  STOC 2010»
15 years 11 months ago
Local List-Decoding and Testing of Random Linear Codes from High-Error
Swastik Kopparty and Shubhangi Saraf
108
Voted
CORR
2008
Springer
154views Education» more  CORR 2008»
15 years 2 months ago
Approaching Blokh-Zyablov Error Exponent with Linear-Time Encodable/Decodable Codes
Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion...
Zheng Wang, Jie Luo