Sciweavers

1021 search results - page 73 / 205
» On the correlation of binary sequences
Sort
View
CORR
2006
Springer
110views Education» more  CORR 2006»
15 years 4 months ago
Multiple Access Channels with State Information Known at Some Encoders
We consider a multiple access channel (MAC) with channel state information (CSI) non-causally known at some encoders. For simplicity of exposition, we focus on a two-encoder model...
Shivaprasad Kotagiri, J. Nicholas Laneman
ESANN
2006
15 years 5 months ago
A simple idea to separate convolutive mixtures in an undetermined scenario
We consider a blind separation problem for undetermined mixtures of two BPSK signals in a multi-path fading channel. We use independence and frequency diversity of the two source s...
Maciej Pedzisz, Ali Mansour
ITA
2008
150views Communications» more  ITA 2008»
15 years 4 months ago
A note on univoque self-Sturmian numbers
We compare two sets of (infinite) binary sequences whose suffixes satisfy extremal conditions: one occurs when studying iterations of unimodal continuous maps from the unit interva...
Jean-Paul Allouche
RSA
2010
81views more  RSA 2010»
15 years 2 months ago
Percolation of arbitrary words in one dimension
We consider a type of long-range percolation problem on the positive integers, motivated by earlier work of others on the appearance of (in)finite words within a site percolation...
Geoffrey R. Grimmett, Thomas M. Liggett, Thomas Ri...
BIBE
2007
IEEE
128views Bioinformatics» more  BIBE 2007»
15 years 10 months ago
QOMA2: Optimizing the alignment of many sequences
Abstract—We consider the problem of aligning multiple protein sequences with the goal of maximizing the SP (Sum-of-Pairs) score, when the number of sequences is large. The QOMA (...
Xu Zhang, Tamer Kahveci