Software code cache employed to store translated or optimized codes, amortizes the overhead of dynamic binary translation via reusing of stored-altered copies of original program instructions. Though many conventional code cache managements, such as Flush, Least-Recently Used (LRU), have been applied on some classic dynamic binary translators, actually they are so unsophisticated yet unadaptabl...

In this study, the focus was on the use of ternary tree over binary tree. Here, a new one pass Algorithm for Decoding adaptive Huffman ternary tree codes was implemented. To reduce the memory size and fasten the process of searching for a symbol in a Huffman tree, we exploited the property of the encoded symbols and proposed a memory efficient data structure to represent the codeword length of ...

A method of constructing binary linear codes is presentedthat have a minimum Hamming distance of five. Some efficient newcodes are obtained. In particular, a (47,36,5) code is obtained that hassix more information bits than the best previously known code with 11check bits.In Section II, we propose a general formulation of paritycheck matrix for the desired code. We then ...

A popular approach to solving multiclass learning problems is to reduce them to a set of binary classification problems through some output code matrix: the widely used one-vs-all and all-pairs methods, and the error-correcting output code methods of Dietterich and Bakiri (1995), can all be viewed as special cases of this approach. In this paper, we consider the question of statistical consiste...

Given a target binary function, the code search retrieves top-K similar functions in repository, and represent that they are compiled from same source codes. Searching is particularly challenging due to large variations of compiler tool-chains options CPU architectures, as well thousands Furthermore, there some pivotal issues current schemes, including inaccurate text-based or token-based analy...

Polar codes have received increasing attention in the past decade, and have been selected for the next generation of wireless communication standard. Most research on polar codes has focused on codes constructed from a 2×2 polarization matrix, called binary kernel: codes constructed from binary kernels have code lengths that are bound to powers of 2. A few recent works have proposed constructio...