After an introduction to the mathematical theory of rheolinear systems the application of the results leads to the fact that due to the synchronization there arises a frequency deviation even outside of the synchronization range. The errors caused by this effect were investigated and consequences for highprecision frequency or time measurement and methods of error-correcting are obtained .

We improve several upper bounds to the complexity of the membership problem for languages deened by iterated morphisms (D0L systems). The complexity bounds are expressed in terms of DLOGT IME-uniform circuit families. We prove: 1) For polynomially growing D0L systems the membership problem is contained in AC 0. 2) For arbitrary D0L systems the membership problem is contained in NC 1. 3) The lat...

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...

Error concealment techniques are useful in video transmission over channels that introduce bit errors. The efficiency and result of error concealment technique, however, rely on the error detection capabilities of video decoders. A novel error detection technique employing fragile watermarking is proposed in this paper. By embedding a fragile watermark on the quantized DCT coefficients and exam...

Elements of accuracy of LIDAR systems and the corrections of systematic errors have received growing attention in recent years. The expected level of accuracy and the additional processing that is needed for making the raw data ready to use are affected directly by the systematic errors in the laser data. It is evident that calibration of the LIDAR system, both laboratory and in-flight, are man...

DAVID M. MANDELBAUM, MEMBER, IEEE termc and M RlCmnd M factor the product of n + r t distinct moduli. The smallest product of Abstract-Multiple-error-correcting arithmetic codes which are min (n + r t) = 12 distinct moduli is ny=r mi = M,. Therenonlinear are constructed by residue encoding. A simple algorithm is fore, M, I M,B/C mod M, < M,. Hence M,.B/C mod M, can given for correcting multiple...

In this paper we present a new upper bound on the minimum distance of binary cyclic arithmetic codes of composite length. Two new classes of binary cyclic arithmetic codes of composite length are introduced. The error correction capability of these codes are discussed and in some cases the actual minimum distance is found. Decoding algorithms based on majority-logic decision are proposed for th...

This article employs cointegration and error-correction modelling to test the causal relationship between real income, exports and human capital stock using data for China over the period 1960 to 1999. We find that real exports, human capital and real income are cointegrated when real exports is the dependent variable, but are not cointegrated when human capital or real income are the dependent...

Abstracf-A study of the efficiency, error-correcting capabilities, and limitations of graph theoretic block codes is presented. Augmentation of graph theoretic codes and their generation is discussed. It is shown that such augmentation techniques can substantially increase the level of efficiency of these codes and potentially could increase it to the level of the best available codes. Furtherm...