On the Error-Correcting Performance of some Binary and Ternary Linear Codes

In this work, we determine the coset weight spectra of all binary cyclic codes of lengths up to 33, ternary cyclic and negacyclic codes of lengths up to 20 and of some binary linear codes of lengths up to 33 which are distance-optimal, by using some of the algebraic properties of the codes and a computer assisted search. Having these weight spectra the monotony of the function of the undetected error probability after t-error correction P(t)ue (C,p) could be checked with any precision for a linear time. We have used a programm written in Maple to check the monotony of P(t)ue (C,p) for the investigated codes for a finite set of points of p € [0, p/(q-1)] and in this way to determine which of them are not proper.

Necessary and Sufficient Conditions for the Extendability of Ternary Linear Codes

We give the necessary and sufficient conditions for the extendability of ternary linear codes of dimension k ≥ 5 with minimum distance d ≡ 1 or 2 (mod 3) from a geometrical point of view.

New Bounds for the Maximum Size of Ternary Constant Weight Codes

This work was partially supported by the Bulgarian National Science Fund under Grant I–618/96.

Continuity of Pseudo-differential Operators on Bessel And Besov Spaces

We study the continuity of pseudo-differential operators on Bessel potential spaces Hs|p (Rn ), and on the corresponding Besov spaces B^(s,q)p (R ^n). The modulus of continuity ω we use is assumed to satisfy j≥0, ∑ [ω(2−j )Ω(2j )]2 < ∞ where Ω is a suitable positive function.

Automatic Translation of MSC Diagrams into Petri Nets

Development-engineers use in their work languages intended for software or hardware systems design, and test engineers utilize languages effective in verification, analysis of the systems properties and testing. Automatic interfaces between languages of these kinds are necessary in order to avoid ambiguous understanding of specification of models of the systems and inconsistencies in the initial requirements for the systems development. Algorithm of automatic translation of MSC (Message Sequence Chart) diagrams compliant with MSC’2000 standard into Petri Nets is suggested in this paper. Each input MSC diagram is translated into Petri Net (PN), obtained PNs are sequentially composed in order to synthesize a whole system in one final combined PN. The principle of such composition is defined through the basic element of MSC language — conditions. While translating reference table is developed for maintenance of consistent coordination between the input system’s descriptions in MSC language and in PN format. This table is necessary to present the results of analysis and verification on PN in suitable for the development-engineer format of MSC diagrams. The proof of algorithm correctness is based on the use of process algebra ACP. The most significant feature of the given algorithm is the way of handling of conditions. The direction for future work is the development of integral, partially or completely automated technological process, which will allow designing system, testing and verifying its various properties in the one frame.

Extended Algorithm for Translation of MSC-diagrams into Petri Nets

The article presents an algorithm for translation the system, described by MSC document into Petri Net modulo strong bisimulation. Obtained net can be later used for determining various systems' properties. Example of correction error in original system with using if described algorithm presented.

Fractional Derivatives and Fractional Powers as Tools in Understanding Wentzell Boundary Value Problems for Pseudo-Differential Operators Generating Markov Processes

Mathematics Subject Classification: 26A33, 31C25, 35S99, 47D07.

Well-Posedness of the Cauchy Problem for Inhomogeneous Time-Fractional Pseudo-Differential Equations

Mathematics Subject Classification: 26A33, 45K05, 35A05, 35S10, 35S15, 33E12

Pseudo-Differential Operators in a Wave Diffraction Problem with Impedance Conditions

Mathematics Subject Classification: 35J05, 35J25, 35C15, 47H50, 47G30

Investigation of a Stolarsky type Inequality for Integrals in Pseudo-Analysis

MSC 2010: 03E72, 26E50, 28E10

On some Properties of Boolean Functions and Their Binary Decision Diagrams

Иво Й. Дамянов - Манипулирането на булеви функции е основнo за теоретичната информатика, в това число логическата оптимизация, валидирането и синтеза на схеми. В тази статия се разглеждат някои първоначални резултати относно връзката между граф-базираното представяне на булевите функции и свойствата на техните променливи.

Pseudo-Compact Semi-Topological Groups

Митрофан М. Чобан, Петър Ст. Кендеров, Уорън Б. Муурс - Полу-топологична група (съответно, топологична група) е група, снабдена с топология, относно която груповата оперция произведение е частично непрекъсната по всяка от променливите (съответно, непрекъсната по съвкупност от променливите и обратната операция е също непрекъсната). В настоящата работа ние даваме условия, от топологичен характер, една полу-топологична група да е всъщност топологична група. Например, ние показваме, че всяка сепарабелна псевдокомпактна полу-топологична група е топологична група. Показваме също, че всяка локално псевдокомпактна полу-топологична група, чиято групова операция е непрекъсната по съвкупност от променливите е топологична група.

SG Pseudo-Differential Operators and Weak Hyperbolicity

2002 Mathematics Subject Classification: 35S05, 47G30, 58J42.

Solutions Globales Régulières pour Quelques Équations Lineaires D'évolution du Type Pseudo-Différentiel Singulier

2000 Mathematics Subject Classification: 35C15, 35D05, 35D10, 35S10, 35S99.

Totally Umbilical Pseudo-Slant Submanifolds of a Nearly Cosymplectic Manifold

2000 Mathematics Subject Classification: 53C40, 53B25.