On Sun, May 24, 2015 at 12:05 PM, Dima Pasechnik wrote:
>
>
> On Saturday, 23 May 2015 22:36:10 UTC+1, vdelecroix wrote:
>>
>> On 23/05/15 12:53, Dima Pasechnik wrote:
>> > please review #18480 that fixes the corner case
>>
>> Thanks for the fix Dima.
>>
>> >> For r > 5 it seems to hang intermi
On Saturday, 23 May 2015 22:36:10 UTC+1, vdelecroix wrote:
>
> On 23/05/15 12:53, Dima Pasechnik wrote:
> > please review #18480 that fixes the corner case
>
> Thanks for the fix Dima.
>
> >> For r > 5 it seems to hang interminably, while back in
> >> November/December I could do r = 7 i
On 23/05/15 12:53, Dima Pasechnik wrote:
> please review #18480 that fixes the corner case
Thanks for the fix Dima.
For r > 5 it seems to hang interminably, while back in
November/December I could do r = 7 in a few seconds, and
>> do r = 10 without waiting too long.
Is that really becau
please review #18480 that fixes the corner case
On Saturday, 23 May 2015 11:17:32 UTC+1, Dima Pasechnik wrote:
>
> Anyhow, there is a bug in
>
> min_wt_vec_gap()
>
> in the non-GUAVA part the vector v might never get initialised. The
> if-block
>
>if dist and dist < dist_min:
>
Anyhow, there is a bug in
min_wt_vec_gap()
in the non-GUAVA part the vector v might never get initialised. The if-block
if dist and dist < dist_min:
dist_min = dist
ans = list(v)
might never gets executed, e.g. in the case
codes.HammingCode(2, GF(2)).minimum_dis
GAP in Sage was upgraded in the meantime.
On Friday, 22 May 2015 13:06:28 UTC+1, vdelecroix wrote:
>
>
>
> On 22/05/15 13:03, David Joyner wrote:
> > On Fri, May 22, 2015 at 3:46 AM, Vincent Delecroix
> > <20100.d...@gmail.com > wrote:
> >> Hello,
> >>
> >>
> >>
> >> On 22/05/15 04:33, Rob
On 22/05/15 13:03, David Joyner wrote:
On Fri, May 22, 2015 at 3:46 AM, Vincent Delecroix
<20100.delecr...@gmail.com> wrote:
Hello,
On 22/05/15 04:33, Rob Beezer wrote:
The code below fails on 6.7 with a RuntimeError.
r = 2
C = codes.HammingCode(r, GF(2))
C.minimum_distance()
This is
On Fri, May 22, 2015 at 3:46 AM, Vincent Delecroix
<20100.delecr...@gmail.com> wrote:
> Hello,
>
>
>
> On 22/05/15 04:33, Rob Beezer wrote:
>>
>> The code below fails on 6.7 with a RuntimeError.
>>
>> r = 2
>> C = codes.HammingCode(r, GF(2))
>> C.minimum_distance()
>
>
> This is a bug in the algori
Hello,
On 22/05/15 04:33, Rob Beezer wrote:
The code below fails on 6.7 with a RuntimeError.
r = 2
C = codes.HammingCode(r, GF(2))
C.minimum_distance()
This is a bug in the algorithm since it does not handle the case where
all your vectors have non zero entries. It might be because of me i
The code below fails on 6.7 with a RuntimeError.
r = 2
C = codes.HammingCode(r, GF(2))
C.minimum_distance()
For r > 5 it seems to hang interminably, while back in November/December
I could do r = 7 in a few seconds, and do r = 10 without waiting too
long.
Does anybody have any informati
10 matches
Mail list logo
