in this article, we tried to emphasis in how the range of torsionally stiff and flexible single story buildings works. the designed base was according to provisions of the canadian standard, 2005 nbcc. the behavior of nonlinear dynamic time history of eight building models subjected to seven horizontal bi-directional ground motions compatible with design spectra are investigated. these models c...

Two families of complementary codes over finite fields q are studied, where 2 = q r is square: i) Hermitian complementary dual linear codes, and ii) trace Hermitian complementary dual subfield linear codes. Necessary and sufficient conditions for a linear code (resp., a subfield linear code) to be Hermitian complementary dual (resp., trace Hermitian complementary dual) are determined. Construct...

In this paper, we give a notation on the Singleton bounds for linear codes over a finite commutative quasi-Frobenius ring in the work of Shiromoto [5]. We show that there exists a class of finite commutative quasi-Frobenius rings. The Singleton bounds for linear codes over such rings satisfy d(C) − 1 A ≤ n− log|R| |C|. keywords : Linear codes, General weight, Quasi-Frobenius ring, Singleton bounds

Recently, linear codes constructed by defining sets have attracted a lot of study, and many optimal linear codes with a few weights have been produced. The objective of this paper is to present a class of binary linear codes with three weights.

Let X be an algebraic toric set in a projective space over a finite field. We study the vanishing ideal, I(X), of X and show some useful degree bounds for a minimal set of generators of I(X). We give an explicit combinatorial description of a set of generators of I(X), when X is the algebraic toric set associated to an even cycle or to a connected bipartite graph with pairwise vertex disjoint e...

The simple interpretation of the minimum distance of a linear code obtained by De Boer and Pellikaan, and later refined by the second author, is further developed through the study of various finitely generated graded modules. We use the methods of commutative/homological algebra to find connections between the minimum distance and the α-invariant of such modules.

In this paper, by using a new kind of geometric structures, we present some su/cient conditions to determine the weight hierarchies of linear codes satisfying the chain condition. c © 2002 Elsevier Science B.V. All rights reserved.

This paper gives two lossless speech compression schemes Hamming correction codes compressor (HCCC) and Systematic Linear Block Code Compressor (SLBC) based on error correcting Hamming code and systematic linear block codes respectively. Hamming codes are a family of linear errorcorrecting codes that can detect up to two-bit errors or correct one-bit errors. Systematic linear block code is any ...