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.

Simulation-based Approach to Verification of Logical Descriptions with Functional Indeterminacy

A verification task of proving the equivalence of two descriptions of the same device is examined for the case, when one of the descriptions is partially defined. In this case, the verification task is reduced to checking out whether logical descriptions are equivalent on the domain of the incompletely defined one. Simulation-based approach to solving this task for different vector forms of description representations is proposed. Fast Boolean computations over Boolean and ternary vectors having big sizes underlie the offered methods.

Reasoning Methods for Designing and Surveying Relationships Described by Sets of Functional Constraints

This work is supported by the Hungarian Scientific Research Fund (OTKA), grant T042706.

Application of Artificial Intelligence Methods to Computer Design of Inorganic Compounds

In this paper the main problems for computer design of materials, which would have predefined properties, with the use of artificial intelligence methods are presented. The DB on inorganic compound properties and the system of DBs on materials for electronics with completely assessed information: phase diagram DB of material systems with semiconducting phases and DB on acousto-optical, electro-optical, and nonlinear optical properties are considered. These DBs are a source of information for data analysis. Using the DBs and artificial intelligence methods we have predicted thousands of new compounds in ternary, quaternary and more complicated chemical systems and estimated some of their properties (crystal structure type, melting point, homogeneity region etc.). The comparison of our predictions with experimental data, obtained later, showed that the average reliability of predicted inorganic compounds exceeds 80%. The perspectives of computational material design with the use of artificial intelligence methods are considered.

The Nonexistence of [132, 6, 86]3 Codes and [135, 6, 88]3 Codes

We prove the nonexistence of [g3(6, d), 6, d]3 codes for d = 86, 87, 88, where g3(k, d) = ∑⌈d/3i⌉ and i=0 ... k−1. This determines n3(6, d) for d = 86, 87, 88, where nq(k, d) is the minimum length n for which an [n, k, d]q code exists.

Optimum Chemical Balance Weighing Design under Certain Condition

2000 Mathematics Subject Classification: 62K05, 05B05.