We construct a record-breaking binary code of length 17, minimal distance 6, constant weight 6, and containing 113 codewords.

HOG features are effective for object detection, but their focus on local regions makes them highdimensional features. To reduce the memory required for the HOG features, this paper proposes a new feature, R-HOG, which creates binary codes from the HOG features extracted from two local regions. This approach enables the created binary codes to reflect the relationships between local regions. Co...

This paper describes a system that applies automatic parallelization techniques to binary code. The system works by raising raw executable code to an intermediate representation that exhibits all memory accesses and relevant register definitions, but outlines detailed computations that are not relevant for parallelization. It then uses an off-the-shelf polyhedral parallelizer, first applying ap...

The binary translator is a software component of a computer system. It converts binary code of one ISA into binary code of another ISA. Recent trends show that binary translators have been used to save CPU power consumption and CPU die size, which makes binary translators a possible indispensable component of future computer systems. And such situation would give new opportunities to the securi...

In [17] Turyn constructed the famous binary Golay code of length 24 from the extended Hamming code of length 8 (see also [10, Theorem 18.7.12]). The present note interprets this construction as a sum of tensor products of codes and uses it to construct certain new extremal (or at least very good) self-dual codes (for example an extremal doubly-even binary code of length 80). The lattice counter...

In this paper, we present a construction method of terminated non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an expansion of Felstrom and Zigangirov construction [1] for non-binary LDPC convolutional codes. The rate-compatibility of the non-binary LDPC convolutional codes is also discussed. The proposed ratecompatible code is designed from one single ...

In this paper, we present a construction method of non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an extension of Felström and Zigangirov construction [1] for non-binary LDPC convolutional codes. The rate-compatibility of the non-binary convolutional code is also discussed. The proposed rate-compatible code is designed from one single mother (2,4)-reg...

As the number and sophistication of attacks increase, static analysis gains attention. Since it is binary code that is executed directly on the bare-metal, binary-level static analysis offers root-cause approaches to security problems such as malware detection. In this survey, we start with the challenges to do binary-level static analysis and then transfer to the advantages of carrying out sta...