Hierarchical parallel evaluation of a Hamming code (Q1662715)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hierarchical parallel evaluation of a Hamming code |
scientific article; zbMATH DE number 6920636
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hierarchical parallel evaluation of a Hamming code |
scientific article; zbMATH DE number 6920636 |
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
0.7389472126960754
0 references
0.730547308921814
0 references
0.7241682410240173
0 references
0.7201299667358398
0 references
