Hierarchical parallel evaluation of a Hamming code

DOI10.3390/A10020050MaRDI QIDQ1662715zbMATH OpenOpenAlexFDO

Authors Shmuel T. Klein, Dana Shapira

Publication date 20 August 2018

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/a10020050

zbMATH Keywords

parallel algorithmserror correcting codesHamming code

Mathematics Subject Classification ID

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)

Recommendations

• Parity Check Codes for Logic Processors
• Error Correction and Detection, a Geometric Approach
• Parallel error correcting codes
• Parallel implementation of the Schur Berlekamp-Massey algorithm on a linearly connected processor array
• Publication:4862350

Cites work

• Error detecting and error correcting codes
• Improving deduplication techniques by accelerating remainder calculations
• Layouts for improved hierarchical parallel computations

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
• scientific article; zbMATH DE number 1066966 (Why is no real title available?)
• 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)