All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 15 Next

Displaying 281 – 300 of 1507

Showing per page

Coarse quantization for random interleaved sampling of bandlimited signals∗∗∗

Alexander M. Powell, Jared Tanner, Yang Wang, Özgür Yılmaz (2012)

ESAIM: Mathematical Modelling and Numerical Analysis

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 { T n } n = 1 N ⊂ [ 0 , T ] . 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

Washiela Fish, Khumbo Kumwenda, Eric Mwambene (2011)

Open Mathematics

For any prime p, we consider p-ary linear codes obtained from the span over 𝔽 p 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 de Goppa

Jean-Francis MICHON (1983/1984)

Seminaire de Théorie des Nombres de Bordeaux

Codes générateurs minimaux de langages de mots bi-infinis

Jeanne Devolder (2010)

RAIRO - Theoretical Informatics and Applications

In this paper we give two families of codes which are minimal generators of biinfinite languages: the family of very thin codes (which contains the rational codes) and another family containing the circular codes. We propose the conjecture that all codes are minimal generators.

Codes that attain minimum distance in every possible direction

Gyula Katona, Attila Sali, Klaus-Dieter Schewe (2008)

Open Mathematics

The following problem motivated by investigation of databases is studied. Let 𝒞 be a q-ary code of length n with the properties that 𝒞 has minimum distance at least n − k + 1, and for any set of k − 1 coordinates there exist two codewords that agree exactly there. Let f(q, k)be the maximum n for which such a code exists. f(q, k)is bounded by linear functions of k and q, and the exact values for special k and qare determined.

Colouring of cycles in the de Bruijn graphs

Ewa Łazuka, Jerzy Żurawiecki (2000)

Discussiones Mathematicae Graph Theory

We show that the problem of finding the family of all so called the locally reducible factors in the binary de Bruijn graph of order k is equivalent to the problem of finding all colourings of edges in the binary de Bruijn graph of order k-1, where each vertex belongs to exactly two cycles of different colours. In this paper we define and study such colouring for the greater class of the de Bruijn graphs in order to define a class of so called regular factors, which is not so difficult to construct....

Combination of t-norms and their conorms

Karel Zimmermann (2023)

Kybernetika

Non-negative linear combinations of t min -norms and their conorms are used to formulate some decision making problems using systems of max-separable equations and inequalities and optimization problems under constraints described by such systems. The systems have the left hand sides equal to the maximum of increasing functions of one variable and on the right hand sides are constants. Properties of the systems are studied as well as optimization problems with constraints given by the systems and appropriate...

Currently displaying 281 – 300 of 1507