On the connection between Hamming codes, Heapsort and other methods

  • Authors:

  • Shmuel T. Klein

  • Affiliations:

  • -

  • Venue:
  • Information Processing Letters
  • Year:
  • 2013

Quantified Score

Hi-index 0.89

Visualization

Abstract

A connection between Hamming codes and Heapsort is shown, namely, that they can both be derived, the first from straightforward error correcting codes and the second from a simple sorting method, using almost identical derivation processes. It is then demonstrated that the same process can work for other well-known methods. This might trigger similar derivations in the future.