Changes between Initial Version and Version 1 of Ticket #20100, comment 42
 Timestamp:
 Aug 31, 2016, 5:09:37 PM (6 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

Ticket #20100, comment 42
initial v1 5 5 > In which case, in `O(n^2)`, the algorithm returns n+1 as minimum distance of the corresponding code. That input doesn't make much sense from a coding point of view, since it corresponds to the zero code of length n. Which according to some definitions has minimum distance n+1. 6 6 7 You may have to wait a bit more than `O(n^2)`: {{{ while table_D[i*j % n] == 1: ...}}} and {{{ D}}} is all {{{1}}}7 You may have to wait a bit more than `O(n^2)`: {{{ while table_D[i*j % n] == 1: ...}}} and {{{table_D}}} is all {{{1}}} 8 8 9 9 From a coding point of view, I do agree this doesn't make sense, but is the user aware of that?