{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:12:30Z","timestamp":1760242350841,"version":"build-2065373602"},"reference-count":6,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2017,4,30]],"date-time":"2017-04-30T00:00:00Z","timestamp":1493510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The Hamming code is a well-known error correction code and can correct a single error in an input vector of size n bits by adding logn parity checks. A new parallel implementation of the code is presented, using a hierarchical structure of n processors in logn layers. All the processors perform similar simple tasks, and need only a few bytes of internal memory.<\/jats:p>","DOI":"10.3390\/a10020050","type":"journal-article","created":{"date-parts":[[2017,5,2]],"date-time":"2017-05-02T11:37:20Z","timestamp":1493725040000},"page":"50","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hierarchical Parallel Evaluation of a Hamming Code"],"prefix":"10.3390","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9478-3303","authenticated-orcid":false,"given":"Shmuel","family":"Klein","sequence":"first","affiliation":[{"name":"Department of Computer Science, Bar Ilan University, Ramat Gan 52900, Israel"}]},{"given":"Dana","family":"Shapira","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Mathematics, Ariel University, Ariel 40700, Israel"}]}],"member":"1968","published-online":{"date-parts":[[2017,4,30]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","article-title":"Error Detecting and Error Correcting Codes","volume":"29","author":"Hamming","year":"1950","journal-title":"Bell Syst. Tech. J."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/j.dam.2013.01.027","article-title":"Improving deduplication techniques by accelerating remainder calculations","volume":"163","author":"Hirsch","year":"2014","journal-title":"Discret. Appl. Math."},{"key":"ref_3","unstructured":"Mitarai, H., and McCluskey, E.J. (1972). Design of a Parallel Encoder\/Decoder for the Hamming Code, Using ROM, Stanford University. Technical Report CSL\u2013TR\u201372\u201336."},{"key":"ref_4","unstructured":"Divsalar, D., and Dolinar, S. (2004). Concatenation of Hamming Codes and Accumulator Codes with High-Order Modulations for High-Speed Decoding, Jet Propulsion Laboratory (JPL)."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1109\/JCN.2015.000033","article-title":"Computationally efficient implementation of a Hamming code decoder using Graphics Processing Unit","volume":"17","author":"Islam","year":"2015","journal-title":"J. Commun. Netw."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.jda.2014.06.002","article-title":"Layouts for improved hierarchical parallel computations","volume":"28","author":"Hirsch","year":"2014","journal-title":"J. Discret. Algorithms"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/10\/2\/50\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:34:18Z","timestamp":1760207658000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/10\/2\/50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,30]]},"references-count":6,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2017,6]]}},"alternative-id":["a10020050"],"URL":"https:\/\/doi.org\/10.3390\/a10020050","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2017,4,30]]}}}