Sciweavers

1245 search results - page 27 / 249
» Binary Sparse Coding
Sort
View
JCT
2002
107views more  JCT 2002»
13 years 9 months ago
Asymmetric Binary Covering Codes
An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that every vector x Qn can be obtained from some vector c C by changing at most R...
Joshua N. Cooper, Robert B. Ellis, Andrew B. Kahng
ISVLSI
2007
IEEE
139views VLSI» more  ISVLSI 2007»
14 years 4 months ago
Automatic Retargeting of Binary Utilities for Embedded Code Generation
Contemporary SoC design involves the proper selection of cores from a reference platform. Such selection implies the design exploration of alternative CPUs, which requires the gen...
Alexandro Baldassin, Paulo Centoducatte, Sandro Ri...
CORR
2004
Springer
111views Education» more  CORR 2004»
13 years 9 months ago
Distance distribution of binary codes and the error probability of decoding
We address the problem of bounding below the probability of error under maximum-likelihood decoding of a binary code with a known distance distribution used on a binarysymmetric ch...
Alexander Barg, Andrew McGregor
VLSID
2005
IEEE
124views VLSI» more  VLSID 2005»
14 years 3 months ago
Design of a Reversible Binary Coded Decimal Adder by Using Reversible 4-Bit Parallel Adder
In this paper, we have proposed a design technique for the reversible circuit of Binary Coded Decimal (BCD) adder. The proposed circuit has the ability to add two 4bits binary var...
Hafiz Md. Hasan Babu, Ahsan Raja Chowdhury
COMBINATORICS
2006
92views more  COMBINATORICS 2006»
13 years 9 months ago
Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes
We consider a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compos...
Brad Jackson, Frank Ruskey