The electrostatics of Einstein’s unified field theory

When sources are added at their right-hand sides, and g_(ik) is a priori assumed to be the metric, the equations of Einstein’s Hermitian theory of relativity were shown to allow for an exact solution that describes the general electrostatic field of n point charges. Moreover, the injunction of spherical symmetry of g_(ik) in the infinitesimal neighbourhood of each of the charges was proved to yield the equilibrium conditions of the n charges in keeping with ordinary electrostatics. The tensor g_(ik), however, cannot be the metric of the theory, since it enters neither the eikonal equation nor the equation of motion of uncharged test particles. A physically correct metric that rules both the behaviour of wave fronts and of uncharged matter is the one indicated by Hély.In the present paper it is shown how the electrostatic solution predicts the structure of the n charged particles and their mutual positions of electrostatic equilibrium when Hély’s physically correct metric is adopted.     

The Distance Between Classical and Quantum Systems

In a recent paper, a “distance” function, , was defined which measures the distance between pure classical and quantum systems. In this work, we present a new definition of a “distance”, D, which measures the distance between either pure or impure classical and quantum states. We also compare the new distance formula with the previous formula, when the latter is applicable. To illustrate these distances, we have used 2 × 2 matrix examples and two-dimensional vectors for simplicity and clarity. Several specific examples are calculated.     

Designs and Representation of the Symmetric Group

We study (generalized) designs supported by words of given composition. We characterize them in terms of orthogonality relations with Specht modules; we define some zonal functions for the symmetric group and we give a closed formula for them, indexed on ordered pair of semi-standard generalized tableaux: Hahn polynomials are a particular case. We derive an algorithm to test if a set is a design. We use it to search designs in some ternary self-dual codes.     

Unitary representations of superconformal algebra

superconformal algebra is algebra with two Virasoro operators. The Kac determinant is calculated and the complete list of unitary representations is determined. Two types of extensions of algebra are discussed. A new approach to construction of algebras from rational conformal field theories is proposed.     

Cyclic codes of length 2 m

In this paper explicit expressions ofm + 1 idempotents in the ring are given. Cyclic codes of length 2 ^m over the finite fieldF _q, of odd characteristic, are defined in terms of their generator polynomials. The exact minimum distance and the dimension of the codes are obtained.     

Optimal Ternary Linear Rate 1/2 Codes

In this paper, we classify all optimal linear[n, n/2] codes up to length 12. We show that thereis a unique optimal [10, 5, 5] code up to equivalence.     

Improved Bounds for Ternary Linear Codes of Dimension 8 Using Tabu Search

In this paper, new codes of dimension 8 are presented which give improved bounds on the maximum possible minimum distance of ternary linear codes. These codes belong to the class of quasi-twisted (QT) codes, and have been constructed using a stochastic optimization algorithm, tabu search. Twenty three codes are given which improve or establish the bounds for ternary codes. In addition, a table of upper and lower bounds for d ₃(n, 8) is presented for n 200.     

New Linear Codes Over \mathbb{F}_3 and \mathbb{F}_5 and Improvements on Bounds

One of the most important problems of coding theory is to constructcodes with best possible minimum distances. In this paper, we generalize the method introduced by [8] and obtain new codes which improve the best known minimum distance bounds of some linear codes. We have found a new linear ternary code and 8 new linear codes over with improved minimumdistances. First we introduce a generalized version of Gray map,then we give definition of quasi cyclic codes and introduce nearlyquasi cyclic codes. Next, we give the parameters of new codeswith their generator matrices. Finally, we have included twotables which give Hamming weight enumerators of these new codes.     

Minimum Distance Bounds for s-Regular Codes

A code C F ⁿ is s-regular provided, forevery vertex x F ⁿ, if x is atdistance at most s from C then thenumber of codewords y C at distance ifrom x depends only on i and the distancefrom x to C. If denotesthe covering radius of C and C is -regular,then C is said to be completely regular. SupposeC is a code with minimum distance d,strength t as an orthogonal array, and dual degrees ^*. We prove that d 2t + 1 whenC is completely regular (with the exception of binaryrepetition codes). The same bound holds when C is(t + 1)-regular. For unrestricted codes, we show thatd s ^* + t unless C is a binary repetitioncode.