Sciweavers

1245 search results - page 22 / 249
» Binary Sparse Coding
Sort
View
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 9 months ago
A Class of Transformations that Polarize Symmetric Binary-Input Memoryless Channels
Abstract-- A generalization of Arikan's polar code construction using transformations of the form Gn where G is an
Satish Babu Korada, Eren Sasoglu
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 9 months ago
Automorphisms of doubly-even self-dual binary codes
The automorphism group of a binary doubly-even self-dual code is always contained in the alternating group. On the other hand, given a permutation group G of degree n there exists...
Annika Guenther, Gabriele Nebe
CORR
2006
Springer
88views Education» more  CORR 2006»
13 years 9 months ago
Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
-- The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The u...
Moshe Twitto, Igal Sason, Shlomo Shamai
IPPS
1997
IEEE
14 years 1 months ago
The Sparse Cyclic Distribution against its Dense Counterparts
Several methods have been proposed in the literature for the distribution of data on distributed memory machines, either oriented to dense or sparse structures. Many of the real a...
Gerardo Bandera, Manuel Ujaldon, María A. T...
NIPS
2008
13 years 11 months ago
Differentiable Sparse Coding
Prior work has shown that features which appear to be biologically plausible as well as empirically useful can be found by sparse coding with a prior such as a laplacian (L1) that...
J. Andrew Bagnell, David M. Bradley