Local weight distribution is the weight distribution of minimal codewords in a linear code. We give the local weight distribution of the (256, 93) third-order binary Reed-Muller code. For the computation, a coset partitioning algorithm is modified by using a binary shift invariance property. This reduces the time complexity by about 1/256 for the code. A necessary and sufficient condition for m...

A k-bit Hamming prefix code is a binary code with the following property: for any codeword x and any prefix y of another codeword, both x and y having the same length, the Hamming distance between x and y is at least k. Given an alphabet A = [a1, . . . , an] with corresponding probabilities [p1, . . . , pn], the k-bit Hamming prefix code problem is to find a k-bit Hamming prefix code for A with...

The Binary Reflected Gray Code function b is defined as follows: If m is a nonnegative integer, then b(m) is the integer obtained when initial zeros are omitted from the binary reflected Gray code of length m. This paper examines this Gray code function and its inverse and gives simple algorithms to generate both. It also simplifies Conder’s result that the jth letter of the kth word of the bin...

Two sufficient conditions are given for the existence of binary fix-free codes. The results move closer to the Ahlswede-Balkenhol-Khachatrian conjecture that Kraft sums of at most suffice for the existence of fix-free codes. For each nonnegative integer let denote the set of all binary words of length , and let denote the set of all finite length binary words, including the empty word. A binary...

An automatic parallelizer is a tool that converts serial code to parallel code. This is an important tool because most hardware today is parallel and manually rewriting the vast repository of serial code is tedious and error prone. We build an automatic parallelizer for binary code, i.e. a tool which converts a serial binary to a parallel binary. It is important because: (i) most serial legacy ...

A binary code is called a superimposed cover-free $(s,\ell)$-code if the code is identified by the incidence matrix of a family of finite sets in which no intersection of $\ell$ sets is covered by the union of $s$ others. A binary code is called a superimposed list-decoding $s_L$-code if the code is identified by the incidence matrix of a family of finite sets in which the union of any $s$ sets...

Binary t-frameproof codes (t-FPCs) are used in multimedia fingerprinting schemes where the identification of authorized users taking part in the averaging collusion attack is required. In this paper, a binary strongly t-separable code (t-SSC) is introduced to improve such a scheme based on a binary t-FPC. A binary t-SSC has the same traceability as a binary t-FPC but has more codewords than a b...

The University of Queensland Binary Translator (UQBT ) is a static binary translation framework that allows for the translation of binary, executable programs, from one architecture to another one. Using different specification files, the UQBT can be easily tailored for either a new source or target architecture. UQBT employs sophisticated analyses in order to abstract the binary code from the ...

In this paper, we proposed an all optical 4-to-2 encoder that has 4 input and 3 output ports. This device generates a 2 bit binary code based on which input port is active. We used nonlinear photonic crystal ring resonators along with optical power splitter for realizing the proposed encoder. In this device the switching rate and area are obtained about 333 GHz and 612µm2 respectively.