Sciweavers

215 search results - page 14 / 43
» The asymptotic number of binary codes and binary matroids
Sort
View
ICPP
1994
IEEE
15 years 1 months ago
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
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 ...
Kemal Efe, Antonio Fernández
CORR
2011
Springer
155views Education» more  CORR 2011»
14 years 4 months ago
Subexponential convergence for information aggregation on regular trees
— 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 ...
Yashodhan Kanoria, Andrea Montanari
IEEECIT
2010
IEEE
14 years 8 months ago
Remainder Sign Analysis in Fixed-point Division
—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...
Xuting Wan, Jianping Cai, Qifan Yang
TIT
2002
78views more  TIT 2002»
14 years 9 months ago
Improved upper bounds on sizes of codes
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...
Beniamin Mounits, Tuvi Etzion, Simon Litsyn
GLOBECOM
2008
IEEE
15 years 4 months ago
Scalable Redundancy for Sensors-to-Sink Communication
—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...
Osameh M. Al-Kofahi, Ahmed E. Kamal