Algorithm 1 LEC Pseudocode

Require:$d_i$, Table of LEC codes Ensure:$b{s}_i$   if ($d_i==0$) then     $n_i=0$   else     $n_i=⎡{log}_2\left(\right|d_i\left|\right)⎤+1$   end if   $s_i$ = Table($n_i$) $▹$ extract $s_i$ from LEC Table   if ($n_i==0$) then     $b{s}_i=s_i$     return $b{s}_i$   end if   if ($d_i>0$) then     $a_i=\left(d_i\right){|}_{n_i}$${▹\left(v\right)|}_{n_i}$ is the $n_i$ low-order bits of v.   else     $a_i=(d_i-1){|}_{n_i}$   end if   $b{s}_i=(s_i,a_i)$   return $b{s}_i$