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.     

Maximal inequalities via bracketing with adaptive truncation

The paper provides a recursive interpretation for the technique known as bracketing with adaptive truncation. By way of illustration, a simple bound is derived for the expected value of the supremum of an empirical process, thereby leading to a simpler derivation of a functional central limit theorem due to Ossiander. The recursive method is also abstracted into a framework that consists of only a small number of assumptions about processes and functionals indexed by sets of functions. In particular, the details of the underlying probability model are condensed into a single inequality involving finite sets of functions. A functional central limit theorem of Doukhan, Massart and Rio, for empirical processes defined by absolutely regular sequences, motivates the generalization.     

Quantum-chemical study of the interface formed by carboxylic species on TiO<Subscript>2</Subscript> nanoparticles. 1. Nanoparticle surface

The current paper presents results of a quantum-chemical study of the surface structure of nanoparticles of both rutile and anatase crystallographic modifications. Different stages of the surface relaxation are discussed. Water adsorption is considered. The calculations were performed in the spd-basis by using semi-empirical quantum-chemical codes, both sequential and parallel. The results are mainly addressed to the study of the interface formed by titania nanoparticles and a set of carboxylated species, namely, benzoic, bi-isonicotinic acids as well as tris-(2,2′-dcbipyridine) Fe(II) complex placed on the surface of either rutile or anatase polymorphs.This revised version was published online in August 2005 with a corrected issue number.     

Cycles in 2-connected graphs

Let be a class of graphs on n vertices. For an integer c, let be the smallest integer such that if G is a graph in with more than edges, then G contains a cycle of length more than c. A classical result of Erdös and Gallai is that if is the class of all simple graphs on n vertices, then . The result is best possible when n-1 is divisible by c-1, in view of the graph consisting of copies of K_c all having exactly one vertex in common. Woodall improved the result by giving best possible bounds for the remaining cases when n-1 is not divisible by c-1, and conjectured that if is the class of all 2-connected simple graphs on n vertices, thenwhere , 2tc/2, is the number of edges in the graph obtained from K_c+1-t by adding n-(c+1-t) isolated vertices each joined to the same t vertices of K_c+1-t. By using a result of Woodall together with an edge-switching technique, we confirm Woodall's conjecture in this paper.     

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.     

A Point Balance Algorithm for the Spherical Code Problem

The Spherical Code (SC) problem has many important applications in such fields as physics, molecular biology, signal transmission, chemistry, engineering and mathematics. This paper presents a bilevel optimization formulation of the SC problem. Based on this formulation, the concept of balanced spherical code is introduced and a new approach, the Point Balance Algorithm (PBA), is presented to search for a 1-balanced spherical code. Since an optimal solution of the SC problem (an extremal spherical code) must be a 1-balanced spherical code, PBA can be applied easily to search for an extremal spherical code. In addition, given a certain criterion, PBA can generate efficiently an approximate optimal spherical code on a sphere in the n-dimensional space ⁿ. Some implementation issues of PBA are discussed and putative global optimal solutions of the Fekete problem in 3, 4 and 5-dimensional space are also reported. Finally, an open question about the geometry of Fekete points on the unit sphere in the 3-dimensional space is posed.     

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.