Encoding of algebraic geometry codes with quasi-linear complexity
$O(N\log N)$
Encoding of algebraic geometry codes with quasi-linear complexity
$O(N\log N)$
Fast encoding and decoding of codes have been always an important topic in code theory as well as complexity theory. Although encoding is easier than decoding in general, designing an encoding algorithm of codes of length $N$ with quasi-linear complexity $O(N\log N)$ is not an easy task. Despite the fact …