Search

Let X be an n-element point set in the k-dimensional unit cube [ 0 , 1 ] k where k ≥ 2 . According to an old result of Bollobás and Meir (Oper Res Lett 11:19–21, 1992) , there exists a cycle (tour) x 1 , x 2 , ... , x n through the n points, such that ∑ i = 1 n | x i - x i + 1 | k 1 / k ≤ c k , where | x - y | is the Euclidean distance between x and y, and c k is an absolute constant that depends only on k, where x n + 1 ≡ x 1 . From the other direction, for every k ≥ 2 and n ≥ 2 , there exist n points in [ 0 , 1 ] k , such that their shortest tour satisfies ∑ i = 1 n | x i - x i + 1 | k 1 / k = 2 1 / k · k . For the plane, the best constant is c 2 = 2 and this is the only exact value known. Bollobás and Meir showed that one can take c k = 9 2 3 1 / k · k for every k ≥ 3 and conjectured that the best constant is c k = 2 1 / k · k , for every k ≥ 2 . Here we significantly improve the upper bound and show that one can take c k = 3 5 2 3 1 / k · k or c k = 2.91 k (1 + o k (1)) . Our bounds are constructive. We also show that c 3 ≥ 2 7 / 6 , which disproves the conjecture for k = 3 . Connections to matching problems, power assignment problems, related problems, including algorithms, are discussed in this context. A slightly revised version of the Bollobás–Meir conjecture is proposed. [ABSTRACT FROM AUTHOR]

Present manuscript designs and analyzes numerically all-optical binary-to-gray code (BTGC) converter utilizing silicon microring resonator. A waveguide-based silicon microring resonator has been employed to achieve optical switching under low-power conditions using the two-photon absorption effect. Gray code (GC) is a binary numerical system in which two consecutive codes distinguished by only one bit. The GC is critical in optics communication because it prevents spurious output from optical switches and facilitates error correction in optical communications. MATLAB is used to design and analyze the architecture at almost 260 Gbps operational speed. The faster response times and compact design of the demonstrated circuits make them especially useful for optical communication systems. Performance indicating factors evaluated from MATLAB results and analyzed. Design parameters that are optimized have been chosen in order to construct the model practically. [ABSTRACT FROM AUTHOR]

In this paper, we study mixed alphabet codes over two alphabets Z2, and its extension Z2[u] = Z2 + uZ2, u2 = 0. We define new Gray maps, using which we study cyclic codes and obtain the properties of their generators. Further, we construct constacyclic codes, and linear codes, and observe the useful properties of their generators. Finally, we present some examples of cyclic codes and binary linear codes. [ABSTRACT FROM AUTHOR]

This article proposes a method for preprocessing fragments of binary program codes for subsequent detection of their similarity using machine learning methods. The method is based on the analysis of pseudocode obtained as a result of decompiling fragments of binary codes. The analysis is performed using attributed abstract syntax trees (AASTs). As part of the study, testing and comparative analysis of the effectiveness of the developed method are carried out. This method makes it possible to increase the efficiency of detecting functionally similar fragments of program code, compared to analogs, by using the semantic context of vertices in abstract syntax trees. [ABSTRACT FROM AUTHOR]

This paper describes a methodological analysis of the Brillouin precursor formation to understand the impairments undergone by like-noise and random noise waveforms propagating through naturally dispersive media commonly found in radar applications. By means of a frequency-domain methodology based on considering the frequency response of the medium under study, the effect of these dispersive media on the evolution of an input signal can be seen as frequency filtering. The simulations were performed at a center frequency of 1.5 GHz and for a signal bandwidth of 3 GHz. Four random noise signals were considered: Barker codes, PRBS codes, Frank codes, Costas codes and additive white Gaussian noise. The experienced impairments were assessed in terms of cross-correlation function (CCF) degradation. The differences in the behavior of each type of phase and frequency coded signal to face the dispersive propagation have been demonstrated in terms of parameters used for information retrieval: peak amplitude decay, CCF secondary sidelobe level and multipath detectability. Finally, a frequency filtering approach is proposed to mitigate the impairments due to dispersive propagation under multipath conditions. [ABSTRACT FROM AUTHOR]

BL-algebraic models are examined in this research, and an algorithm based on the supplied code is introduced. A BL-algebra-based rendering algorithm is also demonstrated. A BL-algebra structure can be used to estimate the Hamming distance and dimension in conjunction with the given code because the algorithm's mechanism is strongly related to the parity check matrix. We present and demonstrate some theorems which determine some properties of these codes on BL-algebras. [ABSTRACT FROM AUTHOR]

Copyright of Cyber Security & Data Governance is the property of Editorial Office of Information Technology & Network Security and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Binary code similarity detection has been widely used in vulnerability searching,malware detection,advanced program analysis and other fields in recent years,while program code is similar to natural language in a degree,researchers start to use pre-training and other natural language processing related technologies to improve accuracy.A binary code similarity detection method based on pre-training assembly instruction representation is proposed to deal with the accuracy bottleneck due to insufficient consideration of instruction probability features.It includes tokenization method for multi-arch assembly instructions,and pre-trai-ning tasks that considering control flow,data flow,instruction logic and probability of occurrence,to achieve better vectorized representation of instructions.Downstream binary code similarity detection task is improved by combining pre-training method to gain accuracy boost.Experiments show that,compared with the existing methods,the proposed method improves instruction representing performance by 23.7% at the maximum,and improves block searching ability and similarity detection performance by up to 33.97% and 400% respectively.

A set of words X is not primitivity-preserving if there is a primitive list of length at least two of elements from X whose concatenation is imprimitive. Here, a word or list is primitive if it is not equal to a concatenation of several copies of a shorter word or list, and imprimitive otherwise. We formalize a full characterization of such two-element sets { x , y } in the proof assistant Isabelle/HOL. The formalization is based on an existing proof which we analyze and simplify using some innovative ideas. Part of the formalization, interesting on its own, is a description of the ways in which the square xx can appear inside a concatenation of words x and y if y ≤ x . We also provide a formalized parametric solution of the related equation x j y k = z ℓ . [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The recovery of contextual meanings on a machine code is required by a wide range of binary analysis applications, such as bug discovery, malware analysis, and code clone detection. To accomplish this, advancements on binary code analysis borrow the techniques from natural language processing to automatically infer the underlying semantics of a binary, rather than replying on manual analysis. One of crucial pipelines in this process is instruction normalization, which helps to reduce the number of tokens and to avoid an out-of-vocabulary (OOV) problem. However, existing approaches often substitutes the operand(s) of an instruction with a common token (e. g., callee target $\rightarrow $ FOO), inevitably resulting in the loss of important information. In this paper, we introduce well-balanced instruction normalization (WIN), a novel approach that retains rich code information while minimizing the downsides of code normalization. With large swaths of binary code, our finding shows that the instruction distribution follows Zipf’s Law like a natural language, a function conveys contextually meaningful information, and the same instruction at different positions may require diverse code representations. To show the effectiveness of WIN, we present DEEP SEMANTIC that harnesses the BERT architecture with two training phases: pre-training for generic assembly code representation, and fine-tuning for building a model tailored to a specialized task. We define a downstream task of binary code similarity detection, which requires underlying code semantics. Our experimental results show that our binary similarity model with WIN outperforms two state-of-the-art binary similarity tools, DeepBinDiff and SAFE, with an average improvement of 49.8% and 15.8%, respectively.

In recent years, the number and scale of malicious codes have grown exponentially, posing an increasing threat to cybersecurity. Hence, it is of great research value to quickly identify variants of malware and master their family information. Binary code similarity detection, as a key technique in reverse analysis, plays an indispensable role in malware analysis. However, most existing methods focus on similarity at the function or basic block level, ignoring the modular composition of malware. Implementing similarity detection among malware modules would greatly improve the efficiency and accuracy of homology detection. Inspired by the successful application of deep-learning techniques in program analysis, we propose a binary code module similarity detection method called ModDiff. It abstracts malware into attribute graphs, clusters functions using graph-embedded clustering algorithms to decompose malware into function-based modules, and calculates module similarity using graph-matching algorithms and natural language processing-based function similarity detection algorithms. The experimental results indicated that ModDiff improves the accuracy of module partitioning by 10.8% compared with previous work, and the highest F1 score of 89% is achieved in malware homologation detection. These results demonstrate the effectiveness of ModDiff in detecting and analyzing malware with important application value and development prospects. [ABSTRACT FROM AUTHOR]

Image retrieval with relevant feedback on large and high-dimensional image databases is a challenging task. In this paper, we propose an image retrieval method, called BCFIR (Binary Codes for Fast Image Retrieval). BCFIR utilizes sparse discriminant analysis to select the most important original feature set, and solve the small class problem in the relevance feedback. Besides, to increase the retrieval performance on large-scale image databases, in addition to BCFIR mapping real-valued features to short binary codes, it also applies a bagging learning strategy to improve the ability general capabilities of autoencoders. In addition, our proposed method also takes advantage of both labeled and unlabeled samples to improve the retrieval precision. The experimental results on three databases demonstrate that the proposed method obtains competitive precision compared with other state-of-the-art image retrieval methods. [ABSTRACT FROM AUTHOR]

Linear codes with complementary dual (LCD codes) play an important role in armoring implementations against side-channel attacks and fault injection attacks. Hermitian LCD codes are a special class of LCD codes, which were proved to be asymptotically good. In this paper, several classes of optimal quaternary Hermitian LCD codes are constructed via constacyclic codes. The binary images of these classes of quaternary Hermitian LCD codes are characterized. Several classes of optimal binary LCD codes with minimum distance 6, and optimal binary linear codes with one-dimensional hull and minimum distance 6 are also presented. [ABSTRACT FROM AUTHOR]

This work solves the problem of identification of the machine code architecture in cyberphysical devices. A basic systematization of the Executable and Linkable Format and Portable Executable formats of programs, as well as the analysis mechanisms used and the goals achieved, is made. An ontological model of the subject area is constructed, introducing the basic concepts and their relationships. The specificity of the machine code is analyzed, and an analytical record of the process of identifying the architecture of the machine code (MC) processor is obtained. A method for identifying the MC architecture has been synthesized, which includes three successive phases: unpacking the OS image (for a set of identified architectures); building signatures of architectures (their "digital portraits" from the position of MC instructions); identification of the MC architecture for the program under test (using the collected architecture signatures), implemented using four operating modes. A software tool for identifying the MC architecture has been developed in the form of a separate utility that implements the algorithms of the method. The principle of operation of the utility is presented in the form of functional and informational diagrams. Basic testing of the identification utility has been conducted. As a result, a probabilistic assessment of the utility's work was obtained by assigning various programs to the Top-16 selected architectures. [ABSTRACT FROM AUTHOR]

Technologies of communication condition human sense-making. They do so by creating the social environment we inhabit and extending their structural biases and logics through human use. As such, this essay inquires into the prevailing habits of mind in the digital era. Employing a media ecology of communication, I argue that digital computers and microprocessors are defined by three structural properties and, hence, underlying logics: digitization (binary code), algorithmic execution (input/output), and efficiency (machine logic). Repeated exposure to these logics cultivates a digital mind, a model of thinking, communicating, and sense-making characterized by intransigence, impertinence, and impulsivity. I conclude the essay by exploring the broader implications of a digital mind, paying particular attention to the challenges it poses to democratic politics. [ABSTRACT FROM AUTHOR]

Let m = 8 k and α be a primitive element of the finite field G F (2 m) , where k ≥ 2 is an integer. In this paper, a class of binary cyclic codes C (u , v) of length 2 m - 1 with two nonzeros α - u and α - v is studied, where (u , v) = (1 , (2 m - 1) / 17) . It turns out that C (u , v) has parameters [ 2 m - 1 , 2 m - m - 9 , 4 ] and is distance-optimal with respect to the Sphere Packing bound. The weight distribution of the dual of C (u , v) is also completely determined based on some results on Gaussian periods. [ABSTRACT FROM AUTHOR]

Background. Modern sensors as sources of information determine the level of quality of informationmeasuring and control systems of complex industrial-technological objects, especially in such science-intensive fields as power engineering, aviation, rocket-space technology, weapons and military equipment, etc. One of the tasks in the development of rocket-space systems is the measurement and control of movements of mechanical systems. The existing displacement sensors are not capable of simultaneous measurement of angular and linear movements. To solve this problem a displacement sensor was developed, which has extended functionality and is able to measure linear and angular movements simultaneously. Materials and methods. The amplitude-logic method of processing modulated signals from a raster displacement sensor was used in this work. In the course of the work, a design diagram of a multifunctional displacement sensor and a schematic diagram of the secondary converter were developed. Results. As a result of the conducted research, the possibility of creating a multifunctional displacement sensor capable of working in a wide temperature range of 20 ÷ 600 ℃, capable of simultaneously measuring linear and angular movements was confirmed.

This paper describes a methodological analysis of the Brillouin precursor formation to understand the impairments undergone by like-noise and random noise waveforms propagating through naturally dispersive media commonly found in radar applications. By means of a frequency-domain methodology based on considering the frequency response of the medium under study, the effect of these dispersive media on the evolution of an input signal can be seen as frequency filtering. The simulations were performed at a center frequency of 1.5 GHz and for a signal bandwidth of 3 GHz. Four random noise signals were considered: Barker codes, PRBS codes, Frank codes, Costas codes and additive white Gaussian noise. The experienced impairments were assessed in terms of cross-correlation function (CCF) degradation. The differences in the behavior of each type of phase and frequency coded signal to face the dispersive propagation have been demonstrated in terms of parameters used for information retrieval: peak amplitude decay, CCF secondary sidelobe level and multipath detectability. Finally, a frequency filtering approach is proposed to mitigate the impairments due to dispersive propagation under multipath conditions.

Binary code similarity measurement is a popular research area in binary analysis with the recent development of deep learning-based models. Current state-of-the-art methods often use the pre-trained language model (PTLM) to embed instructions into basic blocks as representations of nodes within a control flow graph (CFG). These methods will then use the graph neural network (GNN) to embed the whole CFG and measure the binary similarities between these code embeddings. However, these methods almost directly treat the assembly code as a natural language text and ignore its code-specific features when training PTLM. Moreover, They barely consider the direction of edges in the CFG or consider it less efficient. The weaknesses of the above approaches may limit the performances of previous methods. In this paper, we propose a novel method called function similarity using code-specific PPTs and order-sensitive GNN (FUSION). Since the similarity of binary codes is a symmetric/asymmetric problem, we were guided by the ideas of symmetry and asymmetry in our research. They measure the binary function similarity with two code-specific PTLM training strategies and an order-sensitive GNN, which, respectively, alleviate the aforementioned weaknesses. FUSION outperforms the state-of-the-art binary similarity methods by up to 5.4% in accuracy, and performs significantly better. [ABSTRACT FROM AUTHOR]

Copyright of Telecommunication Engineering is the property of Telecommunication Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Accurate localization is a critically important issue for autonomous vehicles as it is closely related to the safety and efficiency of autonomous driving. However, current technologies for autonomous vehicle localization face many challenges. To provide accurate and robust localization services to autonomous vehicles, we propose a novel solution by employing a newly designed pavement marking. This marking operates on color contrast, temperature contrast, and binary code with some special features. We also trained and customized an object detector based on a deep learning model: YOLOv5, and integrated it with the decoding algorithm. The localization system is capable of running at a steady frame rate of more than 50 FPS. Road trials up to 80 km/h were conducted, and satisfactory results confirmed the feasibility and robustness of the localization system. Specifically, with a common onboard camera, more than four continuous frames can be detected and decoded correctly when the speed is slower than 30 km/h. At least one frame can be detected and decoded correctly at a higher speed (i.e., 30– 50 km/h). With a high-speed camera, more than 18 frames can be detected and decoded even at 80 km/h. The findings suggest that the specially designed road marking and associated algorithms can provide a viable and economical option for accurate localization of autonomous vehicles. The performance of the system has potentials for further improvement by using better hardware such as faster CPUs, GPUs, and thermal imaging techniques. [ABSTRACT FROM AUTHOR]

Locality sensitive hashing (LSH), one of the most popular hashing techniques, has attracted considerable attention for nearest neighbor search in the field of image retrieval. It can achieve promising performance only if the number of the generated hash bits is large enough. However, more hash bits assembled to the binary codes contain massive redundant information and require more time cost and storage spaces. To alleviate this limitation, we propose a novel bit selection framework to pick important bits out of the hash bits generated by hashing techniques. Within the bit selection framework, we further exploit eleven evaluation criteria to measure the importance and similarity of each bit generated by LSH, so that the bits with high importance and less similarity are selected to assemble new binary codes. To demonstrate the effectiveness of the proposed framework of bit selection, we evaluated the proposed framework with the evaluation criteria on five commonly used data sets. Experimental results show the proposed bit selection framework works effectively in different cases, and the performance of LSH has not been degraded significantly after redundant hash bits reduced by the evaluation criteria. [ABSTRACT FROM AUTHOR]

To solve the sparse channel estimation problem in Orthogonal Frequency Division Multiplexing (OFDM) systems, this paper presents a pilot design algorithm based on multi-pilot parallel searching and binary coding. Under the Mutual Incoherence Property (MIP), we consider the deterministic pilot design problem by minimizing the coherence of the dictionary matrix. The pilot is also required to be placed within the effective subcarrier range for more practical purposes. In this scheme, the pilot set is binary coded. In each iteration, the sequence of the binary code segment is recombined to update the approximately optimal pilot position. The update of some coding segments can change multiple pilot positions at the same time. It can increase the diversity of pilots, and reduce the complexity of computation. Experimental results show that, compared with the existing pilot optimization methods, this algorithm can find a smaller MIP measurement matrix. Therefore, the corresponding pilot mode can significantly improve the performance of channel estimation.

To solve the sparse channel estimation problem in Orthogonal Frequency Division Multiplexing (OFDM) systems, this paper presents a pilot design algorithm based on multi-pilot parallel searching and binary coding. Under the Mutual Incoherence Property (MIP), we consider the deterministic pilot design problem by minimizing the coherence of the dictionary matrix. The pilot is also required to be placed within the effective subcarrier range for more practical purposes. In this scheme, the pilot set is binary coded. In each iteration, the sequence of the binary code segment is recombined to update the approximately optimal pilot position. The update of some coding segments can change multiple pilot positions at the same time. It can increase the diversity of pilots, and reduce the complexity of computation. Experimental results show that, compared with the existing pilot optimization methods, this algorithm can find a smaller MIP measurement matrix. Therefore, the corresponding pilot mode can significantly improve the performance of channel estimation.

Copyright of Przegląd Elektrotechniczny is the property of Przeglad Elektrotechniczny and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

An innovative "Multiplexer based Thermometer to Binary code encoder" is presented in this paper. This paper shows a relative decrease in the total count of multiplexers used which eventually reduces the no of transistors used when compared to traditional Architectures. The requirement for further more inverters is also eliminated in the proposed model. The input thermometer code is at first is converted to the respective gray code with the help of 2:1 multiplexer. Thereafter, using two-input XOR gates the conversion process of gray code to respective binary codes takes place. Outcomes of simulation reveal that there is an approximately 80% decrease in the power consumption which is a great reduction actually when differentiated with previously known and current encoder architectures with the delay being reduced from 0.472ps to 0.366 ps. This throws a light on modern power-saving encoder architectures and has a greater significance in the future. The proposed encoder gives a better application for future generation advanced ADC & related circuits. [ABSTRACT FROM AUTHOR]

In this work, we explore the relationship between the graded free resolution of some monomial ideals and the Generalized Hamming Weights (GHWs) of binary codes. More precisely, we look for a structure that is smaller than the set of codewords of minimal support that provides us with some information about the GHWs. We prove that the first and second generalized Hamming weights of a binary linear code can be computed (by means of a graded free resolution) from a set of monomials associated with a binomial ideal related with the code. Moreover, the remaining weights are bounded above by the degrees of the syzygies in the resolution. [ABSTRACT FROM AUTHOR]

For positive integers k ≥ 2 and t, let m = 2kt and α be a primitive element of the finite field F 2 m . In this paper, we study the parameters of a class of cyclic codes C (1 , v) which has two zeros α and αv with v = 2 m − 1 2 t + 1 . It is shown that C (1 , v) is optimal or almost optimal with respect to the sphere packing bound. Based on some results of Kloosterman sums and Gaussian periods, the weight distribution of the dual code of C (1 , v) is completely determined when t = 5. [ABSTRACT FROM AUTHOR]

Binary sequences are widely used in many practical fields, such as radar applications, telecommunications and cryptography. Finding low autocorrelation binary sequences with good peak side-lobe level (PSL) values is a difficult optimization problem. In this paper we present an improved heuristic algorithm for searching low autocorrelation PSL sequences. A heuristic algorithm can find a sequence with a PSL value, which is not necessarily optimal, but is usually near optimal, and the algorithm finds it in a reasonable amount of time. In the experimental work we applied our algorithm to find binary sequences with low PSL values, and made a comparison with the state-of-the-art algorithms from literature. With our algorithm many sequences with the currently best-known PSL values have been improved. We found new sequences with better, i.e., lower, PSL values.

This work solves the problem of identification of the machine code architecture in cyberphysical devices. A basic systematization of the Executable and Linkable Format and Portable Executable formats of programs, as well as the analysis mechanisms used and the goals achieved, is made. An ontological model of the subject area is constructed, introducing the basic concepts and their relationships. The specificity of the machine code is analyzed, and an analytical record of the process of identifying the architecture of the machine code (MC) processor is obtained. A method for identifying the MC architecture has been synthesized, which includes three successive phases: unpacking the OS image (for a set of identified architectures); building signatures of architectures (their “digital portraits” from the position of MC instructions); identification of the MC architecture for the program under test (using the collected architecture signatures), implemented using four operating modes. A software tool for identifying the MC architecture has been developed in the form of a separate utility that implements the algorithms of the method. The principle of operation of the utility is presented in the form of functional and informational diagrams. Basic testing of the identification utility has been conducted. As a result, a probabilistic assessment of the utility’s work was obtained by assigning various programs to the Top-16 selected architectures.

Technologies of communication condition human sense-making. They do so by creating the social environment we inhabit and extending their structural biases and logics through human use. As such, this essay inquires into the prevailing habits of mind in the digital era. Employing a media ecology of communication, I argue that digital computers and microprocessors are defined by three structural properties and, hence, underlying logics: digitization (binary code), algorithmic execution (input/output), and efficiency (machine logic). Repeated exposure to these logics cultivates a digital mind, a model of thinking, communicating, and sense-making characterized by intransigence, impertinence, and impulsivity. I conclude the essay by exploring the broader implications of a digital mind, paying particular attention to the challenges it poses to democratic politics.

In this paper, a binary to gray code converter based on graphene-plasmonic waveguides using the interference effect is proposed. The plasmonic waveguides are made of graphene nano-ribbons located on the dielectric layer. The use of graphene leads to high confinement of light, relatively low losses, and working in the mid-infrared to THz region. Based on the proposed structure, two-bit and three-bit binary to gray code converters are designed and their performance is evaluated using the finite-difference time-domain (FDTD) method. The calculated values of extinction ratio (ER) for two-bit converter are 7.22 dB and 14.83 dB for G0 and G1 bits and 8.82 dB, 5.72 dB, and 11.27 dB for G0, G1, and G2 bits in the three-bit converter. Time responses indicate the high performance of the proposed converters. Moreover, the dimensions of the two-bit and three-bit structures are 2.6 µm2 and 4 µm2, respectively, representing the high potential of these devices for use in integrated photonic systems. It is worthy to note that the converters with more bits can also be implemented using the proposed structure. [ABSTRACT FROM AUTHOR]

Let A (n , d) be the size of the maximum binary code of length n and minimum Hamming distance d. A (n , d , w) is defined similarly for binary code with constant weight w. Obviously, finding the value of A (n , d) is equivalent to finding the maximum independent set of the d − 1 th-power of n -dimensional hypercube. Based on this, this paper obtains that A (3 m , 2 m) = 4 , A (m (m + 1) 2 , 2 m − 2 , m) = m + 1 , A (2 m + 1 − 2 , 2 m − 1) = 2 m + 1 , and explores the structure of the maximum code of length 2 m + 2 and minimum Hamming distance 2 m + 1 , where m is an integer. [ABSTRACT FROM AUTHOR]

The next generation of non-volatile memory elements have been attracting significant attention for future emerging memory applications in recent years. Several technologies have been developed to occupy a new field in storage-class memory and even replace NAND flash memories in sequential logic applications, due to their advantageous features such as fast programming time, low power consumption, high endurance and retention. Latch topologies have been proposed to implement these new technologies. In this article, we present new non-volatile Latch topology. We focus on a D Latch topology that uses memristors as memory elements combined with CMOS components. The memristor device has been implemented using an accurate Verilog-A model exploring the experimental data of a real OxRRAM device. Our simulation results explore low-voltage and reliable non-volatile Latch designs. Indeed, we integrate this Latch design to behave as a counter application using both binary and Gray codes. Moreover, this topology has been compared with other non-volatile topologies in terms of power consumption, cell size, energy, programing time and robustness at different programming voltage values. We proved that the memristor-based Latch has non-volatile characteristics and is able to store data. [ABSTRACT FROM AUTHOR]

Copyright of Study on Optical Communications / Guangtongxin Yanjiu is the property of Study on Optical Communications Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)