Sciweavers

1245 search results - page 17 / 249
» Binary Sparse Coding
Sort
View
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 9 months ago
New Constant-Weight Codes from Propagation Rules
This paper proposes some simple propagation rules which give rise to new binary constant-weight codes.
Yeow Meng Chee, Chaoping Xing, Sze Ling Yeo
SIGMETRICS
1998
ACM
14 years 1 months ago
Modeling Set Associative Caches Behavior for Irregular Computations
While much work has been devoted to the study of cache behavior during the execution of codes with regular access patterns, little attention has been paid to irregular codes. An i...
Basilio B. Fraguela, Ramon Doallo, Emilio L. Zapat...
TIT
2008
107views more  TIT 2008»
13 years 9 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 9 months ago
On formulas for decoding binary cyclic codes
— We address the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to fin...
Daniel Augot, Magali Bardet, Jean-Charles Faug&egr...
ARSCOM
2007
76views more  ARSCOM 2007»
13 years 9 months ago
A New Lower Bound for A(17, 6, 6)
We construct a record-breaking binary code of length 17, minimal distance 6, constant weight 6, and containing 113 codewords.
Yeow Meng Chee