Sciweavers

1245 search results - page 111 / 249
» Binary Sparse Coding
Sort
View
133
Voted
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 10 months ago
On the Decoding Complexity of Cyclic Codes Up to the BCH Bound
—The standard algebraic decoding algorithm of cyclic codes [n, k, d] up to the BCH bound t is very efficient and practical for relatively small n while it becomes unpractical fo...
Davide Schipani, Michele Elia, Joachim Rosenthal
100
Voted
AAECC
2007
Springer
85views Algorithms» more  AAECC 2007»
15 years 10 months ago
Distribution of Trace Values and Two-Weight, Self-orthogonal Codes over GF ( p , 2)
The uniform distribution of the trace map lends itself very well to the construction of binary and non-binary codes from Galois fields and Galois rings. In this paper we study the...
N. Pinnawala, A. Rao, T. Aaron Gulliver
145
Voted
MCS
2010
Springer
15 years 10 months ago
Class-Separability Weighting and Bootstrapping in Error Correcting Output Code Ensembles
A method for applying weighted decoding to error-correcting output code ensembles of binary classifiers is presented. This method is sensitive to the target class in that a separa...
Raymond S. Smith, Terry Windeatt
IMA
2001
Springer
134views Cryptology» more  IMA 2001»
15 years 8 months ago
Almost-Certainly Runlength-Limiting Codes
Standard runlength-limiting codes – nonlinear codes defined by trellises – have the disadvantage that they disconnect the outer errorcorrecting code from the bit-by-bit likeli...
David J. C. MacKay
200
Voted
WCRE
2010
IEEE
15 years 2 months ago
Reverse Engineering Self-Modifying Code: Unpacker Extraction
—An important application of binary-level reverse engineering is in reconstructing the internal logic of computer malware. Most malware code is distributed in encrypted (or “pa...
Saumya K. Debray, Jay Patel