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...

A Z2Z4-additive code C ⊆ Z α 2 ×Z 4 is called cyclic if the set of coordinates can be partitioned into two subsets, the set of Z2 and the set of Z4 coordinates, such that any cyclic shift of the coordinates of both subsets leaves the code invariant. We study the binary images of Z2Z4-additive cyclic codes. We determine all Z2Z4-additive cyclic codes with odd β whose Gray images are linear binar...

A new lower bound on the error probability of maximum likelihood decoding of a binary code on a binary symmetric channel (BSC) was proved in Barg and McGregor (2004, cs.IT/0407011). It was observed in that paper that this bound leads to a new region of code rates in which the random coding exponent is asymptotically tight, giving a new region in which the reliability of the BSC is known exactly...

The asymptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids.

In this paper, we propose new binary complementary codes, which compress a pulse to a width of several sub-pulses, and survey all combinations of the binary complementary codes with several code lengths. We are able to find a large number of binary complementary codes and complete complementary codes. Furthermore, we show that longer such complementary codes can be acquired using the expansion ...

Binary translation is the process of translating machine code from one instruction set architecture to another. It can be done statically or dynamically, i.e., on the fly. Most binary translation systems have been tailored to a specific source-target architecture combination. There are currently three published machine-adaptable binary translation systems, one of which is dynamic. Because it us...

In this paper we consider reusability of software component binaries. Reuse of code at the binary level is important because usually only the machine code for system components is available; vendors do not want to share their source code for proprietary reasons. We develop necessary and sufficient conditions for ensuring that software binaries are reusable and relate them to the coding standard...

I t is shown t h a t in the r t h order binary Reed-Muller code of length N = 2" and m i n i m u m distance d = 2~-L the only code-words having weight between d and 2d are those with weights of the form 2d-2 t for some i. The same result also holds for certain super-codes of the R M codes. DEFI~ITm~<. T h e weight of an integer k, W(/~), is the n u m b e r of l's in the binary expansion of ]~. ...

A flip-swap language is a set \(\mathbf{S}\) of binary strings length n such that \(\mathbf{S} \cup \{0^n\}\) closed under two operations (when applicable): (1) Flip the leftmost 1; and (2) Swap 1 with bit to its right. Flip-swap languages model many combinatorial objects including necklaces, Lyndon words, prefix normal left factors k-ary Dyck feasible solutions 0-1 knapsack problems. We prove ...