Los Angeles, CA
March 31, 2009 to April 2, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.341
We present a method to store a set of vectors whose coefficients are elements over a finite ring or a prime field. A D-heap is used with the space-time tradeoff technique, to avoid collisions, to store a vector in a set in $\Theta(n)$ time, where $n$ is the length of the vector. We compare this method to hash tables and show why their worst case is the best case of this method. Also the implementation is given in Sage to work with coding theory libraries.
Sage, Magma, Finite Rings, D-Heaps, Hashing, Cython
César A. García-Vazquez, Carlos A. López-Andrade, "D-Heaps as Hash Tables for Vectors over a Finite Ring", CSIE, 2009, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009, pp. 162-166, doi:10.1109/CSIE.2009.341