A new high rate binary linear block code construction technique, named as Geometric Construction (GC) codes, was proposed recently [1]. It generates all the even full information rate (optimal) Hamming distance – 4 codes. In this paper, we have enhanced the construction of GC codes with respect to code rate and derived a code family of hamming distance-8 GC codes.

Almost all triangle mesh compression algorithms to date are driven by the mesh connectivity code. The geometry code usually employs a straightforward prediction method applied to the vertex sequence as dictated by the connectivity code. This generates a suboptimal geometry code, which results in significant loss in code efficiency, since the geometry dominates the mesh information content. This...

This paper presents a numerical solution for a changing combustor geometry. The effects of the geometric change on the main parameters of the chamber are considered. For this purpose the original geometry and the new one are simulated numerically by a 3-D CFD code and the results are compared. Finally, comments are presented regarding this change. A model is used for turbulence modeling and a...

This paper presents a numerical solution for a changing combustor geometry. The effects of the geometric change on the main parameters of the chamber are considered. For this purpose the original geometry and the new one are simulated numerically by a 3-D CFD code and the results are compared. Finally, comments are presented regarding this change. A model is used for turbulence modeling and a...

Data dependence analysis for automatic parallelization of sequential tree codes is discussed. Hierarchical numerical algorithms often use tree data structures for unbalanced, adaptively and dynamically created trees. Moreover, such codes often do not follow a strict divide and conquer concept, but introduce some geometric neighborhood data dependence in addition to parent-children dependencies....

An infinite series of curves is constructed in order to show that all linear codes can be obtained from curves using Goppa's construction. If one imposes conditions on the degree of the divisor used, then we derive criteria for linear codes to be algebraic-geometric. In particular, we investigate the family of q-ary Hamming codes, and prove that only those with redundancy one or two, and the bi...

We present a new class of array codes based on a generalization of the RAID5 XOR parity code. The R5X0(n, r, p) code protects an array of n data disks and p parity disks with r symbols per column from as many as p arbitrary column erasures. Decoding and encoding in R5X0 is computed using only XOR and cyclic shift operations. R5X0 is a simple geometric generalization of RAID5 and has optimal upd...

We introduce the notion of quadratic hull a linear code, and give some its properties. then show that any symmetric bilinear multiplication algorithm for finite-dimensional algebra over field can be obtained by evaluation-interpolation at simple points (i.e. degree multiplicity 1) on naturally associated space, namely corresponding code. This also provides geometric answer to questions such as:...