Efficient implementation of error correction codes in hash tables

Cormen, 2009 Nicolaidis, 2005, Design for soft error mitigation, IEEE Trans Dev Mater Reliab, 5, 405, 10.1109/TDMR.2005.855790 Chen, 1984, Error-correcting codes for semiconductor memory applications: a state-of-the-art review, IBM J Res Dev, 28, 124, 10.1147/rd.282.0124 Gherman V, Evain VS, Auzanneau F, Bonhomme Y. Programmable extended SEC–DED codes for memory errors. In: IEEE VLSI test symposium (VTS); 2011. p. 140–5. Neale, 2013, A new SEC–DED error correction code subclass for adjacent MBU tolerance in embedded memory, IEEE Trans Dev Mater Reliab, 13, 223, 10.1109/TDMR.2012.2232671 Grossman JP, Jakab L. Using the BCH construction to generate robust linear hash functions. In: IEEE information theory, workshop; 2004. Lin, 2004 Richter M, Oberlaender K, Goessel M. New linear SEC–DED codes with reduced triple bit error miscorrection probability. In: IEEE on-line testing, symposium; 2008. p. 37–42. Reviriego P, Liu S-F, Lee S, Maestro JA. Efficient error detection in double error correction orthogonal latin squares codes. In: Second workshop on manufacturable and dependable multicore architectures at nanoscale (MEDIAN’13). May 30–31, 2013. Reviriego, 2013, A method to construct low delay single error correction (SEC) codes for protecting data bits only, IEEE Trans Comput Aided Des Integr Circ Syst, 32, 479, 10.1109/TCAD.2012.2226585 Ramakrishna, 1997, Efficient hardware hashing functions for high performance computers, IEEE Trans Comput, 46, 1378, 10.1109/12.641938 CAIDA Anonymized Internet Traces 2012 Dataset. <http://www.caida.org/data/passive/passive_2012_dataset.xml>