The autocorrelation function and the run structure are two basic notions for binary sequences, and have been used as two independent postulates to test randomness of binary sequences ever since Golomb 1955. In this paper, we prove for binary sequence that the autocorrelation function is in fact completely determined by its run structure.

An algorithm for constructing a shortest binary kstage machine generating a given binary sequence is presented. This algorithm can be considered as an extension of BerlekampMassey algorithm to the non-linear case.

Through block cipher method, this paper demonstrates using preorder and post traversal sequence of a binary tree with 64 nodes to implement symmetric encryption/decryption. The different traversal sequences may determine a binary tree, so the method is vulnerable to be attacked. The paper’s further deduction involves improvement using multiple binary trees, so that more secure and efficient sym...

The block reversal of a word w, denoted by BR(w), is generalization the concept word, obtained concatenating blocks in reverse order. We characterize non-binary and binary words whose contains only rich words. prove that for richness all elements BR(w) depends on l(w), length run sequence w. show if are rich, then 2?l(w)?8. also provide structure such

We have carried out K-band speckle observations of a sample of 114 X-ray selected weak-line T Tauri stars in the nearby Scorpius-Centaurus OB association. We find that for binary T Tauri stars closely associated to the early type stars in Upper Scorpius, the youngest subgroup of the OB association, the peak in the distribution of binary separations is at 90 A.U. For binary T Tauri stars located...

An integer sequence (xn)n≥0 is said to be Fibonacci-like if it satisfies the binary recurrence relation xn = xn−1 + xn−2, n ≥ 2. We construct a new type of Fibonacci-like sequence of composite numbers. 1 The problem and previous results In this paper we consider Fibonacci-like sequences, that is, sequences (xn) ∞ n=0 satisfying the binary recurrence relation xn = xn−1 + xn−2, n ≥ 2. (1)

A sequence of codes Cn = fn(Mn), n ≥ 1 is said to attain the transmission rate I(W ) on the channel W if for any ε > 0 there exists a sufficiently large n0 such that for all n ≥ n0 bothR > I(W )−ε and Pe(Cn) ≤ ε. Below we construct a sequence of linear binary codes Cn, n ≥ 1 of length N = 2 that attains the rate I(W ) of the channelW . For symmetric binary-input channels these codes are capacit...

The Problem: While a tracking system is unaware of the identity of any object it tracks, the identity remains the same for the entire tracking sequence. Our system leverages this information by using accumulated joint cooccurrences of the representations within the sequence to create a hierarchical binary-tree classifier of the representations. This classifier is useful to classify sequences as...

Recursive segmentation is a procedure that partitions a DNA sequence into domains with a homogeneous composition of the four nucleotides A, C, G and T. This procedure can also be applied to any sequence converted from a DNA sequence, such as to a binary strong(G + C)/weak(A + T) sequence, to a binary sequence indicating the presence or absence of the dinucleotide CpG, or to a sequence indicatin...

Secured communication in networks is critical because the communication signals are openly available as they propagate. Efficient encryption mechanism is required to assure confidentiality, integrity and authentication of transmitted data. In this paper, we propose encryption of any binary string using cipher chain blocking method. Any musical note consists of seven basic keys. We use a musical...