Redundant Code Research Articles

Обеспечение целостности данных, передаваемых по каналам связи виртуальных частных сетей

Annotation A method of ensuring the integrity of data transmitted over communication channels of VPNs of large-scale information systems functioning in the conditions of the destructive influence of the attacker is considered. The proposed method allows to recover data packets subjected to erasure and imitation. The purpose of the research is to increase the stability of data transmission over VPN communication channels by implementing the procedure for recovering erased IP-packets and increasing the level of imitation security of the transmitted data. Research methods: aggregation of methods of cryptographic control of data integrity and methods of redundant coding of data, application of methods of the theory of Markov random processes to determine the probability of providing satisfactory support for applications in conditions of destructive influence of an attacker with various parameters. Research results: analysis of the object of research – VPN of large-scale information systems was carried out. It leads to the conclusion about the need to protect data transmitted through such communication channels for the implementation of national strategies for economic development. A mathematical model of the functioning of a data transmission system over a VPN communication channel under the conditions of a destructive influence of an attacker is presented. A method is proposed to ensure the integrity of transmitted data based on an original scheme for sharing known solutions, generating a synergistic effect. The method allows recovering dmin −1 erased data packets. The proposed solution makes it possible to increase the stability and speed of data transmission over the communication channels of the network in the conditions of the destructive influence of the attacker and the imitation of data by the attacker.

On the decoding of 1-Fibonacci error correcting codes

The study of new error correcting codes has raised attention in the last years, especially because of their use in cryptosystems that are resistant to attacks running on quantum computers. In 2006, while leaving a more in-depth analysis for future research, Stakhov gave some interesting ideas on how to exploit Fibonacci numbers to derive an original error correcting code with a compact representation. In this paper, we provide an explicit formula to compute the redundancy of Stakhov codes, we identify some flows in the initial decoding procedure described by Stakhov, whose crucial point is to solve some non-trivial Diophantine equations, and provide a detailed discussion on how to avoid solving such equations in some cases and on how to detect and correct errors more efficiently.

ЛОГИЧЕСКИЙ РЕСИНТЕЗ КОМБИНАЦИОННЫХ СХЕМ ДЛЯ ПОВЫШЕНИЯ СБОЕУСТОЙЧИВОСТИ

The external influences are necessary to take into account for microelectronic devices operatingin space. In these conditions, the operation of the device is hampered by the negativeeffect of radiation on the electronic components of the circuit. Exposure of heavy charged part iclesleads to single faults of logic elements due to which the operation of a whole device can beviolated. In this regard, the designed spacecraft electronic circuits must meet increased r equirementsfor the fault tolerance of integrated circuits (ICs). The decrease of technologicaldesign standards for ICs makes the problem of fault tolerance to be relevant for civilian microelectronicproducts, also. The solution to this problem is usually carried out by methods ofhardware protection, which include methods of error-correcting coding, methods of redundancy,as well as methods of logical protection. The paper considers the methods for assessing theIC tolerance to single faults in logic elements, as well as the main methods of circuits failureprotection. The paper proposes a resynthesis technique for logical combinational circuits, usinglogical constraints derived from the resolution method to assess the IC resistance to single faults.During resynthesis, it is proposed to use the methods of logical protection of vulnerable parts ofthe circuit. This does not cause a perceptible increase in the area occupied by the device unlike inmethods of redundancy and error-correcting coding.

Redundant binary codes in genetic algorithms: multi-objective design optimization of water distribution networks

Abstract Genetic algorithms have been shown to be highly effective for optimization problems in various disciplines, and binary coding is generally adopted as it is straightforward to implement and lends itself to problems with discrete-valued decision variables. However, a difficulty associated with binary coding is the existence of redundant codes that do not correspond to any element in the finite discrete set that the encoded parameter belongs to. A common technique used to address redundant binary codes is to discard the chromosomes in which they occur. Effective alternatives to the outright removal of redundant codes are lacking in the literature. This article presents illustrative examples based on the problem of optimizing the design of water distribution networks. Two benchmark networks in the literature and two different multi-objective design optimization models were considered. Different fixed mapping schemes gave significantly different solutions in the search space. The main inference from the results is that mapping schemes that improved diversity in the population of solutions achieved better results, which may pave the way for the development of practical and effective mapping schemes.

Automatically Identifying Calling-Prone Higher-Order Functions of Scala Programs to Assist Testers

For the rapid development of internetware, functional programming languages, such as Haskell and Scala, can be used to implement complex domain-specific applications. In functional programming languages, a higher-order function is a function that takes functions as parameters or returns a function. Using higher-order functions in programs can increase the generality and reduce the redundancy of source code. To test a higher-order function, a tester needs to check the requirements and write another function as the test input. However, due to the complex structure of higher-order functions, testing higher-order functions is a time-consuming and labor-intensive task. Testers have to spend an amount of manual effort in testing all higher-order functions. Such testing is infeasible if the time budget is limited, such as a period before a project release. In practice, not every higher-order function is actually called. We refer to higher-order functions that are about to be called as calling-prone ones. Calling-prone higher-order functions should be tested first. In this paper, we propose an automatic approach, namely Phof, which predicts whether a higher-order function of Scala programs will be called in the future, i.e., identifying calling-prone higher-order functions. Our approach can assist testers to reduce the number of higher-order functions of Scala programs under test. In Phof, we extracted 24 features from source code and logs to train a predictive model based on known higher-order function calls. We empirically evaluated our approach on 4 832 higher-order functions from 27 real-world Scala projects. Experimental results show that Phof based on the random forest algorithm and the Synthetic Minority Oversampling Technique Processing strategy (SMOTE) performs well in the prediction of calls of higher-order functions. Our work can be used to support the scheduling of limited test resources.

Error correction algorithm developed for special-purpose computing devices based on polynomial modular codes

Special-purpose computing devices (SPCD) are used to solve tasks that require either real-time processing of a large amount of data, including digital processing of audio/video signals and OFDM systems, or high accuracy, like friend-or-foe identification for satellite communications systems. To achieve this goal, it is proposed to use parallel processing at various levels. Parallel computing increases circuit costs though, which incites SPCD to fail. The most promising solution to this contradiction lies in the use of position-independent redundant polynomial modular codes (PMC). These codes aim to increase the speed of data processing through the parallelization of computation at the level of arithmetic operations. What is more, thanks to independent and parallel processing of residues, they have the potential to detect and correct errors caused by the failures to occur during computation and during transmission over communication lines due to interference. Therefore, it is crucial to develop an error correction algorithm for special-purpose computing devices based on polynomial modular codes.

System Design for Opportunistic Spectrum Access Using Statistical Decision-Making and Coded-MAC

Different mechanisms have been proposed to solve opportunistic spectrum access (OSA). In order to address spectrum management efficiently, these mechanisms can be divided into four main functionalities, spectrum sensing, decision-making, sharing, and mobility. These functionalities depend on the interpretation and adaptation of different parameters, for example, sensing and data interpretation for adaptive modulation, power adjustments, and changes regarding the range of frequency operation. For the decision-making function, a novel approach is proposed in which coding information is added to the establishment of the communication process thus assisting the medium access control (MAC). The presence of cognitive radio devices in the network coverage range can be controlled or coordinated by using specific redundancy codes. Hence, Reed Solomon (RS) code is used in this paper as part of the handshaking process to provide error correction. In addition, a redundancy strategy based on Rabin’s information dispersal algorithm (IDA) is presented to provide fault tolerance to the communication between cognitive radio devices. In this case, the information is divided into fragments dynamically, and each fragment is coded by an RS code and reassigned to a subset of recipients using alternate paths. This work shows how to optimize spectrum access based on IDA and RS codes to diversify channel occupation without losing significant information with several frequency hops presented in cognitive radio communications. The validations were executed in a discrete event simulator developed in Python. The proposed system for OSA was found to perform better than other approaches using pilot sequences. Our proposal, therefore, provides fault tolerance, to diversify channel occupation, and helps identify the presence of primary and secondary users when a common control channel (CCC) is implemented by the optimization of the spectrum use.

From ICD10 to ORPHAcodes: paving the way towards improved identification systems for rare diseases

Abstract Background The International Classification of Diseases 10th revision (ICD10) and its clinical modification (ICD10CM) are commonly used for the identification of diseases occurrence worldwide. In Spain, diagnoses are coded with its Spanish version (ICD10ES) since 2016 regardless of the prevalence of diseases. Rare diseases (RDs) are scrambled among common diseases in ICD10 and its derivatives and many RDs dońt have a specific ICD10 code, delaying a proper identification. Orphanet developed a classification system specific for RDs called ORPHAcode. This study aims to characterize whether ICD10ES mapping to ORPHAcodes improves RDs identification and which kind of disorders would benefit the most. Methods 95% of the disorder level ORPHAcodes indexed at Orphanet was mapped to codes from 20 ICD10ES chapters by comparing the descriptors associated in both classifications. ORPHAcodes were then clustered based on their assigned ICD10ES chapter and the redundancy of each individual ICD10ES code was calculated by counting the ORPHAcodes they mapped to. 3 groups were established: Group 1 (1 ORPHAcode per ICD10ES), Group 2 (between 2-49 ORPHAcodes per ICD10ES) and Group 3 (≥50 ORPHAcodes per ICD10ES). Results 5588 ORPHAcodes were correlated to 1677 ICD10ES codes. 1051 were group 1, 3261 group 2 (615 ICD10ES) and 1276 group 3 (11 ICD10ES). Most of the Orphacodes correlated to “Q” (>40%), “G” (>14%) and “E” (>12%) chapters of ICD10ES. Regarding specificity, “G” and “Q” were also the only chapters including group 3 ORPHAcodes, while less than 10% of the ORPHAcodes linked to these chapters were in group 1. Conclusions New and improved ICD10ES codes are required because just 20% of all ORPHAcodes studied were into group 1. Especial care should be put on the two majoritarian chapters, “Q:Congenital Anomalies” and “G:Nervous System”, that show the lowest specificity for RDs. Complementary use of ORPHAcodes would improve the identification and registry of RDs either. Funded: Project RD-CODE Key messages The lack of a specific chapter for Rare Diseases in the InternationaI Classification of Diseases hinders their identification and therefore their study. Direct mapping between ICD10 and ORPHAcodes or the use of ORPHAcodes for diagnoses codification of Rare Diseases would enable better detection and epidemiological analysis.

Optimal work extraction and the minimum description length principle

We discuss work extraction from classical information engines (e.g., Szilárd) with N-particles, q partitions, and initial arbitrary non-equilibrium states. In particular, we focus on their optimal behaviour, which includes the measurement of a set of quantities Φ with a feedback protocol that extracts the maximal average amount of work. We show that the optimal non-equilibrium state to which the engine should be driven before the measurement is given by the normalised maximum-likelihood probability distribution of a statistical model that admits Φ as sufficient statistics. Furthermore, we show that the minimax universal code redundancy associated to this model, provides an upper bound to the work that the demon can extract on average from the cycle, in units of kBT. We also find that, in the limit of N large, the maximum average extracted work cannot exceed H[Φ]/2, i.e. one half times the Shannon entropy of the measurement. Our results establish a connection between optimal work extraction in stochastic thermodynamics and optimal universal data compression, providing design principles for optimal information engines. In particular, they suggest that: (i) optimal coding is thermodynamically efficient, and (ii) it is essential to drive the system into a critical state in order to achieve optimal performance.

Interplay between Position-Dependent Codon Usage Bias and Hydrogen Bonding at the 5' End of ORFeomes.

Codon usage bias exerts control over a wide variety of molecular processes. The positioning of synonymous codons within coding sequences (CDSs) dictates protein expression by mechanisms such as local translation efficiency, mRNA Gibbs free energy, and protein cotranslational folding. In this work, we explore how codon usage affects the position-dependent content of hydrogen bonding, which in turn influences energy requirements for unwinding double-stranded DNA (dsDNA). We categorized codons according to their hydrogen bond content and found differential effects on hydrogen bonding encoded by codon variants. The specific positional disposition of codon variants within CDSs creates a ramp of hydrogen bonding at the 5' end of the ORFeome in Escherichia coli CDSs occupying the first position of operons are subjected to selective pressure that reduces their hydrogen bonding compared to internal CDSs, and highly transcribed CDSs demand a lower maximum capacity of hydrogen bonds per codon, suggesting that the energetic requirement for unwinding the dsDNA in highly transcribed CDSs has evolved to be minimized in E. coli Subsequent analysis of over 14,000 ORFeomes showed a pervasive ramp of hydrogen bonding at the 5' end in Bacteria and Archaea that positively correlates with the probability of mRNA secondary structure formation. Both the ramp and the correlation were not found in Fungi The position-dependent hydrogen bonding might be part of the mechanism that contributes to the coordination between transcription and translation in Bacteria and Archaea A Web-based application to analyze the position-dependent hydrogen bonding of ORFeomes has been developed and is publicly available (https://juanvillada.shinyapps.io/hbonds/).IMPORTANCE Redundancy of the genetic code creates a vast space of alternatives to encode a protein. Synonymous codons exert control over a variety of molecular and physiological processes of cells mainly through influencing protein biosynthesis. Recent findings have shown that synonymous codon choice affects transcription by controlling mRNA abundance, mRNA stability, transcription termination, and transcript biosynthesis cost. In this work, by analyzing thousands of Bacteria, Archaea, and Fungi genomes, we extend recent findings by showing that synonymous codon choice, corresponding to the number of hydrogen bonds in a codon, can also have an effect on the energetic requirements for unwinding double-stranded DNA in a position-dependent fashion. This report offers new perspectives on the mechanism behind the transcription-translation coordination and complements previous hypotheses on the resource allocation strategies used by Bacteria and Archaea to manage energy efficiency in gene expression.

Video Error-Resilience Research Based on Error-Resilient Screen Content

In order to make video transmission more stable, various error-resilient mechanisms are proposed on video coding in the literature. However, the redundancy mechanism behind classical redundant coding algorithms is relatively simple and is not suitable for the network environment and video content in the context of screen content sequence with multiple abrupt frames and still frames. Motivated by this, a frame-level coding selection mechanism is proposed in this paper for the error-resilience transmission of screen content, where additional code stream or redundant information is considered to improve error-resilient performance with redundant coding and acceptable video quality is obtained in the case of frame transmission error. In addition, selective allocation redundancy is conducted to take the importance of the video frame ROI (region of interest) area into account in the co-encoding process. As a result, the redundancy insertion efficiency and the reliability are improved in return. The corresponding experiments validate the effectiveness of the schemes proposed in this paper.

Non-Coherent Massive MIMO Systems: A Constellation Design Approach

In this paper, a joint multi-user constellation is proposed for energy detection-based non-coherent massive multiple-input multiple-output system. This is motivated by the simple design and high energy efficiency it entails for both the transmitter and receiver. First, the orthogonal codes is employed to suppress the multi-user interference. However, this comes at the price of consuming more communications resources. In this study, the key to reduce code redundancy is the design of a joint constellation since it makes energy detection applicable when multiple users employ the same orthogonal codes. Although it is unsolvable initially, our analysis indicates that through minimizing the symbol-error rate (SER), the joint constellation design becomes feasible. Concretely, two analytical expressions of SER based on Gamma and Gaussian distributions are derived. Via minimizing the error probability, an important result that the joint constellation should satisfy is obtained. Accordingly, an isometric constellation design is proposed to find constellations that enable non-coherent reception with multiple users, and reduce SER simultaneously. In addition, decoding regions of symbol decision are optimized to further improve the error performance. In the end, numerical simulations are carried out to highlight the effectiveness of our proposed scheme.

Restoration Method of Hadamard Coding Spectral Imager

Hadamard coding spectral imaging technology is a computational spectral imaging technology, which modulates the target's spectral information and recovers the original spectrum by inverse transformation. Because it has the advantage of multichannel detection, it is being studied by more researchers. For the engineering realization of push-broom coding spectral imaging instrument, it will inevitably be subjected to push-broom error, template error and detection noise, the redundant sampling problem caused by detector. Therefore, three restoration methods are presented in this paper: firstly, the one is the least squares solution, the two is the zero-filling inverse solution by extending the coding matrix in the redundant coding state to a complete higher order Hadamard matrix, the three is sparse method. Secondly, the numerical and principle analysis shows that the inverse solution of zero-compensation has better robustness and is more suitable for engineering application; its conditional number, error expectation and covariance are better and more stable because it directly uses Hadamard matrix, which has good generalized orthogonality. Then, a real-time spectral reconstruction method is presented, which is based on inverse solution of zero-compensation. Finally, simulation analysis shows that spectral data could be destructed relative accuracy in the error condition; however, the effect of template noise and push error on reconstruction is much greater than that of detection error. Therefore, in addition to reducing the detection noise as much as possible, lower template noise and more accurate push controlling should be guaranteed specifically in engineering realization.

A Fully-Integrated 64-Channel Wireless Neural Interfacing SoC Achieving 110 dB AFE PSRR and Supporting 54 Mb/s Symbol Rate, Meter-Range Wireless Data Transmission

This brief presents a 64-channel fully-integrated wireless neural interfacing SoC implemented in a 65 nm CMOS process. To minimize the weight and size of the head-stage connected to the small experimental animals, the system is designed to be powered by either a single-coil 13.56 MHz wireless power receiver or a small-sized button cell battery. A replica-biased 0.35 V 110 dB PSRR LNA is introduced to tolerate the power supply noise inherently in wireless power harvesting and save power consumption. The recorded neural data is transmitted wirelessly by a 2.4/3.2 GHz dual-band OOK transmitter, which supports 54 Mb/s symbol rate, 44 pJ/bit meter-range wireless data transmission. To reduce the transmission BER, forward error correction with convolutional code and cyclic redundancy code is adopted.

Network Coding for Efficient Video Multicast in Device-to-Device Communications.

Device-to-Device (D2D) communication is one of the critical technologies for the fifth-generation network, which allows devices to communicate directly with each other while increasing transmission rate, but this communication is vulnerable to interference. When video transmission is carried out in an environment with interference, problems such as high packet loss rate, poor quality of the video, and blurred screen may exist. These problems can be effectively solved by redundant coding operations at the source node, but the extra coding operation imposes a heavy computational burden on the source node. In order to alleviate the computational overhead of the source node, reduce transmission delay, and guarantee transmission quality, this paper proposes an efficient video multicast transmission scheme based on Random Linear Network Coding (RLNC) in D2D networks. In the scheme, the receiving devices in the transmission participate in the process of generating repair packets that are used to remedy the loss of encoded packets during transmission. The source node multicasts the encoded video file. The receiving nodes re-encode the received data packets with RLNC and then send them to the network again. The nearby nodes can decode the original data through the encoded or re-encoded data packets. The performance of the proposed scheme is evaluated through both simulation and real experiments. The experimental results show that compared with the traditional RLNC scheme, this scheme could balance the computation overhead of the mobile devices and reduce the encoding and decoding delay by about 8%. When the packet loss rate is high, the proposed scheme can obtain better video quality than the traditional replication-based scheme.

Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes

The tight lower bound on the redundancy of optimal prefix-free codes in terms of a given symbol probability (not necessarily the largest or the smallest one) has been derived in the literature. The first goal of this paper is to derive the tight lower bounds in terms of $j$ ( $j>1$ ) known symbol probabilities of the source using some properties of Kullback-Leibler distance. Since fix-free codes are special prefix-free codes (for which no codeword is a suffix of the other codewords), it is clear that all lower bounds on the redundancy of optimal prefix-free codes are also valid for fix-free ones. Accordingly, the second question of the paper is on the tightness of the derived lower bounds for optimal fix-free codes. It is proven that these lower bounds are tight for optimal fix-free codes if $j\leq 3$ , and are not tight for $j\geq 4$ . Also, it is shown that the tight lower bound in terms of the probability of the most likely symbol is the same for optimal prefix-free and optimal fix-free codes.

The concept for biometric system development based on modern error correcting coding

The objective of the work is to develop new algorithms for error-correcting coding in biometric systems that best meet modern challenges for such systems. The article presents directions of biometric system development that take into account the prospects of their use in combination with modern network technologies, methods of cognitive data processing, cryptographic systems and artificial intelligence. The objective necessity for developing advanced error-correcting coding methods in such systems is proved that meets the increased requirements for the reliability of the processed data and its processing speed in real time. It is proposed to use a cascade design for processing block redundant codes with a system for cluster processing of polar codes (PC) at the internal decoding stage and cognitive processing of Reed-Solomon (RS) code combinations at the external decoding stage.

CONTROL AND CORRECTION OF DATA ERRORS IN A RESIDUE CLASS

The subject of the research in the article is the methods of control and correction of single errors of integer data are presented in the residue class (RC), which allows to increase the efficiency of using RC when building computer systems and components. The purpose of the article is to develop a method for correcting single data errors in RC. Tasks: to study the code structures presented in RC to determine the possibility of control and correction of data errors; to investigate the effect of RC properties on data control and correction operations; to develop a method for correcting single data errors in RC. Research methods: methods of analysis and synthesis of computer systems, number theory, coding theory in RC. The following results are obtained. An analysis of the correcting capabilities of codes in RC showed the high efficiency of using non-positional code structures, which is due to the presence of primary and secondary redundancy in such structures. The article presents a method for correcting one-time data errors in RC. Examples of detecting and correcting data errors in RC code are given, which confirms the theoretical results obtained. Conclusions. Studies have shown that the use of codes in RC makes it possible to build an effective system for monitoring and correcting data errors with the introduction of minimal code redundancy. That is, when certain conditions are met, the introduction of one control base allows not only monitoring, but also correction of single data errors

Penetrating the influence of regularizations on neural network based on information bottleneck theory

Regularization is a very effective algorithm to solve overfitting problem in neural network, which improves the generalization ability of the model. However, their working mechanisms and the impact on the model performance have not been fully explored. In this paper, we study and analyze them using information bottleneck theory and one theory from human brain sensory system. We propose a metric to characterise the encoding length of hidden layers, named as AEntry value. Then, we implement extensive experiments on MNIST and FashionMNIST datasets with several commonly used regularization algorithms, and calculate the corresponding AEntry values. We analyze these results and obtain three conclusions. (1) The introduction of regularization influences the encoding of relative features with prediction task in neural network. The early stopping technique avoids introducing unrelated information with the task into the model by stopping the training process as an appropriate iterations. Laplace, Gaussian and Sparse Response regularizations compress the related representation and improve the performance of neural network by introducing the prior information into the model. In contrast, Dropout, Batch Normalization, and Layer Normalization increase the encoding length of features by adopting redundant representation to improve the performance. (2) The encoding of neural network does not satisfy the data processing inequality of information theory, which is mainly caused by redundant coding of extracted features. (3) The overfitting is caused by introducing irrelative information with the target. These results can give us insight into building more efficient regularization algorithm to improve the performance of neural network model.

OBJECT ORIENTED METRIC BASED ANALYSIS OF TEXT TRANSMISSION IN E-LEARNING THROUGH NATURAL LANGUAGE STEGANOGRAPHY

E-learning is an application of information and communication technology in the field of learning. Through steganography the e-learning institution can provide security to other participants of e-learning like teacher and learner. Here we use text steganography with modified SNOW algorithm while passing secret texts from the administrator to the learner in an e-learning system. In this paper, we calculate the object oriented metric based analysis of CK and MOOD metrics of our proposed model, which ensures the advantages of code redundancy, code reusability, and cost effectiveness and so on.