Hierarchical parallel evaluation of a Hamming code (Q1662715): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / cites work | |||
| Property / cites work: Error Detecting and Error Correcting Codes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improving deduplication techniques by accelerating remainder calculations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Layouts for improved hierarchical parallel computations / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:23, 16 July 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
