Sciweavers

215 search results - page 9 / 43
» The asymptotic number of binary codes and binary matroids
Sort
View
109
Voted
SIAMDM
2010
137views more  SIAMDM 2010»
14 years 7 months ago
Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods
In this paper we study the problem of finding maximally sized subsets of binary strings (codes) of equal length that are immune to a given number r of repetitions, in the sense th...
Lara Dolecek, Venkat Anantharam
ECOOP
1998
Springer
15 years 1 months ago
Binary Component Adaptation
Binary component adaptation (BCA) allows components to be adapted and evolved in binary form and on-the-fly (during program loading). BCA rewrites component binaries before (or whi...
Ralph Keller, Urs Hölzle
SETA
2004
Springer
81views Mathematics» more  SETA 2004»
15 years 2 months ago
Univariate and Multivariate Merit Factors
Abstract. Merit factor of a binary sequence is reviewed, and constructions are described that appear to satisfy an asymptotic merit factor of 6.3421 . . . Multivariate merit factor...
Matthew G. Parker
CORR
2008
Springer
129views Education» more  CORR 2008»
14 years 9 months ago
Tight Bounds on the Capacity of Binary Input random CDMA Systems
Abstract-- We consider code division multiple access communication over a binary input additive white Gaussian noise channel using random spreading. For a general class of symmetri...
Satish Babu Korada, Nicolas Macris
CVPR
2010
IEEE
15 years 6 months ago
Surface Extraction from Binary Volumes with Higher-Order Smoothness
A number of 3D shape reconstruction algorithms, in particular 3D image segmentation methods, produce their results in the form of binary volumes, where a binary value indicates whe...
Victor Lempitsky