Hierarchical parallel evaluation of a Hamming code (Q1662715): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.3390/a10020050 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2611486699 / rank | |||
Normal rank |
Revision as of 23:50, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hierarchical parallel evaluation of a Hamming code |
scientific article |
Statements
Hierarchical parallel evaluation of a Hamming code (English)
0 references
20 August 2018
0 references
Summary: 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 \(\log n\) parity checks. A new parallel implementation of the code is presented, using a hierarchical structure of \(n\) processors in \(\log n\) layers. All the processors perform similar simple tasks, and need only a few bytes of internal memory.
0 references
error correcting codes
0 references
Hamming code
0 references
parallel algorithms
0 references