Like most lattice basis reduction algorithms, Block Korkin-Zolotarev reduction is not unique, not even in the case of one block: the first vector is a shortest vector in the lattice, the second vector corresponds to a shortest vector in the lattice after projecting onto the orthogonal complement of the first, and so on. If you choose a different shortest vector in the various stages, you end up with a different outcome since the algorithm may select a different shortest vector.
-- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
