Hi,
Consider the following code (the field is arbitrary in this case)
sage: code = codes.HammingCode(2, GF(4,'a'))
The codewords (vectors) cannot be changed (note the absence of an error):
sage: code[0]
(0, 0, 0, 0, 0)
sage: code[0][0] = 1
sage: code[0]
(0, 0, 0, 0, 0)
yet they are not immutable
tal: 16 ms
Wall time: 16 ms
sage: %time V = A.rows()
CPU times: user 0 ns, sys: 0 ns, total: 0 ns
Wall time: 2.55 ms
sage: A = matrix(GF(2),10, 10)
sage: type(A)
sage: v = vector(GF(2),10)
sage: type(v) # specialised type
So I'm afraid the answer is: "implement it and send a patch&quo
_element() for __ in range(10^6)]
CPU times: user 58.41 s, sys: 0.20 s, total: 58.60 s
Wall time: 58.75 s
I do wonder if the filling up can be done even better...
Gerli
On 11/05/14 23:34, Dima Pasechnik wrote:
On 2014-05-11, Gerli Viikmaa wrote:
Hi,
Thank you for your reply.
This doesn'
14-05-11, Gerli Viikmaa wrote:
Hi,
I am trying to analyse sets of random vectors from a vector space GF(4)^36.
For that I need to sample rather large sets (up to 10^6 vectors) many times
(I would like it to be 1000, depending on how fast I can analyse).
I first thought my analysis was slow on
Hi,
I am trying to analyse sets of random vectors from a vector space GF(4)^36.
For that I need to sample rather large sets (up to 10^6 vectors) many times
(I would like it to be 1000, depending on how fast I can analyse).
I first thought my analysis was slow on such large sets but apparently j
Hi,
Thank you for your reply. I will look into the implementation of QR codes over
non-prime fields.
All the best,
Gerli
esmaspäev, 24. märts 2014 12:54.29 UTC+2 kirjutas David Joyner:
> On Mon, Mar 24, 2014 at 6:28 AM, Gerli Viikmaa wrote:
>
> > Hi,
>
> >
>
>
Hi,
I'm working on vectors of varying sizes on GF(4) and I'm currently trying to
implement the code given in
http://www.iks.kit.edu/home/grassl/codetables/BKLC/BKLC.php?q=4&n=8&k=2
The first step (Extend the QRCode over GF(4) of length 11) should give me a
[12, 6, 6] linear code - vectors of l
