Johnsen, Roksvold and Verdure have shown how fundamental invariants concepts of linear coding theory, such as weight enumerators higher weights, can be studied in the context matroid theory. They that Betti numbers, a its elongations, associated to code, determine both enumerator weights matroid. In same vein, Britz, Mayhew Shiromoto, introduced demimatroids natural generalization matroids. are...

Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogously defined. First, we prove that there is a language in AC such that both Hamming and edit distance to this language are hard to approximate; they cannot be approximated with factor O(n 1 3 − ), for any > 0, unless P =...

In this article, new techniques and technologies have been tried and tested in the installation and commissioning of Roller Home industrial robots, in order to produce a Tiba car with a focus on cost reduction. Due to the fact that press equipment for automobile parts requires a lot of expenses, it was decided to use robots with the same function of roller to reduce costs and increase the q...

Background: In myocardial perfusion SPECT imaging, images are degraded by photon attenuation, the distance-dependent collimator, detector response and photons scatter. Filters greatly affect quality of nuclear medicine images Materials and Methods: A phantom simulating heart left ventricle was built. About 1mCi of 99mTc was injected into the phantom. Images were taken from this phantom. Some fi...

In this paper we find some bounds for the relative generalized Hamming weights of some codes parameterized by a set of monomials of the same degree. Also we compare the relative generalized Hamming weights of the codes CX(d) and CX′(d) when X ′ is embedded in X. We use these results to obtain some lower bounds for the relative generalized Hamming weights of the codes parameterized by the edges ...

(June 15, 2016.) FIX: June 15, 2016. This needs to be re-written. Monomial transformations of linear codes are linear isometries for the Hamming weight. A code alphabet has the extension property for the Hamming weight when every linear isometry between codes extends to a monomial transformation. MacWilliams proved that finite fields have the extension property for the Hamming weight. In contra...

The capability of multilevel input ring-TCM coding scheme for generating high-rate codes with improved symbol Hamming and squared Euclidean distances is demonstrated. The existence of uniform codes and the decoder complexity are also considered.

In this paper, we reduce computation time of elliptic curve signature verification scheme by proposing the minimal joint Hamming weight conversion for any binary expansions of d integers. The computation time of multi-scalar multiplication, the bottleneck operation of the scheme, strongly depends on the joint Hamming weight. As we represent the scalars using redundant representations, we may re...