Characterizations of sum form information measures on open domains.
Characterizations of tight frame wavelets with special dilation matrices.
Charakterisierung redundanzfreier codes zur datenverschlüsselung
Chevet type inequality and norms of submatrices
We prove a Chevet type inequality which gives an upper bound for the norm of an isotropic log-concave unconditional random matrix in terms of the expectation of the supremum of “symmetric exponential” processes, compared to the Gaussian ones in the Chevet inequality. This is used to give a sharp upper estimate for a quantity that controls uniformly the Euclidean operator norm of the submatrices with k rows and m columns of an isotropic log-concave unconditional random matrix. We apply these estimates...
Chirps -dimensionnels et analyse -microlocale
Chronique sur la théorie de l'information
Chronique sur la théorie de l'information
Circuit lower bounds and linear codes.
Classification in the Gabor time-frequency domain of non-stationary signals embedded in heavy noise with unknown statistical distribution
A new supervised classification algorithm of a heavily distorted pattern (shape) obtained from noisy observations of nonstationary signals is proposed in the paper. Based on the Gabor transform of 1-D non-stationary signals, 2-D shapes of signals are formulated and the classification formula is developed using the pattern matching idea, which is the simplest case of a pattern recognition task. In the pattern matching problem, where a set of known patterns creates predefined classes, classification...
Classification of generalized Hadamard matrices and quaternary Hermitian self-dual codes of length 18.
Classification of linear estimators
Classification of Maximal Optical Orthogonal Codes of Weight 3 and Small Lengths
Dedicated to the memory of the late professor Stefan Dodunekov on the occasion of his 70th anniversary. We classify up to multiplier equivalence maximal (v, 3, 1) optical orthogonal codes (OOCs) with v ≤ 61 and maximal (v, 3, 2, 1) OOCs with v ≤ 99. There is a one-to-one correspondence between maximal (v, 3, 1) OOCs, maximal cyclic binary constant weight codes of weight 3 and minimum dis tance 4, (v, 3; ⌊(v − 1)/6⌋) difference packings, and maximal (v, 3, 1) binary cyclically permutable constant...
Classification Trees as a Technique for Creating Anomaly-Based Intrusion Detection Systems
Intrusion detection is a critical component of security information systems. The intrusion detection process attempts to detect malicious attacks by examining various data collected during processes on the protected system. This paper examines the anomaly-based intrusion detection based on sequences of system calls. The point is to construct a model that describes normal or acceptable system activity using the classification trees approach. The created database is utilized as a basis for distinguishing...
Classifying optimal ternary codes of length 5 and covering radius 1.
Closed-loop stability of discrete linear single-variable systems
Coarse quantization for random interleaved sampling of bandlimited signals
The compatibility of unsynchronized interleaved uniform sampling with Sigma-Delta analog-to-digital conversion is investigated. Let f be a bandlimited signal that is sampled on a collection of N interleaved grids {kT + Tn} k ∈ Zwith offsets T n n = 1 N ⊂ [ 0 ,T ] . If the offsetsTn are chosen independently and uniformly at random from [0,T] and if the sample values of fare quantized with a first order Sigma-Delta algorithm, then with high probability the quantization error | f ( t ) − x10ff65;...
Coarse quantization for random interleaved sampling of bandlimited signals∗∗∗
The compatibility of unsynchronized interleaved uniform sampling with Sigma-Delta analog-to-digital conversion is investigated. Let f be a bandlimited signal that is sampled on a collection of N interleaved grids {kT + Tn} k ∈ Z with offsets . If the offsets Tn are chosen independently and uniformly at random from [0,T] and if the sample values of f are quantized with a first order Sigma-Delta algorithm, then with high probability...
Codes and designs from triangular graphs and their line graphs
For any prime p, we consider p-ary linear codes obtained from the span over p of rows of incidence matrices of triangular graphs, differences of the rows and adjacency matrices of line graphs of triangular graphs. We determine parameters of the codes, minimum words and automorphism groups. We also show that the codes can be used for full permutation decoding.
Codes and projective multisets.
Codes asynchrones