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

Mission-Critical Systems, Paradox of hamming code, Row Hammer Effect, 'Trojan Horse' of the Binary System and Numeral Systems with Irrational Bases

引用

COMPUTER JOURNAL 2018年第7期61卷 1038-1063页

作者： Stakhov, Alexey Canadian Comp Firm FibTech Fibonacci Technol Toronto ON Canada

This article deals with a wide range of issues related to the design of specialized computing and measuring systems for mission-critical applications, in which the requirements of reliability and noise immunity are put to the fore. Among these issues, we consider: paradox of the hamming code, the 'row hammer effect', the 'Trojan horse' of the binary system. It is discussed the issue of the use of numeral systems with irrational bases (Bergman's system, ternary mirror-symmetric arithmetic, Fibonacci p-codes and codes of the golden p-proportions) for the design of specialized computing and measuring systems for mission-critical applications.

关键词： mission-critical systems hamming code error correcting codes row hammer effect numeral systems with irrational bases bergman system ternary mirror-symmetric arithmetic Fibonacci codes Golden Ratio codes

来源：评论

学校读者我要写书评

暂无评论

Robust watermarking scheme for binary images using a slice-based large-cluster algorithm with a hamming code

引用

OPTICAL ENGINEERING 2006年第1期45卷 017005-1-017005页

作者： Chen, WY Liu, CC Natl Chin Yi Univ Technol Dept Elect Engn Taichung Taiwan

The problems with binary watermarking schemes are that they have only a small amount of embeddable space and are not robust enough. We develop a slice-based large-cluster algorithm (SBLCA) to construct a robust watermarking scheme for binary images. In SBLCA, a small-amount cluster selection (SACS) strategy is used to search for a feasible slice in a large-cluster flappable-pixel decision (LCFPD) method, which is used to search for the best location for concealing a secret bit from a selected slice. This method has four major advantages over the others: (a) SBLCA has a simple and effective decision function to select appropriate concealment locations, (b) SBLCA utilizes a blind watermarking scheme without the original image in the watermark extracting process, (c) SBLCA uses slice-based shuffling capability to transfer the regular image into a hash state without remembering the state before shuffling, and finally, (d) SBLCA has enough embeddable space that every 64 pixels could accommodate a secret bit of the binary image. Furthermore, empirical results on test images reveal that our approach is a robust watermarking scheme for binary images. (c) 2006 Society of Photo Optical Instrumentation Engineers.

关键词： binary image copyright protection digital watermarking hash function hamming code

来源：评论

学校读者我要写书评

暂无评论

An image authentication method by applying hamming code on rearranged bits

引用

PATTERN RECOGNITION LETTERS 2011年第14期32卷 1679-1690页

作者： Chan, Chi-Shiang Asia Univ Dept Appl Informat & Multimedia Wufeng 41354 Taiwan

In 2007, Chan and Chang proposed an image authentication method using the hamming code technique. The parity check bits were produced from pixels by using the hamming code technique, and the produced bits were embedded in other pixels. When recovering, the method had to predict the value of the most-significant bit of each tampered pixel first. Then, the tampered pixel was able to be recovered by referring to the predicted bit and its parity check bits. However, using the most-significant bit is unsuitable because of the risk of making an incorrect prediction. In this paper, the parity check bits are produced from pixels whose bits have been rearranged. This way, the value of the most-significant bit of each tampered pixel can be determined according to its parity check bits. The recovery procedure is also modified to accommodate the rearranging procedure. The experimental results show that the proposed method has a better ability to recover the tampered areas, compared with Chan and Chang's method. Moreover, the quality of the authenticated images of the proposed method is also higher than that of Chan and Chang's method. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Image authentication Tamper proofing hamming code

来源：评论

学校读者我要写书评

暂无评论

A Memristor-Based In-Memory Computing Network for hamming code Error Correction

IEEE ELECTRON DEVICE LETTERS

引用

IEEE ELECTRON DEVICE LETTERS 2019年第7期40卷 1080-1083页

作者： Sun, Xinhao Zhang, Teng Cheng, Caidie Yan, Xiaoqin Cai, Yimao Yang, Yuchao Huang, Ru Peking Univ Inst Microelect Minist Educ Key Lab Microelect Devices & Circuits Beijing 100871 Peoples R China Univ Sci & Technol Beijing Sch Mat Sci & Engn State Key Lab Adv Met & Mat Beijing 100083 Peoples R China

hamming code is a linear error-correcting code widely used in memory and telecommunication. For the first time, here we put forth an approach to analyzing hamming codes in hardware using networks consisting of memristors. Such networks are capable of detecting and correcting potential bit errors in hamming codes in a high-speed and energy-efficient way, where the parity-check matrix is stored in the memristor crossbar array and the syndrome vector is represented by the states of the output unipolar memristors whose resistance flipping naturally implements vector-matrix multiplication with modulo 2. Our experimental results demonstrate that the output syndrome vector is able to correctly represent the position of the bit error whenever it exists, and subsequent correction can thus be applied by flipping the bit identified. The energy consumption using the present network has decreased by > 100 times compared with GPU while > 1000 times compared with CPU.

关键词： Memristor hamming code in-memory computing energy consumption

来源：评论

学校读者我要写书评

暂无评论

Concatenated coding scheme for MTCM/CPFSK with hamming code

引用

ELECTRONICS LETTERS 2000年第13期36卷 1127-1129页

作者： Kim, SG Lee, HK Kim, K KJIST Dept Informat & Commun Kwangju 500712 South Korea Hongik Univ Dept Radio Commun Sci & Engn Seoul South Korea

An investigation into the burst statistics of multiple symbol trellis coded continuous phase frequency shift keying is presented. Based on this investigation, an outer linear block code with a block interleaver has be... 详细信息

关键词： hamming code burst statistics concatenated codes error correction codes hamming codes MTCM/CPFSK interleaved codes continuous phase frequency shift keying block interleaver codes trellis codes multiple symbol trellis coded outer linear block code concatenated coding scheme frequency shift keying phase shift keying burst error correction block codes

来源：评论

学校读者我要写书评

暂无评论

High capacity partial reversible data hiding by hamming code

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2020年第31-32期79卷 23425-23444页

作者： Wu, Xiaotian Yang, Ching-Nung Liu, Yen-Wei Jinan Univ Dept Comp Sci Guangzhou Peoples R China Natl Dong Hwa Univ Dept Comp Sci & Informat Engn Hualien Taiwan

A high capacity partial reversible data hiding (PRDH) is introduced in this paper. First of all, an original image is converted to a cover image by the proposed image transformation algorithm. The image transformation algorithm adopts (7,4) hamming code and minimal pairwise square error to ensure that the generated cover image is an almost distortion-free original image. The secret bits are embedded into the cover image by flipping and modifying the cover bits with respect to the syndrome generated by hamming code. When the secret bits are extracted from the stego image, it can be transformed back to a cover image by the error-correcting ability provided by hamming code. And this is the so-called partial reversible property. The visual performance and embedding capacity of the proposed method are theoretical analyzed. According to the experimental and theoretical results, high embedding capacity with acceptable visual performance is achieved by the proposed method. More specifically, the embedding rate is 10.5 times of Jana et al.'s method and Yang et al.'s proposed PRDH, and 3.5 times of Yang et al. 's modified PRDH.

关键词： Data hiding Partial reversible data hiding hamming code High capacity Error correcting Syndrome decoding

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Encoding and Check code Circuit with hamming code on QCA

引用

INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING 2014年第5-6期10卷 391-404页

作者： Xie, Guangjun Xiang, Yunlong Zhang, Yongqiang Liu, Shuai Lv, Hongjun Hefei Univ Technol Sch Elect Sci & Appl Phys Hefei 230009 Anhui Peoples R China

With hamming code encoding data and checking code in data access, this paper researches on the encode/check code circuit with hamming code designed based on Quantum-dot Cellular Automata (QCA). By inserting error correction code in original data to realize the data error recovery function, the QCA XOR gate model and the QCA matrix operation circuit have been devised. What's more, their properties are compared and analyzed. The results show that the QCA matrix operation circuit has shorter delay and fewer cellular than the QCA XOR, also it has simple structure and pretty good extensibility, so as to improving the reliability of the data. QCA Designer has been employed for simulation of the proposed designs and the results proved their validity.

关键词： Quantum-dot Cellular Automata Redundant array of independent disks hamming code XOR gate Matrix operation circuit

来源：评论

学校读者我要写书评

暂无评论

AMBTC based high payload data hiding with modulo-2 operation and hamming code

引用

MATHEMATICAL BIOSCIENCES AND ENGINEERING 2019年第6期16卷 7934-7949页

作者： Li, Li He, Min Zhang, Shanqing Luo, Ting Chang, Chin-Chen Hangzhou Dianzi Univ Sch Comp Sci & Technol Hangzhou 310018 Zhejiang Peoples R China Ningbo Univ Coll Sci & Technol Ningbo 315000 Zhejiang Peoples R China Feng Chia Univ Dept Informat Engn & Comp Sci Taichung 40724 Taiwan

An efficient data hiding method with modulo-2 operation and hamming code (3, 2) based on absolute moment block truncation coding (AMBTC) is proposed. In order to obtain good data hiding performance, different textures are assigned to different embedding strategies. The AMBTC compressed codes are divided into smooth and complex blocks according to texture. In the smooth block, the secret data and the four most significant bits plane of the two quantization levels are calculated using modulo-2 operation to replace the bitmap in order to improve the security of data transmission. Moreover, hamming code (3, 2) is used to embed the two additional secret bits in the three significant bits planes of the two quantization levels. In the complex block, one secret bit is embedded by swapping the order of two quantization levels and flipping the bitmap. Experimental results show that the proposed method achieves higher capacity than the existing data hiding methods and maintains good visual quality.

关键词： data hiding AMBTC modulo-2 operation hamming code high payload

来源：评论

学校读者我要写书评

暂无评论

hamming code based watermarking scheme for 3D model verification

Hamming code based watermarking scheme for 3D model verifica...

引用

International Symposium on Computer, Consumer and Control (IS3C)

作者： Wang, Jen-Tse Chang, Yi-Ching Yu, Shyr-Shen Yu, Chun-Yuan Hsiuping Univ Sci & Technol Dept Informat Management Taichung 412 Taiwan Natl Chung Hsing Univ Dept Comp Sci & Engn Taichung 402 Taiwan Nan Kai Univ Technol Dept Digital Living Innovat Tsaotun 542 Nantou County Taiwan

ISBN: (纸本)9781479952779

The technique of 3D modeling and the Internet progress quickly, the issue of the copyright of 3D models has become more and more important. There is a public hamming code based fragile watermarking technique proposed in this paper. The target of this article is to verify the authenticity of the model. An adaptive watermark is generated by using hamming code which extract some specific data from each cover model. The watermark is then embedded into the model. Using hamming procedure to generate watermark do not need original model and watermark information for verification in extracted stage. Experimental results show that the embedding rate achieve 100%. And the distortion of every stego model can be controlled below 10(-10).

关键词： component 3D model public watermark fragile watermarking hamming code

来源：评论

学校读者我要写书评

暂无评论

A reversible data hiding scheme based on (5,3) hamming code using extra information on overlapped pixel blocks of grayscale images

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2021年第9期80卷 13099-13120页

作者： Nguyen, Tuan Duc Le, Huu Dung Hanoi Open Univ Hanoi Vietnam

In this paper, we propose a reversible data hiding scheme using (5, 3) hamming code. A cover image is partitioned into blocks of five pixels. An adjusted (5, 3) hamming code method is then applied to find a possible modification position in these blocks to conceal message bits. The estimated position is used to determine the started pixel in the next block and this pixel may belong to the current block of pixels. This means that the overlapped pixel blocks are employed in the proposed scheme to hide secret data. As a result, the proposed scheme provides an average embedding payload reaches to 1.2 bits per pixel (bpp). The embedding positions are also utilized as a secret key to protect the hidden message from extracting attacks and extra information in the image recovering process. An original image can be recovered with no error after an extraction process has been completed. The experiment results obtained from 10,000 natural images in BOWS-2 prove that the proposed scheme can achieve a higher embedding rate, better stego-image perceptual quality, and higher security against detection and extraction attacks compared with the existing approaches.

关键词： Reversible data hiding hamming code Ensemble classifier High capacity Overlapped pixel block

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：