Hierarchical parallel evaluation of a Hamming code
DOI10.3390/A10020050zbMATH Open1461.94100OpenAlexW2611486699MaRDI QIDQ1662715FDOQ1662715
Authors: Shmuel T. Klein, Dana Shapira
Publication date: 20 August 2018
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a10020050
Recommendations
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Parallel algorithms in computer science (68W10) Linear codes (general theory) (94B05)
Cites Work
Cited In (6)
- On the connection between Hamming codes, Heapsort and other methods
- Parity Check Codes for Logic Processors
- Improvements on binary coding using parallel computing
- Title not available (Why is that?)
- Dependability Aspects Regarding the Cache Level of a Memory Hierarchy using Hamming Codes
- Parallelizations of the Error Correcting Code Problem
This page was built for publication: Hierarchical parallel evaluation of a Hamming code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662715)