A Polynomial Algorithm for Solving the Closest Vector Problem in Tensored Root Lattices of Type D
Crossref DOI link: https://doi.org/10.1007/s42979-022-01440-2
Published Online: 2022-10-19
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Tchinda, Arnaud Girès Fobasso
Fouotsa, Emmanuel
Jugnia, Celestin Nkuimi
Text and Data Mining valid from 2022-10-19
Version of Record valid from 2022-10-19
Article History
Received: 4 December 2020
Accepted: 3 October 2022
First Online: 19 October 2022
Declarations
:
: The authors declare that they have no conflict of interest.