1. A method for compressing one or more numbers, said method comprising: obtaining a plurality of numbers, wherein each of said plurality of numbers is represented using zero or more bits to indicate an exponent at a given base of said given number and has a length representing a number of significant bits of said given number; for each of said plurality of numbers, obtaining a pair of values comprised of said length and said exponent and counting occurrences of said pair of values; generating a Huffman encoding comprising at least one Huffman tree based on said counting of said occurrences of said pair of values; generating one or more encoding maps comprising an array mapping each of said pair of values to a corresponding Huffman prefix code; and encoding at least one of said plurality of numbers using the one or more encoding maps.