TY - JOUR
T1 - On the connection between Hamming codes, Heapsort and other methods
AU - Klein, Shmuel T.
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
KW - Binary search
KW - Design of algorithms
KW - Hamming codes
KW - Heapsort
KW - Subset Sum problem
UR - http://www.scopus.com/inward/record.url?scp=84878584634&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2013.05.013
DO - 10.1016/j.ipl.2013.05.013
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84878584634
SN - 0020-0190
VL - 113
SP - 617
EP - 620
JO - Information Processing Letters
JF - Information Processing Letters
IS - 17
ER -