Sciweavers

1245 search results - page 111 / 249
» Binary Sparse Coding
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
15 years 1 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
AAECC
2007
Springer
85views Algorithms» more  AAECC 2007»
16 years 15 days 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
MCS
2010
Springer
16 years 1 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 10 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
WCRE
2010
IEEE
15 years 4 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