On the connection between Hamming codes, Heapsort and other methods

DOI10.1016/J.IPL.2013.05.013MaRDI QIDQ2444852zbMATH OpenOpenAlexFDO

Authors Shmuel T. Klein

Publication date 11 April 2014

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2013.05.013

zbMATH Keywords

binary searchdesign of algorithmsHamming codesHeapsortsubset sum problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Combinatorial codes (94B25)

Recommendations

• Hierarchical parallel evaluation of a Hamming code
• scientific article; zbMATH DE number 988847
• In Search of a Missing Link: A Case Study in Error-Correcting Codes
• An algorithm for generating Huffman sequences in lexicographic order
• Publication:3477954

Cites work

• A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
• Computing Partitions with Applications to the Knapsack Problem
• scientific article; zbMATH DE number 4061138 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Describes a project that uses

Uses Software

• heapsort

This page was built for publication: On the connection between Hamming codes, Heapsort and other methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444852)