In 2006, Danielsen and Parker [8] proved that every self-dual additive code over GF (4) is equivalent to a graph code. So, graph is an important tool for searching (proposed) optimum codes. In this paper, we introduce a new method of searching (proposed) optimum additive codes from circulant graphs. AMS Subject Classification 2010: 94B05, 05C50, 05C25.

As China enlarged the investment in agriculture, the agricultural scientific instruments promoted rapidly. It required us to face the questions scientifically such as the procurement, management, resources sharing, evaluation and etc. in agricultural scientific instruments. Because of the lack of unified classification and code standards, it greatly limited the scientific procurement, efficient...

Single-path code has some unique properties that make it interesting to explore different caching and prefetching alternatives for the stream of instructions. In this paper, we explore different cache organizations and how they perform with single-path code. 1998 ACM Subject Classification C.3 Real-Time and Embedded Systems

In this article, a differential construction for the dual of an algebraic-geometric code on a projective surface is given. Afterwards, this result is used to lower bound the minimum distance of this dual code. The found bounds involve intersection numbers of some particular divisors on the surface. AMS Classification: 14J20, 94B27, 11G25.

Authorship attribution assigns works of contentious authorship to their rightful owners solving cases of theft, plagiarism and authorship disputes in academia and industry. In this paper we investigate the application of information retrieval techniques to attribution of authorship of C source code. In particular, we explore novel methods for converting C code into documents suitable for retrie...

In this paper, we describe an approach for the automatic medical annotation task of the 2008 CLEF cross-language image retrieval campaign (ImageCLEF). The data comprise 12076 fully annotated images according to the IRMA code. This work is focused on the process of feature extraction from images and hierarchical multi-label classification. To extract features from the images we used a technique ...

We present a new classification scheme of the genetic code. In contrast to the standard form it clearly shows five codon symmetries: codon-anticodon, codon-reverse codon, and sense-antisense symmetry, as well as symmetries with respect to purine-pyrimidine (A versus G, U versus C) and keto-aminobase (G versus U, A versus C) exchanges. We study the number of tRNA genes of 16 archaea, 81 bacteria...

The Z2s -additive codes are subgroups of Z n 2s , and can be seen as a generalization of linear codes over Z2 and Z4. A Z2s -linear Hadamard code is a binary Hadamard code which is the Gray map image of a Z2s additive code. It is known that the dimension of the kernel can be used to give a complete classification of the Z4-linear Hadamard codes. In this paper, the kernel of Z2s -linear Hadamard...

Adinkras are a graphical depiction of representations of the N -extended supersymmetry algebra in one dimension, on the worldline. These diagrams represent the component fields in a supermultiplet as vertices, and the action of the supersymmetry generators as edges. In a previous work, we showed that the chromotopology (topology with colors) of an Adinkra must come from a doubly even binary lin...

Robust, static disassembly is an important part of achieving high coverage for many binary code analyses, such as reverse engineering, malware analysis, reference monitor in-lining, and software fault isolation. However, one of the major difficulties current disassemblers face is differentiating code from data when they are interleaved. This paper presents a machine learning-based disassembly a...