Weight distributions of geometric Goppa codes

The in general hard problem of computing weight distributions of linear codes is considered for the special class of algebraic-geometric codes, defined by Goppa in the early eighties. Known results restrict to codes from elliptic curves. We obtain results for curves of higher genus by expressing the weight distributions in terms of -series. The results include general properties of weight distributions, a method to describe and compute weight distributions, and worked out examples for curves of genus two and three.

     

On the Characterization of Linear Uniquely Decodable Codes

A Uniquely Decodable (UD) Code is a code such that any vector of the ambient space has a unique closest codeword. In this paper we begin a study of the structure of UD codes and identify perfect subcodes. In particular we determine all linear UD codes of covering radius 2.     

Construction of Certain Cyclic Distance-Preserving Codes Having Linear-Algebraic Characteristics

An ordered list of binary words of length n is called a distance-preserving m, n-code, if the list distance between two words is equal to their Hamming distance, for distances up to m. A technique for constructing cyclic m, n-codes is presented, based on the standard Gray code and on some simple tools from linear algebra.     

Invariant Differential Operators on Symmetric Cones and Hermitian Symmetric Spaces

We give a brief survey on the study of constructions of invariant differential operators on Riemannian symmetric spaces and of combinatorial and analytical properties of their eigenvalues, and pose some open questions.     

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.     

Calculation of the Electron Efficiency for a Two-Cavity Gyroklystron Amplifier by Using a Self-Consistent Code

The beam-wave interaction in a Ka-band, two-cavity fundamental gyroklystron amplifier is studied by using a self-consistent nonlinear simulation code. The electron efficiency for this gyroklystron amplifier is calculated, and the effect of various parameters, such as beam voltage, beam current, electron guiding center radius, velocity pitch ratio and drift tube length on the electron efficiency is discussed in detail.     

Performance of run-length limited (4, 18) code for optical storage systems

In this paper, the authors investigate the performance of recently presented run-length limited (4, 18) code for high density optical storage systems. The construction of the code is described simply. The code has code rate R = 1/3 and density ratio (DR) = 1.67. The bit error rate (BER) performance for decision feedback equalizer (DFE) and partial response maximum likelihood (PRML) detector are simulated, considering signal-to-noise ratio (SNR) and optical channel jitter. The result shows that the performance of the code is acceptable. The encoder and decoder of the code are implemented by complex programmable logic device (CPLD) chip and the hardware resources required for encoder and decoder arelow.     

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.