Reversible Codes Research Articles

Con(dif)fused voice to convey secret: a dual-domain approach

Owing to the rapid development and advancements in the field of networks and communication, sharing of multimedia contents over insecure networks has become vital. The confidentiality of audio signals is predominantly needed in military and intelligence bureau applications. The proposed algorithm addresses this issue by encrypting audio signal using chaotic maps in spatial and transform domain. Discrete Fourier transform (DFT), discrete cosine transform (DCT) and integer wavelet transform (IWT) approaches are considered for the experiment. The algorithm involves three-layer security of confusion and diffusion in the spatial domain, and confusion in the transform domain. The confusion in the transform domain is equivalent to diffusion in the spatial domain. Different sizes of audio samples are considered to validate the effectiveness of the proposed scheme. Experimental results prove that the DFT-assisted encryption scheme is more efficient than the DCT- and IWT-based methods because the DFT scheme employs effective diffusion through reversible phase coding. Effectiveness of the proposed method is substantiated using various metrics. Correlation coefficients arrive significantly closer to zero; number of samples changes rate (NSCR) value is at 100% and scrambling degree close to 1. Besides, the proposed scheme has a larger keyspace higher than 2128. Thus, the proposed algorithm has the potency to withstand the statistical, differential and brute force attacks.

On Reversibility and Self-Duality for Some Classes of Quasi-Cyclic Codes

In this work, we study two classes of quasi-cyclic (QC) codes and examine how several properties can be combined into the codes of these classes. We start with the class of QC codes generated by diagonal generator polynomial matrices; a QC code in this class is a direct sum of cyclic codes. Then we move on to the class of QC codes of index 2; various binary codes with good parameters are found in this class. In each class, we describe the generator polynomial matrices of reversible codes, self-orthogonal codes, and self-dual codes. Hence, we demonstrate how such properties can be merged in codes of these classes. Particularly for QC codes of index 2, we prove a necessary and sufficient condition for the self-orthogonality of reversible codes. Then we show that reversible QC codes of index 2 are self-dual under the same conditions in which self-dual codes are reversible. We clarify that self-orthogonal reversible QC codes of index 2 over $\mathbb {F}_{q}$ exist for even and odd $q$ , however self-dual reversible codes exist only for even $q$ . Theoretical results are reinforced by several numerical examples. Computer search is used to present some self-dual reversible QC codes of index 2 that have the best known parameters as linear codes. Finally, we highlight the class of 1-generator binary QC codes of index 2 by exploring many self-dual reversible codes that achieve the upper bound on the minimum distance for their parameters.

DNA Codes Over the Ring F₄[U]/〈U³〉

In this paper, we develop the method for constructing DNA codes of odd length over the finite chain ring $R=\mathbb {F}_{4}[u]/\langle u^{3}\rangle $ , which plays an important role in genetics, bioengineering and DNA computing. By using a Gray map $\eta $ from $R$ to $\mathbb {F}_{4}$ , we give a one-to-one correspondence between 64 DNA codons of the alphabet $\{A, T, G,C\}^{3}$ and the 64 elements of the chain ring $R$ . We also establish a map $\Theta $ from $R^{n}$ to $\{A, T, G,C\}^{3n}$ . Then we provide a necessary and sufficient condition for cyclic codes of odd length over the chain ring $R$ to be reversible. Finally, when $C$ is a reversible cyclic code over $R$ , we derive a necessary and sufficient condition for $\Theta (C)$ to be a DNA code.

Underlying cause of death identification from death certificates using reverse coding to text and a NLP based deep learning approach

The identification of the underlying cause of death is a matter of primary importance and one of the most challenging issues in the setting of healthcare policy making. The World Health Organisation provides guidelines for death certificates coding using the ICD-10 classification. Guidelines can be manually applied, but there exist some coding support systems that implement them to simplify the coding work. Nevertheless, there is disparity among countries with respect to the level and the quality of death certificates registration. In this work we propose an effective supervised model based on Natural Language Processing algorithms to the aim of correctly classifying the underlying cause of death from death certificates. In our study we compared tabular representations of the death certificate, including the hierarchical path of each condition in the classification, with a novel representation consisting in translating back to their standard title the conditions expressed as ICD-10 codes. Our experimental evaluation, after training on 10.5 million certificates, reached a 99.03% accuracy, which currently outperforms state-of-the-art systems. For its practical applicability, we studied performance by classification chapter and found that accuracy is low only for chapters including very rare death causes. Finally, to show the robustness of our model, we leverage the model confidence to help identifying death certificates for which a manual coding is needed.

On the Skew Cyclic Codes and the Reversibility Problem for DNA 4-Bases

The DNA 4-bases are matched with the 256 elements of the finite ring $$R=F_{4}+uF_{4}+vF_{4}+uvF_{4}$$, where $$ u^{2}=u,v^{2}=v,uv=vu$$. By defining a non trivial automorphism over R, the skew cyclic codes over the finite ring R are introduced. The reversible DNA codes are obtained, by using the skew cyclic codes whose generator polynomials satisfy some conditions. Thanks to this, the reversibility problem for DNA 4-bases can be solved. Moreover, the Gray images of the skew cyclic codes over the finite ring are determined.

Mts: a light framework for parallelizing tree search codes

We describe mts, a generic framework for parallelizing certain types of tree search programmes including reverse search, backtracking, branch and bound and satisfiability testing. It abstracts and generalizes the ideas used in parallelizing lrs, a reverse search code for vertex enumeration. mts supports sharing information between processes which is important for applications such as satisfiability testing and branch-and-bound. No parallelization is implemented in the legacy single processor programmes minimizing the changes needed and simplifying debugging. mts is written in C, uses MPI for parallelization and can be used on a network of computers. We give four examples of reverse search codes parallelized by using mts: topological sorts, spanning trees, triangulations and Galton-Watson trees. We also give a parallelization of two codes for satisfiability testing. We give experimental results comparing the parallel codes with other codes for the same problems.

TDSNN: From Deep Neural Networks to Deep Spike Neural Networks with Temporal-Coding

Continuous-valued deep convolutional networks (DNNs) can be converted into accurate rate-coding based spike neural networks (SNNs). However, the substantial computational and energy costs, which is caused by multiple spikes, limit their use in mobile and embedded applications. And recent works have shown that the newly emerged temporal-coding based SNNs converted from DNNs can reduce the computational load effectively. In this paper, we propose a novel method to convert DNNs to temporal-coding SNNs, called TDSNN. Combined with the characteristic of the leaky integrate-andfire (LIF) neural model, we put forward a new coding principle Reverse Coding and design a novel Ticking Neuron mechanism. According to our evaluation, our proposed method achieves 42% total operations reduction on average in large networks comparing with DNNs with no more than 0.5% accuracy loss. The evaluation shows that TDSNN may prove to be one of the key enablers to make the adoption of SNNs widespread.

Partial reversible AMBTC-based secret image sharing with steganography

Abstract Existing secret image sharing (SIS) schemes with steganography and authentication are designed for uncompressed images. They cannot be applied to compressed domain. When the cover image is of significance, these schemes cannot revert the distorted stego image into its original form. To solve these problems, a ( k , n ) threshold partial reversible absolute moment block truncation coding (AMBTC) based SIS scheme with steganography and authentication is proposed. A secret image is split into n noise-like shares by employing the polynomial based SIS under G F ( 2 8 ) . To efficiently manage the shares, they are concealed into the AMBTC cover image with parity bits by the proposed embedding algorithms, and n meaningful stego images are constructed. Authentication is adopted so that the integrity of stego image can be verified. Sufficient stego images can perfectly reconstruct the secret. Meanwhile, the original AMBTC cover image can be partially recovered with high probability. Theoretical analysis and experimental results are demonstrated, showing the effectiveness and advantages of the proposed scheme.

Complete MDP convolutional codes

Maximum distance profile (MDP) convolutional codes have the property that their column distances are as large as possible. It has been shown that, transmitting over an erasure channel, these codes have optimal recovery rate for windows of a certain length. Reverse MDP convolutional codes have the additional advantage that they are suitable for forward and backward decoding algorithms. Beyond that the subclass of complete MDP convolutional codes has the ability to reduce the waiting time during decoding. The first main result of this paper is to show the existence and genericity of [Formula: see text] complete MDP convolutional codes for all code parameters with [Formula: see text] as well as that complete MDP convolutional codes cannot exist if [Formula: see text]. The second main contribution is the presentation of two concrete construction techniques to obtain complete MDP convolutional codes. These constructions work for all code parameters with [Formula: see text] but require that the size of the underlying base field is (sufficiently) large.

The dual of a constacyclic code, self dual, reversible constacyclic codes and constacyclic codes with complementary duals over finite local Frobenius non-chain rings with nilpotency index 3

Over finite local Frobenius non-chain rings with nilpotency index 3 and when the length of the codes is relatively prime to the characteristic of the residue field of the ring, the structure of the dual of γ -constacyclic codes is established and the algebraic characterization of self-dual γ -constacyclic codes, reversible γ -constacyclic codes and γ -constacyclic codes with complementary dual are given. Generators for the dual code are obtained from those of the original constacyclic code.

Non-split Toric Codes

We introduce a new wide class of error-correcting codes, called non-split toric codes. These codes are a natural generalization of toric codes where non-split algebraic tori are taken instead of usual (i.e., split) ones. The main advantage of the new codes is their cyclicity; hence, they can possibly be decoded quite fast. Many classical codes, such as (doubly-extended) Reed-Solomon and (projective) Reed-Muller codes, are contained (up to equivalence) in the new class. Our codes are explicitly described in terms of algebraic and toric geometries over finite fields; therefore, they can easily be constructed in practice. Finally, we obtain new cyclic reversible codes, namely non-split toric codes on the del Pezzo surface of degree 6 and Picard number 1. We also compute their parameters, which prove to attain current lower bounds at least for small finite fields.

A Comparison of EGR Correction Factor Models Based on SI Engine Data

The article compares the accuracy of different exhaust gas recirculation (EGR) correction factor models under engine conditions. The effect of EGR on the laminar burning velocity of a EURO VI E10 specification gasoline (10% Ethanol content by volume) has been back calculated from engine pressure trace data, using the Leeds University Spark Ignition Engine Data Analysis (LUSIEDA) reverse thermodynamic code. The engine pressure data ranges from 5% to 25% EGR (by mass) with the running conditions, such as spark advance and pressure at intake valve closure, changed to maintain a constant engine load of 0.79 MPa gross mean effective pressure (GMEP). Based on the experimental data, a correlation is suggested on how the laminar burning velocity reduces with increasing EGR mass fraction. This correlation, together with existing models, was then implemented into the quasi-dimensional Leeds University Spark Ignition Engine (LUSIE) predictive engine code and resulting predictions are compared against measurements. It was found that the new correlation is in good agreement with experimental data for a diluent range of 5%-25%, providing the best fit for both engine loads investigated, whereas existing models tend to overpredict the reduction of burning velocity due to EGR.

New Characterization and Parametrization of LCD Codes

Linear complementary dual (LCD) cyclic codes were referred historically to as reversible cyclic codes, which had applications in data storage. Due to a newly discovered application in cryptography, there has been renewed interest in LCD codes. In particular, it has been shown that binary LCD codes play an important role in implementations against side-channel attacks and fault injection attacks. In this paper, we first present a new characterization of binary LCD codes in terms of their symplectic basis. Using such a characterization,we solve a conjecture proposed by Galvez et al. on the minimum distance of binary LCD codes. Next, we consider the action of the orthogonal group on the set of all LCD codes, determine all possible orbits of this action, derive simple closed formulas of the size of the orbits, and present some asymptotic results of the size of the corresponding orbits. Our results show that almost all binary LCD codes are odd-like codes with odd-like duals, and about half of q-ary LCD codes have orthonormal basis, where q is a power of an odd prime.

Реверсивний генератор кодових послідовностей на FPGA

Code sequence generators (CSGs) are widely used in digital systems of radio engineering and communication, computer technology and automation, for storing information and performing arithmetic operations, as well as diagnosing and correcting digital device errors in their control and synchronization circles. Among various types of CSG propagation generators were pseudo-random numbers and generators with constant codes, in which the combination of zeros and units in the bits of the register remains unchanged. A sequence is called pseudorandom, if it looks like a systemic and random, although in fact it was created using a purely deterministic process known as the pseudo-random generator. Such generators are predominantly given some initial values and, with the help of certain algorithms, receive random sequences of codes from it. In this sense, pseudorandom generators can be considered as spreaders of chance. The main disadvantages of these devices include the fact that the offset is performed only to the right, which reduces the functionality. In this article, an analysis of modern methods for generating code sequence generators and taking into account their shortcomings, the authors proposed a new schematic solution for a reversible code sequence generator, which reduces the required resource of integrated circuits, so that it is constructed on an arbitrary bit register, thus giving an opportunity to form an output a bus of any size without changing the source code at the reverse. The method of determining the excitation function for the n-bit shift register is described, and the example of calculating the 4-bit shift register is provided, which provides a return to the main work of the system. This solution allows creating flexible systems based on standard integrated circuits of hard logic. The result of the simulation of the reverse code sequence generator in the software of the Altera Quartus II CAD with the time charts of the device operation is described.

Dynamic Nitroxide Functional Materials.

A substrate-independent and versatile coating platform for (spatially resolved) surface functionalization, based on nitroxide radical coupling (NRC) reactions and the formation of thermo-labile alkoxyamine functional groups, was introduced. Nitroxide-decorated poly(glycidyl methacrylate) (PGMA) microspheres, obtained through bioinspired copolymer surface deposition using dopamine and a nitroxide functional dopamine derivative as monomers, were conjugated with small functional groups in a rewritable process. Reversible coding of the nitroxide functional microspheres by NRC and decoding through thermal alkoxyamine fission were monitored and characterized by electron paramagnetic resonance (EPR) spectroscopy and X-ray photoelectron spectroscopy (XPS). In addition, this nitroxide coating system was exploited in "grafting-to" polymer surface ligations of poly(methyl methacrylate) (PMMA) and poly(2,2,2-trifluoroethyl methacrylate) (PTFEMA) in spatially confined areas. Polymer strands terminated with an Irgacure 2959 (2-hydroxy-4'-(2-hydroxyethoxy)-2-methylpropiophenone) photoinitiator were obtained through chain-transfer polymerization, and subsequently coupled to nitroxide-immobilized poly(dopamine) (PDA)-coated silicon substrates by using rapid photoclick NRC reactions. Light-driven polymer surface coding was visualized by time-of-flight secondary ion mass spectrometry (ToF-SIMS) and XPS imaging.

Addressing Psychometric Limitations of the Attentional Control Scale via Bifactor Modeling and Item Modification

The purpose of this three-part study was to identify and correct psychometric limitations of the Attentional Control Scale (ACS; Derryberry & Reed, 2002) via bifactor modeling and item modification. In Study 1 (N = 956), results from exploratory factor analyses (EFAs) and confirmatory factor analyses (CFAs) suggested that the multidimensionality of the ACS might be a function of a method effect (i.e., reverse coding). In Study 2 (N = 478), reverse-coded items were recoded in a straightforward manner and submitted to EFA. Results supported retention of 15 items and 2 factors. In Study 3 (N = 410), CFA was used to test the model identified in Study 2 and compare it to competing models (i.e., 1-factor, bifactor). The bifactor model exhibited the best fit to the data. However, results from bifactor analysis suggested that the structure of the ACS is more consistent with a unidimensional rather than multidimensional model. Additionally, the second domain-specific factor appears to be redundant with the general factor and both domain-specific factors are poorly defined and might be of little practical value. Taken together, results caution the use of the ACS subscales independent of the total score. Moreover, they support coding ACS items in a straightforward manner.

DNA computing over the ring ℤ4[v]/〈v2 − v〉

In this paper, we discuss the DNA construction of general length over the finite ring [Formula: see text], with [Formula: see text], which plays a very significant role in DNA computing. We discuss the GC weight of DNA codes over [Formula: see text]. Several examples of reversible cyclic codes over [Formula: see text] are provided, whose [Formula: see text]-images are [Formula: see text]-linear codes with good parameters.

Generation of Reversible C++ Code for Optimistic Parallel Discrete Event Simulation

The reversible execution of C/C++ code has been a target of research and engineering for more than a decade as reversible computation has become a central notion in large-scale parallel discrete event simulation (PDES). The simulation models that are implemented for PDES are of increasing complexity and size and require various language features to support abstraction, encapsulation, and composition when building a simulation model. In this paper, we focus on parallel simulation models that are written with user-defined C++ abstractions and abstractions of the C++ Standard Library. We present an approach based on incremental state saving for establishing reversibility of C++ and an evaluation for a kinetic Monte-Carlo simulation implemented in C++. Although a significant runtime overhead is introduced with our technique, it is an enormous win that it allows using the entire C++ language, and has that code automatically transformed into reversible code to enable parallel execution with the Rensselaer’s optimistic simulation system (ROSS).

DNA cyclic codes over the ring 𝔽2[u,v]/〈u2 − 1,v3 − v,uv − vu〉

In this paper, our main objective is to find out the necessary and sufficient conditions for a cyclic code of arbitrary length over the ring of four elements [Formula: see text] [Formula: see text] to be a reversible cyclic code. We also obtain the structure of cyclic DNA codes of odd length over the ring [Formula: see text], which plays an important role in Computational Biology. Furthermore, we establish a direct link between the elements of ring [Formula: see text] and 64 codons used in the amino acids of living organisms by introducing a Gray map from [Formula: see text] to [Formula: see text]. Among others, binary images of cyclic codes over [Formula: see text] are also investigated. As applications, some cyclic DNA codes over [Formula: see text] using the Gray map are provided.

From a reversible code to the quantum one: R-matrix

This research has been carried out in collaboration with D.Melnikov, A.Mironov, A.Morozov and An.Morozov. We study the relation between quantum programming and knot theory. The general idea is that knot theory provides a special basis for unitary matrices. We suggest to use R-matrices of knot theory as universal gates in quantum code. We also examine basic operations in reversible programming.