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

From MaRDI portal

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

Jump to:navigation, search

DOI10.1109/TIT.2025.3562424MaRDI QIDQ6960317zbMATH OpenFDO

Authors Song-Song Li, Shu Liu, Liming Ma, Yunqi Wan, Chaoping Xing

Publication date 14 July 2025

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

This page was built for publication: Encoding of algebraic geometry codes with quasi-linear complexity \(O(N\log N)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6960317)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Encoding_of_algebraic_geometry_codes_with_quasi-linear_complexity_%5C(O(N%5Clog_N)%5C)&oldid=76094277"