检索结果-内蒙古大学图书馆

error-correcting code FOR OPTICAL-FIBER TRANSMISSION-SYSTEMS

ELECTRONICS LETTERS 1987年第3期23卷 97-98页

作者： YOSHIKAI, N NTT Electrical Communications Laboratories Yokosuka Japan

A simple error-correcting code for optical-fibre transmission systems is proposed, and its correcting principle is explained. This code offers the same advantages as the CMI code, which is widely used in optical-fibre transmission systems. Moreover it has the ability to correct a single error in a block. Owing to this ability, the maximum repeater space can be increased.

关键词： block optical-fibre transmission systems optical fibres error correction codes maximum repeater space optical links codes error-correcting code Optical communication single error Fibre optics

来源：评论

学校读者我要写书评

暂无评论

CA-BASED BYTE error-correcting code

引用

IEEE TRANSACTIONS ON COMPUTERS 1995年第3期44卷 371-382页

作者： CHOWDHURY, DR SENGUPTA, I CHAUDHURI, PP INDIAN INST TECHNOL DEPT COMP SCI & ENGNKHARAGPUR 721302W BENGALINDIA

This paper reports a novel approach for designing byte error-correcting codes using cellular automata (CA), A simple scheme for generation and decoding of single-byte error-correcting and double-byte error-detecting codes, referred to as CA-SbEC-DbED, is presented, Extension of the scheme to locate/correct larger number of information byte errors has been also included. The encoding and decoding algorithms have been designed with tbe help of a linear operator that can be conveniently realized with a maximum length group CA, The regular, modular and cascadable structure of CA can be economically built with VLSI technology, Compared to the existing architecture of the Reed-Solomon decoder chip, CA-based implementation of the proposed decoding scheme provides a simple cost effective solution.

关键词： CELLULAR AUTOMATA error-correcting code FAULT TOLERANCE SIGNATURE ANALYSIS

来源：评论

学校读者我要写书评

暂无评论

An error-correcting code-Based Robust Watermarking Scheme for Stereolithographic Files

引用

Computer Systems Science & Engineering 2021年第5期37卷 247-263页

作者： Zhuorong Li Huawei Tian Yanhui Xiao Yunqi Tang Anhong Wang School of Criminal Investigation People’s Public Security University of ChinaBeijing100038China School of National Security People’s Public Security University of ChinaBeijing100038China School of Electronic Information Engineering Taiyuan University of Science and TechnologyTaiyuan030024China

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.

关键词： Three-dimensional watermarking stereolithographic file robust watermarking error-correcting code

来源：评论

学校读者我要写书评

暂无评论

HEDGES error-correcting code for DNA storage corrects indels and allows sequence constraints

引用

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA 2020年第31期117卷 18489-18496页

作者： Press, William H. Hawkins, John A. Jones, Stephen K. Schaub, Jeffrey M. Finkelstein, Ilya J. Univ Texas Austin Dept Comp Sci Austin TX 78712 USA Univ Texas Austin Dept Integrat Biol Austin TX 78712 USA Univ Texas Austin Oden Inst Computat Engn & Sci Austin TX 78712 USA Univ Texas Austin Dept Mol Biosci Austin TX 78712 USA Univ Texas Austin Inst Cellular & Mol Biol Austin TX 78712 USA

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.

关键词： DNA information storage error-correcting code indel Reed-Solomon

来源：评论

学校读者我要写书评

暂无评论

A METHOD FOR DECODING A VARIABLE-RATE error-correcting code BASED ON FINITE-STATE AUTOMATA

引用

CYBERNETICS AND SYSTEMS ANALYSIS 2015年第3期51卷 336-343页

作者： Zavadskyi, I. O. Taras Shevchenko Natl Univ Kyiv Kiev Ukraine

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 error correcting 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.

关键词： finite-state automaton error-correcting code (2,3) code convolutional code

来源：评论

学校读者我要写书评

暂无评论

A New SVM Multi-Class Classification Method Based on error-correcting code

A New SVM Multi-Class Classification Method Based on Error-C...

引用

International Conference on Computational-Intelligence and Security

作者： Wang, Zelong Yan, Fengxia He, Feng Zhu, Jubo Natl Univ Def Technol Sch Sci Changsha 410073 Hunan Peoples R China Natl Univ Def Technol Sch Elect Sci & Engn Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781424441969

Traditional SVM (support vector machine) multi-class classification methods are mainly based on one-to-one and one-to-multi, which both have disadvantages in applications: slow computational speed and low classification precision. This paper introduces a new method based on error correcting code to reduce the training time and improve the classification precision. In view of the relations among the length, the Hsmming distance and the order of the code and the generalization ability of each SVM, we propose the principles of code table-designing and the center-range method that ascertains the code order to eliminate the problem caused by error correcting code in factual application. Finally the results of experiments of HRRP recognition show this improved method has high computational efficiency and batter generalization ability.

关键词： error-correcting code center-range method code table-designing

来源：评论

学校读者我要写书评

暂无评论

RRNS Base Extension error-correcting code for Performance Optimization of Scalable Reliable Distributed Cloud Data Storage

RRNS Base Extension Error-Correcting Code for Performance Op...

引用

35th IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Babenko, Mikhail Tchernykh, Andrei Pulido-Gaytan, Bernardo Cortes-Mendoza, Jorge M. Shiryaev, Egor Golimblevskaia, Elena Avetisyan, Arutyun Nesmachnow, Sergio North Caucasus Fed Univ Stavropol Russia CICESE Res Ctr Ensenada Baja California Mexico South Ural State Univ Chelyabinsk Russia RAS Ivannikov Inst Syst Programming Moscow Russia Univ Republica Montevideo Uruguay

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.

关键词： cloud computing residue number system reliability error-correcting code uncertainty

来源：评论

学校读者我要写书评

暂无评论

Area-Efficient and Reliable error correcting code Circuit Based on Hybrid CMOS/Memristor Circuit

引用

JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS 2020年第4期36卷 537-546页

作者： Ishizaka, Mamoru Shintani, Michihiro Inoue, Michiko Nara Inst Sci & Technol NAIST 8916-5 Takayama Cho Nara 6300192 Japan

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.

关键词： Resistive random-access memory Memristor Crossbar array error-correcting code Reliability

来源：评论

学校读者我要写书评

暂无评论

A new two-error-correcting binary code of length 16

引用

CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES 2020年第1期12卷 71-75页

作者： Milshtein, Moshe New Hampshire USA

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.

关键词： error-correcting code Block code Lower bound Tabu search

来源：评论

学校读者我要写书评

暂无评论

TS-WHT: A Two-Step Walsh-Hadamard Transform Approach for Blind error correcting code Classification

引用

IEEE COMMUNICATIONS LETTERS 2023年第7期27卷 1689-1693页

作者： Li, Sida Zhou, Jing Huang, Zhiping Natl Univ Def Technol Coll Intelligent Sci Changsha 410073 Peoples R China

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.

关键词： Adaptive modulation and coding blind/semi-blind estimation cognitive radio error-correcting code Walsh-Hadamard transform

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：