interval is taken as T s. A similar problem, but in discrete time, more, if there is an m such that Tableh(m)#Table',(Y) for every has been considered in [l] where the authors have proposed an ad hoc linear encoding-decoding scheme which does not Y, then II E,H and Table~(k)=Table~(Z). With the computer asymptotically achieve the known performance bound for the we found the tables and from them...

The trellis of a finite Abelian group code is locally (i.e., trellis section by trellis section) related to the trellis of the corresponding dual group code which allows to express the basic operations of the a posteriori probability (APP) decoding algorithm (defined on a single trellis section of the primal trellis) in terms of the corresponding dual trellis section. Using this local approach,...

The parameters of a linear code C over GF(q) are given by [n, k, d], where n denotes the length, k the dimension and d the minimum distance of C . The code C is called MDS, or maximum distance separable, if the minimum distance d meets the Singleton bound, i.e. d = n−k+1. Unfortunately, the parameters of an MDS code are severely limited by the size of the field. Thus we look for codes which hav...

Automorphisms of order 2p in binary self-dual extremal codes of length a multiple of 24 Abstract Let C be a binary self-dual code with an automorphism g of order 2p, where p is an odd prime, such that g p is a fixed point free involution. If C is extremal of length a multiple of 24 all the involutions are fixed point free, except the Golay Code and eventually putative codes of length 120. Conne...

Few weights codes have been an important topic of coding theory for decades. In this paper, a class of two-weight and three-weight codes for the homogeneous metric over the chain ring R = Fp + uFp + · · ·+ uFp are constructed. These codes are defined as trace codes. They are shown to be abelian. Their homogeneous weight distributions are computed by using exponential sums. In particular, we giv...

Let D2n = 〈x, y | x = 1, y = 1, yxy = x〉 be a dihedral group, and R = GR(p, m) be a Galois ring of characteristic p and cardinality p where p is a prime. Left ideals of the group ring R[D2n] are called left dihedral codes over R of length 2n, and abbreviated as left D2n-codes over R. Let gcd(n, p) = 1 in this paper. Then any left D2n-code over R is uniquely decomposed into a direct sum of conca...

dual systems of steel moment frame and reinforced concrete shear wall have combined the advantages of steel frames and reinforced concrete shear wall. these walls have increased the lateral stiffness of steel frames and have reduced seismic demands on steel frames thus providing opportunities to use such system. in this research intermediate dual system of steel moment frame was chosen with int...

A conjugate code pair is defined as a pair of linear codes such that one contains the dual of the other. The conjugate code pair represents the essential structure of the corresponding Calderbank-Shor-Steane (CSS) quantum code. It is argued that conjugate code pairs are applicable to quantum cryptography in order to motivate studies on conjugate code pairs.

A conjugate code pair is defined as a pair of linear codes either of which contains the dual of the other. A conjugate code pair represents the essential structure of the corresponding Calderbank-Shor-Steane (CSS) quantum code. It is known that conjugate code pairs are applicable to (quantum) cryptography. We give a construction method for efficiently decodable conjugate code pairs.