On Sat, Dec 06, 2008 at 01:38:49PM +0100, Marco Maso wrote:
Please note that n=262128 can be obtained with a primitive polynomial
of grade 18 (n^18=262144) so we are far from GF(31) or GF(63) limit...
The grade of the generator is 168 as n-k=168 (so again its grade is
bigger than the
Il giorno Fri, 5 Dec 2008 22:06:40 +0100
[EMAIL PROTECTED] ha scritto:
As the Galois field is represented as a set on int values the
maximum Galois feild that can be represented is GF(2^31), which was a
primitive polynomial of order 32. This is in fact the grade I was
talking about.
Ok. But
On Fri, Dec 05, 2008 at 10:21:32AM +0100, Marco Maso wrote:
When you talk about maximum grade 31 for a x86 and 63 for a x86_64 what
are you referring?
If you are referring to the grade of the generator polynomial I'm stuck
and I couldn't do anything without heavily moddifying the code (if I've
Marco Maso wrote:
I have made some tests. Now when I try to create a BCH code with
n=262128 and k=261960, with a generator polyonomial of grade 168 I
receive:
error: primitive polynomial (0) of Galois Field must be irreducible
error: unable to initialize Galois Field
Note that the
I'm currently working with BCH codes yet, since September, and after
having solved my initial problems I receive a new error if i try to
encode a word of length ~ 2^18 I receive:
error: invalid order 18 for Galois Field
To give evidence of the fact I can post an example:
let's assume that the
So you are telling me that my problem can't be solved. I confirm that
Matlab has this limitation too.
I have to work with codewords whose length is less than 2^16, so at the
beginning I thought that I could use them with the functions but I were
wrong. The codes I'm trying to obtain are shortened
On Sat, Nov 29, 2008 at 10:45:55PM +0100, Marco Maso wrote:
So you are telling me that my problem can't be solved. I confirm that
Matlab has this limitation too.
Well in Matlab I'd say that yes the problem is unsolvable. However for
Octave, you have the source.. Change the lines
