PROBLEMS OF INFORMATION TRANSMISSION
A translation of Problemy Peredachi Informatsii
Asynchronous Address Communication Systems
G. S. Eidus, V. V. Markov, and M. D. Venediktov
AbstractWe give a review based on Russian and foreign publications of the state of the theory and technology of a new method of multiplexing multichannel systems using nonorthogonal signals.
On a Method of Solving the Problem of
Synchronizing a Chain of Automata in Minimal Time
V. I. Levenshtein
AbstractA description is given of an extremely simple system of signals between automata yielding a minimal-time solution of the problem of synchronizing a chain of automata in which each automaton has in one variant 12 and in another 9 states. The principle is illustrated in color in Table 1. In the known minimal-time solutions of the synchronization problem for a chain of automata each automaton has many thousands of states.
Identification of Unvoiced Fricative
Sounds from a Clipped Speech Signal
G. I. Tsemel
AbstractThe noise signal on the quasistationary (nontransient) sections of fricative sounds may, in its general features, be characterized by the number of zeros 2N on some time interval and by the scatter of the durations of the intervals between zeros. The degree of dispersion may be expressed quantitatively by the number of intervals ni and mi with durations significantly greater and significantly less than the mean duration. The reliability of discrimination of the voiceless fricative sounds on the planes of the attributes Nn and N(n + m) with 2240 realizations from 46 speakers (taking account of frequency of occurrence) amounted to about 91 percent. These results may be used to identify other noiselike sounds, since the properties of noiselike sounds different in the method of formation, but identical in the place of formation are very similar.
New Upper Bounds for Error Correcting Codes
L. A. Bassalygo
AbstractSome new upper bounds are obtained for error correcting codes.
On Some Properties of Random Group
Codes of Great Length
V. N. Koshelev
AbstractIt is shown that a randomly chosen linear binary code almost certainly satisfies the VarshamovGilbert bound. The probability of a large deviation from this bound tends to zero exponentially with increase of the code length.
Circuit Synthesis Using Threshold and
Ch. I. Askerov
AbstractMethods are described for synthesizing circuits using threshold and two-threshold devices for an arbitrary Boolean function. The methods are not guaranteed to give the best realizations (in respect of the number of elements required), as the process of synthesis is not unique.