On 2/25/07, Pere Urbón Bayes <[EMAIL PROTECTED]> wrote:
>
> > If you read that program and then write something else, it is by
> > definition
> > a derivative work. What is the license of Leon's program? if it isn't
> > open source,
> > then reading it and writing something based on it is a poten
> If you read that program and then write something else, it is by
> definition
> a derivative work. What is the license of Leon's program? if it isn't
> open source,
> then reading it and writing something based on it is a potential copyright
> violation. Please be careful.
I know what you me
On 2/22/07, David Joyner <[EMAIL PROTECTED]> wrote:
> > This problem could be good, I don't know why but I like to work on hard
> > problems ... Where could I find some documentation about it? Could you
> > help me to start on it?
> >
>
> 1. Leon has several papers, referenced in the GUAVA manual
> PD: Actually I'm on FOSDEM '07, any one of you know it??? This event is
> the biggest free software developers event on Europe ... may be the next
> year will be a nice think to present here the SAGE project? What do you
> think?
As I'm know on an event I forgot to put the url, if you want to
Hi David and all, I read your mail and I'm agree with your first and
second proposal, I know that problems are hard to solve but this problems
are nicest for me!!!. I think I'll take the to problem on, but I'll start
with the automorphisme work, what do you think?, now I'll start with
trying the l
Pere Urbón Bayes wrote:
> El dj 22 de 02 del 2007 a les 08:15 -0500, en/na David Joyner va
> escriure:
>
>> Hi Pere, good to hear from you again.
>>
>> 1. Nick Alexander's suggestions (e.g., coding theory over rings) are good
>> ones.
>>
>> 2. Another problem is to write code to compute the au
El dj 22 de 02 del 2007 a les 08:15 -0500, en/na David Joyner va
escriure:
> Hi Pere, good to hear from you again.
>
> 1. Nick Alexander's suggestions (e.g., coding theory over rings) are good
> ones.
>
> 2. Another problem is to write code to compute the automorphism group of
> a linear code. I
Hi Pere, good to hear from you again.
1. Nick Alexander's suggestions (e.g., coding theory over rings) are good ones.
2. Another problem is to write code to compute the automorphism group of
a linear code. It is surprisingly hard to write a fast algorithm to do
this, even
in the case of binary l
