This paper discusses the implementation of the binary coding scheme and its comparison with the post-order, preorder and in-order traversal techniques to test for ancestor-descendant relationships in k-ary trees (a tree in which any leaf node has up to k children). The approach used is assigning a unique binary code to each node in a tree. The value of the binary code for a node is the concaten...

Enforcing open source licenses such as the GNU General Public License (GPL), analyzing a binary for possible vulnerabilities, and code maintenance are all situations where it is useful to be able to determine the source code provenance of a binary. While previous work has either focused on computing binary-to-binary similarity or source-to-source similarity, BinPro is the first work we are awar...

With the increase of software complexity, security threats faced by are also increasing day day. So people pay more and attention to mining vulnerabilities. Although source code has rich semantics strong comprehensibility, vulnerability been widely used achieved significant development. However, due protection commercial interests intellectual property rights, it is difficult obtain code. There...

For every n = 2 k ≥ 16 there exist exactly ⌊(k + 1)/2⌋ mutually nonequiv-alent Z 4-linear extended perfect codes with distance 4. All these codes have different ranks. Codes represented in such a manner are called Z 4-linear. In [5] it is shown that the extended Golay code and the extended Hamming (n, 2 n−log 2 n−1 , 4)-codes (of length n and cardinality 2 n−log 2 n−1 , with distance 4) for eve...

Abstract Civil receivers of Global Navigation Satellite System (GNSS) are vulnerable to spoofing and jamming attacks due their signal structures. The Spreading Code Authentication (SCA) technique is one the GNSS message encryption identity authentication techniques. Its robustness complexity in between Message (NMA) Encryption (NME)/Spreading (SCE). A commonly used spreading code inserts unpred...