Search results for "Linear"

New lower bounds for the minimum distance of generalized algebraic geometry codes

2013

Abstract In this paper, we give a new lower bound for generalized algebraic geometry codes with which we are able to construct some new linear codes having better parameters compared with the ones known in the literature. Moreover, we give a relationship between a family of generalized algebraic geometry codes and algebraic geometry codes. Finally, we propose a decoding algorithm for such a family.

On a linear diophantine problem of Frobenius

1993

Abstract In this paper, linear diophantine problem of Frobenius is discussed. A theorem concerning the largest integer g m (a1,a2) and the smallest integer G m (a1,a2) with m different representations with a1,a2 as basis is proved.

Capabilities of Ultrametric Automata with One, Two, and Three States

2016

Ultrametric automata use p-adic numbers to describe the random branching of the process of computation. Previous research has shown that ultrametric automata can have a significant decrease in computing complexity. In this paper we consider the languages that can be recognized by one-way ultrametric automata with one, two, and three states. We also show an example of a promise problem that can be solved by ultrametric integral automaton with three states.

Analytic solution for a class of discrete-time Riccati equations arising in Nash games

1990

On the existence of conditionally invariant probability measures in dynamical systems

2000

Let T : X→X be a measurable map defined on a Polish space X and let Y be a non-trivial subset of X. We give conditions ensuring the existence of conditionally invariant probability measures to non-absorption in Y. For dynamics which are non-singular with respect to some fixed probability measure we supply sufficient conditions for the existence of absolutely continuous conditionally invariant measures. These conditions are satisfied for a wide class of dynamical systems including systems that are Φ-mixing and Gibbs.

On the Hierarchy Classes of Finite Ultrametric Automata

2015

This paper explores the language classes that arise with respect to the head count of a finite ultrametric automaton. First we prove that in the one-way setting there is a language that can be recognized by a one-head ultrametric finite automaton and cannot be recognized by any k-head non-deterministic finite automaton. Then we prove that in the two-way setting the class of languages recognized by ultrametric finite k-head automata is a proper subclass of the class of languages recognized by (k + 1)-head automata. Ultrametric finite automata are similar to probabilistic and quantum automata and have only just recently been introduced by Freivalds. We introduce ultrametric Turing machines an…

Querying the Guarded Fragment with Transitivity

2016

We study the problem of answering a union of Boolean conjunctive queries q against a database Δ, and a logical theory φ which falls in the guarded fragment with transitive guards (GF + TG). We trace the frontier between decidability and undecidability of the problem under consideration. Surprisingly, we show that query answering under GF2 + TG, i.e., the two-variable fragment of GF + TG, is already undecidable (even without equality), whereas its monadic fragment is decidable; in fact, it is 2exptime-complete in combined complexity and coNP-complete in data complexity. We also show that for a restricted class of queries, query answering under GF+TG is decidable. © 2013 Springer-Verlag.

MMD codes in a more general sense

2002

Summary form only given. The author deals with the characterisation of maximum minimum distance (MMD) codes in a more general sense, which has been completed in a joint work with Olsson. As in the m=1 case the weight distribution of an MMD code /spl Cscr/ is uniquely determined by its parameters [n,k,d]/sub q/.

Über die Schnittzahlen mehrfach balancierter blockpläne

1991

Abstract For a finite incidence structure D with a set X of blocks let [ X ] be the number of points common with all blocks contained in X . We define the functions M(t)(B1,…; B1)=ΣB [B1, B]…[B1,B], and, for every partition ϖ = ϖ1,…,ϖ1) of t, the function Mϖ(B1,…,B1) = Σ Πm [Bi | i ϵ Rm], sum over all decompositions {l, …, t} = R1, ⊃ … ⊃ Rl, |Rm| = ϖm. We show: If D is t-fold balanced, then M(t) = Σϖ cϖMϖ, where the, coefficients cϖ are linear combinations of the parameters b1,…,bt, the constant numbers of blocks through any l,…, t distinct points. Conversely, if the rank of the b × b-matrix ([B, B∗])B,B∗ is equal to the number ν of points and M(t) is a rational linear combination of the fu…

On the type of partial t-spreads in finite projective spaces

1985

AbstractA partial t-spread in a projective space P is a set of mutually skew t-dimensional subspaces of P. In this paper, we deal with the question, how many elements of a partial spread L can be contained in a given d-dimensional subspace of P. Our main results run as follows. If any d-dimensional subspace of P contains at least one element of L, then the dimension of P has the upper bound d−1+(d/t). The same conclusion holds, if no d-dimensional subspace contains precisely one element of L. If any d-dimensional subspace has the same number m>0 of elements of L, then L is necessarily a total t-spread. Finally, the ‘type’ of the so-called geometric t-spreads is determined explicitely.