Title :
D-Heaps as Hash Tables for Vectors over a Finite Ring
Author :
García-Vázquez, César A. ; López-Andrade, Carlos A.
Author_Institution :
Fac. de Cienc. de la Comput., Benemerita Univ. Autonoma de Puebla, Puebla, Mexico
fDate :
March 31 2009-April 2 2009
Abstract :
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.
Keywords :
cryptography; encoding; file organisation; D-heaps; coding theory libraries; finite ring; hash tables; prime field; space-time tradeoff technique; vectors; Computer science; Hamming distance; Hamming weight; Libraries; Linear code; US Department of Transportation; Vectors; Zinc; Cython; D-Heaps; Finite Rings; Hashing; Magma; Sage;
Conference_Titel :
Computer Science and Information Engineering, 2009 WRI World Congress on
Conference_Location :
Los Angeles, CA
Print_ISBN :
978-0-7695-3507-4
DOI :
10.1109/CSIE.2009.341
