An algorithm of Knuth for finding an optimal binary tree is extended in several directions to solve related problems. The first case considered is restricting the depth of the tree by some predetermined integer K, and a Kn algorithm is given. Next, for trees of degree tr, rather than binary trees, Kn log tr and n log tr algorithms are found for the restricted and nonrestricted cases, respective...

The authors state that, Algorithms 1 and 2 (on page 5), together with their explanations, were not correctly cited in the original article. The Algorithms are borrowed from the authors previously published work (which is a Master thesis co-supervised by Dr. Mourad Debbabi and Dr. Benjamin Fung). The correct citation for Algorithms 1 and 2 is listed below; Farhadi, MR. Assembly Code Clone Detect...

ion Recovery from Binary Code,” Proc. European Conf. Software Maintenance and Reengineering, IEEE CS Press, Los Alamitos, Calif., 2000, pp.55-64. 4. D. Ung and C. Cifuentes, “SRL—A Simple Retargetable Loader,” Proc. Australian Software Eng. Conf., IEEE CS Press, Los Alamitos, Calif., 1997, pp. 60-69.

Obfuscation is gaining momentum as a protection mechanism for the intellectual property contained within or encapsulated by software. Usually, one of the following three directions is followed: source code obfuscation is achieved through source code transformations, Java bytecode obfuscation through transformations on the bytecode, and binary obfuscation through binary rewriting. In this paper,...

Using integer linear programming and table-lookups we prove that there is no binary linear [1988, 12, 992] code. As a byproduct, the non-existence of binary linear [324, 10, 160], [356, 10, 176], [772, 11, 384], and [836, 11, 416] codes is shown. On the other hand, there exists a linear (994, 4, 992) code over Z4. Its Gray image is a binary non-linear (1988, 2, 992) code. Therefore, we can add ...

High rate binary coset codes are investigated. The binary coset(BC) code is a binary convolutional code with parallel path. In our previous research of concatenated trelliscoded modulation(TCM) scheme, we have found that the e ective minimum distance of inner code is more important than the minimum free distance when TCM is used as inner code. In this paper, for inner code, we construct the hig...

A Z2-triple cyclic code of block length (r,s, t) is a binary code of length r + s+ t such that the code is partitioned into three parts of lengths r, s and t such that each of the three parts is invariant under the cyclic shifts of the coordinates. Such a code can be viewed as Z2[x]-submodules of Z2[x] 〈xr−1〉 × Z2[x] 〈xs−1〉 × Z2[x] 〈xt−1〉 , in polynomial representation. In this paper, we determ...

A binary reflected Gray code (Gray code for short) is a one-to-one function G(i) of the integers 0 • i • 2 – 1 (for some pre-selected value of n) to binary numbers such that the binary number for G(i) and G(i+1) differ in exactly one bit. For example, with N = 3, the Gray codes (written in binary) are 000, 001, 011, 010, 110, 111, 101, 100. In this paper, we describe a dynamic programming algor...