Related papers: An Algorithm for Classification of Binary Self-Dua…
The problem of finding aperiodic low auto-correlation binary sequences (LABS) presents a significant computational challenge, particularly as the sequence length increases. Such sequences have important applications in communication…
A classification of Hadamard matrices of order $2p+2$ with an automorphism of order $p$ is given for $p=29$ and $31$. The ternary self-dual codes spanned by the newly found Hadamard matrices of order $60$ with an automorphism of order $29$…
A classical result of Conway and Pless is that a natural projection of the fixed code of an automorphism of odd prime order of a self-dual binary linear code is self-dual. In this paper we prove that the same holds for involutions under…
Although real-coded differential evolution (DE) algorithms can perform well on continuous optimization problems (CoOPs), it is still a challenging task to design an efficient binary-coded DE algorithm. Inspired by the learning mechanism of…
In this paper we study codes for correcting deletable errors in binary words, where each bit is either retained, substituted, erased or deleted and the total number of errors is much smaller compared to the length of the codeword. We…
Binary code analysis plays a pivotal role in the field of software security and is widely used in tasks such as software maintenance, malware detection, software vulnerability discovery, patch analysis, etc. However, unlike source code,…
Binary optimisation tasks are ubiquitous in areas ranging from logistics to cryptography. The exponential complexity of such problems means that the performance of traditional computational methods decreases rapidly with increasing problem…
Here we study an efficient algorithm for decoding the topological codes. It is based on a simple principle, which should allow straightforward generalization to complex decoding problems. It is benchmarked with the planar code for both…
Some properties of perfect transitive binary codes of length 15 and extended perfect transitive binary codes of length 16 are presented for reference purposes.
This paper introduces new technique for efficient calculation of different Shannon information measures which operates Binary Decision Diagrams (BDDs). We offer an algorithm of BDD reordering which demonstrates the improvement of the…
An algorithm for obtaining all n\times n binary matrices having exactly 2 units in every row and every column is described in the paper. After analysing the work of the algorithm a formula for calculating the number of these matrices has…
Boolean functions have very nice applications in cryptography and coding theory, which have led to a lot of research focusing on their applications. The objective of this paper is to construct binary linear codes with few weights from the…
Towards the vision of translating code that implements an algorithm from one programming language into another, this paper proposes an approach for automated program classification using bilateral tree-based convolutional neural networks…
The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and…
We consider recursive decoding techniques for RM codes, their subcodes, and newly designed codes. For moderate lengths up to 512, we obtain near-optimum decoding with feasible complexity.
This paper presents the first generic bi-objective binary linear branch-and-cut algorithm. Studying the impact of valid inequalities in solution and objective spaces, two cutting frameworks are proposed. The multi-point separation problem…
Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. These codes were first introduced by Massey in 1964. Nowadays, LCD codes are extensively studied in the…
Binary code clone analysis is an important technique which has a wide range of applications in software engineering (e.g., plagiarism detection, bug detection). The main challenge of the topic lies in the semantics-equivalent code…
We study the performance of ternary isodual codes which are not self-dual and ternary self-dual codes, as measured by the decoding error probability in bounded distance decoding. We compare the performance of ternary double circulant and…
An identifying code in a graph is a set of vertices which intersects all the symmetric differences between pairs of neighbourhoods of vertices. Not all graphs have identifying codes; those that do are referred to as twin-free. In this…