Algorithm 3. Pseudocode for the decompressor part of the proposed lossless compression.

Inputs: vecRice, vecFrac, vecRLE, vecUnary. Output: $x$ // reconstructed hyperspectral data. Initializations: $nVar\leftarrow$ the number of bits derived from the next unary code in vecUnary. $cnt\leftarrow$$\mathrm{the} \mathrm{run} \mathrm{length} \mathrm{obtained} \mathrm{by} \mathrm{interpreting} \mathrm{the} \mathrm{next} nVar$ bits from vecRLE. $Flag\leftarrow 0$ For all $cnt$ in vecRLE Do         While $cnt>0$ Do         If $Flag=0$ Then         $x_i \leftarrow 0$         Else         $riceCode \leftarrow$ get the next rice code from vecRice.         $seed\leftarrow \mathrm{d}\mathrm{e}\mathrm{c}\mathrm{o}\mathrm{d}\mathrm{e} (riceCode$)                 If $seed=0$ Then                 $seed\leftarrow$ the value of the next unary code from vecFrac                 $Fr\leftarrow 0$                 Else                 $m\leftarrow ⌈{\log }_2\left(2\cdot seed\right)⌉$                 $Fr\leftarrow$$\mathrm{get} \mathrm{the} \mathrm{next} m$ bits from vecFrac.                 $Fr \leftarrow Fr+1$                 End If $$x_i\leftarrow {seed}^2+Fr$$         End If         $cnt\leftarrow cnt-1$         End Do $Flag \leftarrow \mathrm{n}\mathrm{o}\mathrm{t} Flag$ End Do