OBJECTIVE To study the origin of the different components of the electroretinogram (ERG) elicited by a random binary m-sequence stimulus. METHODS Electroretinograms were recorded from pigmented rabbits before and after the injection of glutamate analogues (2-amino-4-phosphono-butyric acid [APB; DL form] and cis-2,3-piperidine-dicarboxylic acid [PDA]) and inhibitory neurotransmitters (glycine ...

In this paper, two classes of generalized cyclotomic sequences of period pq are reconstructed by means of multi-rate parallel combinations of binary Legendre sequences which are clocked at different rates. Then these generalized cyclotomic sequences can be generated by combinations of short and cheap LFSR’s. From the multi-rate constructions and the trace representation of binary Legendre seque...

A classic result in algorithmic information theory is that every infinite binary sequence is computable from a Martin-Löf random infinite binary sequence. Proved independently by Kučera [Kuč85] and Gács [Gác86], this result answered a question by Charles Bennett and has seen numerous applications in the last 30 years. The optimal redundancy in such a coding process has, however, remained unknow...

Binary sequences with optimal autocorrelation play important roles in radar, communication, and cryptography. Finding new binary sequences with optimal autocorrelation has been an interesting research topic in sequence design. Ding-Helleseth-Lam sequences are such a class of binary sequences of period p, where p is an odd prime with p ≡ 1(mod 4). The objective of this letter is to present a con...

A binary triangle of size n is a triangle of zeroes and ones, with n rows, built with the same local rule as the standard Pascal triangle modulo 2. A binary triangle is said to be balanced if the absolute difference between the numbers of zeroes and ones that constitute this triangle is at most 1. In this paper, the existence of balanced binary triangles of size n, for all positive integers n, ...

Manipulation of large sequence data is one of the most important problems in string processing. Recently, Loekito et al. (Knowl. Inf. Syst., 24(2), 235-268, 2009) have introduced a new data structure, called Sequence Binary Decision Diagrams (SeqBDDs, or SDDs), which are descendants of both acyclic DFAs (ADFAs) and binary decision diagrams (BDDs). SDDs can compactly represent sets of sequences ...