This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
D-Heaps as Hash Tables for Vectors over a Finite Ring
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
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.
Index Terms:
Sage, Magma, Finite Rings, D-Heaps, Hashing, Cython
Citation:
César A. García-Vazquez, Carlos A. López-Andrade, "D-Heaps as Hash Tables for Vectors over a Finite Ring," csie, vol. 3, pp.162-166, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.