215 search results - page 14 / 43 » The asymptotic number of binary codes and binary matroids |
ICPP
1994
IEEE
15 years 3 months ago
1994
IEEE
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
— We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k ≥ 2, we ...
69
Voted
IEEECIT
2010
IEEE
14 years 10 months ago
2010
IEEE
—This paper analyses remainder signs determinant issue in the computer fixed-point division operation. Together with the manual binary number division, the true code addition and...
TIT
2002
14 years 11 months ago
2002
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—In this paper, we present a new technique that uses deterministic binary network coding in a distributed manner to enhance the resiliency of Sensor-to-Base information flow aga...