The rank distance was introduced in 1985 by E. Gabidulin [1]. He determined a lower bound for the minimum rank distance of a code. Moreover, he constructed a class of codes which meet this bound: the so-called Gabidulin codes. In this paper, we first characterize the linear isometries for the rank distance. Then we determine the isometry group and the permutation group of Gabidulin codes of ful...

Rows seats distance is a key parameter for the comfort on coaches. This distance it is also important for the passenger safety and also for example to extend the use of rearward facing CRS in a safer way. This study analyses what could be the minimum distance (based on comfort from volunteer) and how this comfort distance is affecting the passengers level of protection in R80 frontal impact wit...

A non-binary (2,v)-regular LDPC code is defined by a parity-check matrix with column weight 2 and row weight v. In this report, we give an ontology-based approach to the optimization for this class of codes. All possible inter-connected cycle patterns that lead to low symbol-weight codewords are identified to put together the ontology. The optimization goal is to improve the distance property o...

Graham et al. [3] proved a very attractive theorem about the determinant of the distance matrix DG of a connected graph G as a function of the distance matrix of its 2-connected blocks. In a connected graph, the distance between two vertices d(u, v) is the length of the shortest path between them. Let A be an n n matrix. Recall that for 1 i, j n, the cofactor ci,j is defined as ( 1) iþj times t...

there are varying patterns for growing different varieties of branched or non-branched sesame. this experiment was conducted during a two-year period (2000-2001) to identify the optimal practice for cultivation of the uni-branched sesame in the safi-abad agricultural research center, khuzestan province. the statistical design was set up as strip-plot in a randomized complete block with four rep...

This study presents different land saving and loss reducing schemes. Comprehensively compare the economic benefits of It is shown that optimal scheme can recover tons coal resources on south slope, creating significant benefits. Numerical simulation was utilized to analyze changes slope stability, deformation, shear strain increment in process reducing. Results found stability decreases rapidly...

We have found the first optimal solutions to random instances of the Twenty-Four Puzzle, the 5 x 5 version of the well-known sliding-tile puzzles. Our new contribution to this problem is a more powerful admissible heuristic function. We present a general theory for the automatic discovery of such heuristics, which is based on considering multiple subgoals simultaneously. In addition, we apply a...

Ex = (I + y / t) (l +. r y / : ') El0 = (1 + ! / / Z) (l + .r2y/:3) all R-multiples of Es. The error positions in this case are (j. 1. l) , In general, when decoding an error relative to an algebraic geometric code C*(D. 7rtP), there is a vector space S (g) l of error-locator functions of dimension Z(m)-e. Most algorithms settle for any element of this space as an error-locator and deal with ex...

The main purpose of this article is to introduce a new approach to Poisson approximation. Some bounds in Poisson approximation for probability distributions of a wide class of various arrays of row-wise independent discrete random variables are established via a probability distance. Some analogous results related to random sums in Poisson approximation are also considered.