I am sorry, i want a large linear code capable of correcting t errors so i 
can experiment with a simple McEliece implementation without using goppa 
codes.
I am searching many hours for the right code family and the code 
constructors of sage without any luck.

On Thursday, October 6, 2016 at 5:29:09 PM UTC+3, Giorgos Marios wrote:
>
> Hello,
>
> Let's say I have a -Vector space of dimension n over Finite Field of size 
> 2- I would like to know, how to create a large Linear code with *specific 
> weight and number of errors it can handle*.
> Also i would like to know, if after that is possible to construct a fast 
> decoder.
>
> Thank you very much!
>

-- 
You received this message because you are subscribed to the Google Groups 
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sage-support.
For more options, visit https://groups.google.com/d/optout.

Reply via email to