Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 2,644 papers for “Hamming code”
2006
corrects all single bit errors (in a codeword consisting of either 64-bit data and 8 parity bits, or 32-bit data and 7 parity bits), and it detects double bit errors in the data. This design utilizes Hamming code, a simple yet powerful method for ECC operations. As a result, this design offers exceptional performance and resource utilization.
Cited by 0
Siehler, Jacob A. · Acervo Digital da Universidade Estadual Paulista (Universidade Estadual Paulista) · 2013
Cited by 1
Rino Micheloni, Alessia Marelli, Roberto Ravasio · 2008
Cited by 0
M.D. Gochiyaeva, V.V. ZHdanova · 2019
S ss . , . , , , .
Cited by 0Open access
Peter Winkler, Jess Johnson · 2024
Cited by 0
Tatiana Tabirca, E. Ciurea, Sabin Tabirca · Proceedings of the 6th International Conference on Optimization of Electrical and Electronic Equipments · 2005
Cited by 0
Andy Liu · College Mathematics Journal · 2009
Click to increase image sizeClick to decrease image size Additional informationNotes on contributorsAndy LiuAndy Liu (al3@ualberta.ca) has a doctorate in mathematics and a graduate diploma in elementary education. His research interest spans combinatorics, geometry, mathematics recreation, and mathematics education. He is at present on the Board of Governors of the MAA, and serves as co-editor of the Problem Corner in Math Horizons. He was the Deputy Leader of the USA IMO team from 1981 to 1984, and won a Tepper Haimo Award in 2004.
Cited by 4
Islam Amro · 2013
In this paper, we exploit the Hamming Correction Code Compressor (HCDC) to compress speech signals of different sampling rates and bit resolutions, the compression is carried out directly to samples in its Pulse Code Modulation (PCM) form, with no prior processing. The resulting compression rate was around 2.3 in average for the tested datasets. The results were compared against the Free Lossless Audio Compression (FLAC) package which utilizes entropy coding methods (Run-Length/Golomb-Rice). The HCDC could achieve slightly better compression rate than FLAC in 8 bit resolutions samples only, while the compression rate in 16 bit resolution was less than FLAC performance and were around 1.4 average. The main advantage of using HCDC in speech compression is its relative simplicity and its lower time and space consumption compared to other lossless speech compression techniques.
Cited by 0
Pengcheng Huang, Chin‐Chen Chang, Yung‐Hui Li et al. · IEEE Access · 2020
QR code is designed as machine readable symbol, which is widely used in various fields of life due to its large message capacity and fast decoding speed. However, as a public standard, it will give rise to the security issue when delivering sensitive information with QR code. To overcome this weakness, this paper explores the characteristic of QR code to propose an efficient secret hiding mechanism to protect the sensitive information within QR code. The secret message would be embedded into cover QR code based on (8, 4) Hamming code. The error correction capacity (ECC) of QR code would correct the errors produced in the secret embedding procedure, and the valid marked QR code would reduce people’s curious. Compared to the state-of-art works, the proposed scheme achieves a better performance on the aspects of secret payload and embedding efficiency.
Cited by 32Open access
Isaque Damião Siqueira Costa · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · 2018
Neste trabalho, vamos estudar o uso de códigos para transmissões mecânicas e eletrônicas de dados, e os métodos matemáticos usados para a detecção e correção de erros de envio. A detecção de erros será feita por dígitos de checagem, exemplificadas nos seguintes códigos: CPF, UPC e ISBN. Para correção de erros, veremos os códigos de Hamming.
Cited by 0Open access
HE M. X, PETOUKHOV S. V, RICCI, Paolo Emilio · IRIS Research product catalog (Sapienza University of Rome) · 2004
Cited by 0
K. S. Nakul, Meghana Reddy, Paturi Abhiram et al. · 2024
The increasing vulnerability of memory devices to errors due to smaller transistor sizes, larger densities, and lower operating voltages raises the demand for efficient Error Correcting Codes (ECC) in memory systems in contemporary applications. Effective ECCs are essential for preserving system dependability and data integrity, particularly in mission-critical applications including data centers, aircraft, medical equipment, and automotive systems. ECCs have dramatically improved data integrity and system reliability across fields such as telecommunications, cloud computing, and automotive technology. The “Row-Wise Hamming” leverages an optimized row-wise encoding and decoding mechanism that significantly reduces redundancy. In comparison to current ECC systems, the proposed Row-wise Hamming coding methodology optimizes memory dependability by reducing power consumption, area, and maximum delay by 40 %. The results from experiments establish the superior computational overhead performance of Row-Wise Hamming ECC, hence establishing it as a highly favorable solution for modern memory dependability issues.
Cited by 5
Anil Kumar Singh · 2016
In the process of communication the information gets corrupted. Therefore, the signals received by the receiver which is different than the actual information signal. This paper stated that how receiver detect the errors in received signals and how does receiver rectify that error by using hamming code method. We have illustrated with the help of examples that how receiver identified which bit is corrupted and how do it correct by them. This paper will help to students and research scholars to understand the shortcut method of hamming code by which we can easily correct the single bit error.
Cited by 40
Mei He · Bulletin of Mathematical Biology · 2004
Cited by 73
Vimalsinh Bharatsinh Mahida · 2025
This research paper explores the application of the Hamming Code algorithm as an efficient error detection and correction technique in computer network communicationsystems.We examine the principles, algorithm rules, implementation strategies, and performance of Hamming Code compared to other error detection techniques.Through algorithm analysis, validation rules, programming demonstration, and experimental evaluations, we establish that the Hamming Code offers reliable data transmission with minimal redundancy and computational efficiency.The algorithm is suitable for realtime network communications and is widely applicable in various digital communication systems.
Cited by 0Open access
Rudolf Ahlswede · PUB – Publications at Bielefeld University (Bielefeld University) · 1987
Cited by 9Open access
Arezou Banitalebi Dehkordi, S. A. R. Abu–Bakar · 2015
The most popular metric distance used in iris code matching is Hamming distance. In this paper, we improve the performance of iris code matching stage by applying adaptive Hamming distance. Proposed method works with Hamming subsets with adaptive length. Based on density of masked bits in the Hamming subset, each subset is able to expand and adjoin to the right or left neighbouring bits. The adaptive behaviour of Hamming subsets increases the accuracy of Hamming distance computation and improves the performance of iris code matching. Results of applying proposed method on Chinese Academy of Science Institute of Automation, CASIA V3.3 shows performance of 99.96% and false rejection rate 0.06.
Cited by 12Open access
Ghasan Ali Hussain, Husam A. Wahhab, Yahya Jasim Harbi · Journal of Communications · 2023
Orthogonal Frequency Division Multiplexing (OFDM) technique is widely adopted for broadband Forth Generation (4G) wireless communication systems at present, owing to its ability to combat multi-path interference. Nevertheless, it suffers from a large Peak to Average Power Ratio (PAPR) and Out Of Band Emission (OOBE), making it unsuitable for a high-speed transmission system. On the other hand, the Filtered-OFDM (f-OFDM) system is suggested to overcome the traditional OFDM system's disadvantages and maintain its advantages. Nowadays, the developments and growing communications systems are rapid, especially on their applications such as wireless networks, internet, satellite communications, mobile telephony, etc. This increases the demand for raising the bit rates with decreasing power consumption and the bit error rates (BER). In this paper, Hamming codes are proposed to improve the f-OFDM system performance, while the presence of the subband filter in system architecture could decrease the values of OOBE than the familiar OFDM system. The outcomes showed that utilizing interleaver with Hamming code considerably improves the proposed system performance, while the OOBE values were lower than the conventional OFDM system.
Cited by 6Open access
Титаренко, С.С. · Electronic Sumy State University Institutional Repository (Sumy State University) · 2019
В роботі розроблений пристрій передачі даних на основі кода Хеммінга
Cited by 0
Dept. of Computer Science and Engineering, Techno International Batanagar, Kolkata, West Bengal 700141, India,, Diganta Sengupta, Mahamuda Sultana et al. · International Journal of Recent Technology and Engineering (IJRTE) · 2019
Technological advancements in the last two decades have witnessed a plethora of emerging technologies gaining global research attention. One of them is reversible logic due to its capability to arrest tremendous amount of heat generated in modern digital conversions at the architecture level. With CMOS reaching near capping of threshold parameters, researchers are imperatively exploring the reversible domain for possible alternatives. Telecommunication is one area which expects appreciable share of digital resources. This communication proposes the reversible version of Hamming Code converter, decoder, and Corrector unit. Hamming codes form one of the perfect codes attaining the Hamming Bound. The designs have been implemented using Toffoli Netlist. A state-of-the-art four variable reversible gate in literature has been used to design the high level schematic for part of the proposals. The authors provide the results in terms of primitive Quantum Metrics.
Cited by 1Open access