Encoding of algebraic geometry codes with quasi-linear complexity $O(N\log N)$

Songsong Li, Shu Liu, Liming Ma +2

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…