1021 search results - page 61 / 205 » On the correlation of binary sequences |
DCC
2007
IEEE
15 years 9 months ago
2007
IEEE
Constructions and nonexistence conditions for multi-dimensional Golay complementary array pairs are reviewed. A construction for a d-dimensional Golay array pair from a (d + 1)-di...
ESA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...
SPIRE
2005
Springer
15 years 3 months ago
2005
Springer
Given two n-bit (cyclic) binary strings, A and B, represented on a circle (necklace instances). Let each sequence have the same number k of 1’s. We are interested in computing th...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
In this paper we introduce an information theoretic approach and use techniques from the theory of Huffman codes to construct a sequence of binary sampling vectors to determine a s...
CIE
2010
Springer
15 years 2 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...