Stereolithographic(STL)files have been extensively used in rapid prototyping industries as well as many other fields as watermarking algorithms to secure intellectual property and protect three-dimensional models from...
详细信息
Stereolithographic(STL)files have been extensively used in rapid prototyping industries as well as many other fields as watermarking algorithms to secure intellectual property and protect three-dimensional models from ***,to the best of our knowledge,few studies have looked at how watermarking can resist attacks that involve ***,we present a lossless and robust watermarking scheme for STL files to protect against vertexreordering ***,we designed a novel error-correcting code(ECC)that can correct the error of any one-bit in a bitstream by inserting several check *** addition,ECC is designed to make use of redundant information according to the characteristics of STL files,which introduces further robustness for defense against *** modifications are made to the geometric information of the three-dimensional model,which respects the requirements of a highprecision *** experimental results show that the proposed watermarking scheme can survive numerous kinds of attack,including rotation,scaling and translation(RST),facet reordering,and vertex-reordering attacks.
Ensuring reliable data storage in a cloud environment is a challenging problem. One of the efficient mechanisms used to solve it is the Redundant Residue Number System (RRNS) with the projection method, a commonly use...
详细信息
ISBN:
(纸本)9781665435772
Ensuring reliable data storage in a cloud environment is a challenging problem. One of the efficient mechanisms used to solve it is the Redundant Residue Number System (RRNS) with the projection method, a commonly used mechanism for detecting errors. However, the error correction based on the projection method has exponential complexity depending on the number of control and working moduli. In this paper, we propose an optimization mechanism using a base extension and Hamming distance to reduce the number of calculated projections. We show that they can be reduced up to three times than the classical projection method and, hence, the time complexity of data recovery in the distributed cloud data storage.
Blind classification of error-correcting codes is essential for intelligent wireless communication, cognitive radio, and non-cooperative communication. The object of this letter is to investigate the differences in th...
详细信息
Blind classification of error-correcting codes is essential for intelligent wireless communication, cognitive radio, and non-cooperative communication. The object of this letter is to investigate the differences in the Walsh spectrum between linear block code, convolutional code, and Turbo code. Based on these differences, a two-step Walsh Hadamard transform (TS-WHT) strategy is proposed for error-correcting code blind classification. Further, according to the detection theory, the peak detection threshold is detailed and optimized with the cyclic feature of CRC codes. The results indicate that when employing the optimized threshold, probabilities of correct classification are superior for linear block codes and convolutional codes. Moreover, with the help of the fault-tolerant feature of the WHT technique, the classification accuracy of the proposed method is substantially better than existing approaches under low signal-to-noise ratio (SNR) conditions.
Synthetic DNA is rapidly emerging as a durable, high-density information storage platform. A major challenge for DNA-based information encoding strategies is the high rate of errors that arise during DNA synthesis and...
详细信息
Synthetic DNA is rapidly emerging as a durable, high-density information storage platform. A major challenge for DNA-based information encoding strategies is the high rate of errors that arise during DNA synthesis and sequencing. Here, we describe the HEDGES (Hash Encoded, Decoded by Greedy Exhaustive Search) error-correcting code that repairs all three basic types of DNA errors: insertions, deletions, and substitutions. HEDGES also converts unresolved or compound errors into substitutions, restoring synchronization for correction via a standard Reed-Solomon outer code that is interleaved across strands. Moreover, HEDGES can incorporate a broad class of user-defined sequence constraints, such as avoiding excess repeats, or too high or too low windowed guanine-cytosine (GC) content. We test our code both via in silico simulations and with synthesized DNA. From its measured performance, we develop a statistical model applicable to much larger datasets. Predicted performance indicates the possibility of error-free recovery of petabyte- and exabyte-scale data from DNA degraded with as much as 10% errors. As the cost of DNA synthesis and sequencing continues to drop, we anticipate that HEDGES will find applications in large-scale error-free information encoding.
Resistive random-access memory (ReRAM) has several attractive features such as high storage density and high switching frequency with low power consumption. It is hence regarded as the most promising nonvolatile memor...
详细信息
Resistive random-access memory (ReRAM) has several attractive features such as high storage density and high switching frequency with low power consumption. It is hence regarded as the most promising nonvolatile memory material. However, a memristor, which is a primitive component of the ReRAM-based memory, has much lower write endurance. Hence, an error-correcting code (ECC) circuit is indispensable for realizing reliable ReRAM storage. Accordingly, we propose a hybrid CMOS/memristor-based ECC circuit. In the proposed circuit, the blocks with high-frequency write operations are implemented using the conventional CMOS technology and the other blocks are implemented using the memristors to maintain a balance between the area overhead and reliability. Through numerical experiments, we demonstrate that the proposed ECC circuit achieves smaller area and higher reliability than the full memristor-based ECC circuits and achieves much smaller area while preserving the reliability compared with the full CMOS-based ECC circuits.
The maximum possible cardinality of a binary code of length n and Hamming distance d is denoted by A(n,d). The current lower bound for A(16,5) is 256, as implied by the Nordstrom-Robinson code. We improve this bound t...
详细信息
The maximum possible cardinality of a binary code of length n and Hamming distance d is denoted by A(n,d). The current lower bound for A(16,5) is 256, as implied by the Nordstrom-Robinson code. We improve this bound to 258 by presenting a binary code of length 16, minimum distance 5 and cardinality 258. The code is found using a known construction and Tabu Search.
A decoding algorithm for a special error-correcting code is considered and its efficiency is estimated. This code is obtained as a result of processing information messages by finite automata and using a two-base nume...
详细信息
A decoding algorithm for a special error-correcting code is considered and its efficiency is estimated. This code is obtained as a result of processing information messages by finite automata and using a two-base numeral system. A general encoding algorithm is also considered. Both encoding or decoding are performed by a two-level system in which an input message is represented as a lower (2,3) code at the internal level, and the errorcorrecting capabilities of this code are strengthened owing to its transformation with the help of a special finite automaton at the external level. In decoding, errors are first detected and corrected at the external level, and then possible remaining errors are eliminated by an internal automaton. The relationship between the external level of the system being considered and convolutional codes is investigated and the advantages of the proposed method are shown.
This paper builds a novel bridge between algebraic coding theory and mathematical knot theory, with applications in both directions. We give methods to construct error-correcting codes starting from the colorings of a...
详细信息
This paper builds a novel bridge between algebraic coding theory and mathematical knot theory, with applications in both directions. We give methods to construct error-correcting codes starting from the colorings of a knot, describing through a series of results how the properties of the knot translate into code parameters. We show that knots can be used to obtain error-correcting codes with prescribed parameters and an efficient decoding algorithm.
The determination of bounds on the size of codes with given minimum distance is an important problem in the coding theory. In this paper, we construct codes based on partial linear maps of finite-dimensional vector sp...
详细信息
The determination of bounds on the size of codes with given minimum distance is an important problem in the coding theory. In this paper, we construct codes based on partial linear maps of finite-dimensional vector spaces, define the measure of distance via rank function, and present several upper bounds and lower bounds on the size of these codes.
Galois hulls are generalizations of Euclidean and Hermitian hulls, which have attracted interest because of their important applications in determining the complexity of some algorithms about linear codes and in const...
详细信息
Galois hulls are generalizations of Euclidean and Hermitian hulls, which have attracted interest because of their important applications in determining the complexity of some algorithms about linear codes and in constructing entanglement-assisted quantum errorcorrectingcodes (EAQECCs). In this paper, the whole contribution is two-folded. On one hand, we propose explicit methods to construct linear codes of larger lengths with Galois hulls of arbitrary dimensions from given Galois self-orthogonal codes. Conditions required in our approach are proven to be relatively weak. On the other hand, we apply these results to construct EAQECCs. Two bounds for EAQECCs constructed from linear codes with prescribed dimensional Galois hull are given and EAQECCs with rates greater than or equal to 12 and positive net rates can be obtained. We also present many interesting examples to explain visually how these two aspects work. (c) 2023 Elsevier B.V. All rights reserved.
暂无评论