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 understood well), if you are talking about the galois field "cardinality" this would be not a problem. A field of 2^63 - 1 elements is more than enough to represent what I'm trying to do...but probably we are in the first case, isn't it?
I say this beacuse if we are in the second case your reply isn't so related to my question about the two errors... Thanks again Marco Il giorno Thu, 04 Dec 2008 22:54:30 +0100 David Bateman <[EMAIL PROTECTED]> ha scritto: > 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 galois field is represented internally as an > Array2<int>. So on a 32-bit platform I'd say grade 31 is the maximum > supported, on a 64-bit platform it would be grade 63.. To go above > that the code would need significant changes > > D. > > -- Per favore non mandatemi allegati in Word o PowerPoint. Si veda http://www.gnu.org/philosophy/no-word-attachments.html
signature.asc
Description: PGP signature
------------------------------------------------------------------------------ SF.Net email is Sponsored by MIX09, March 18-20, 2009 in Las Vegas, Nevada. The future of the web can't happen without you. Join us at MIX09 to help pave the way to the Next Web now. Learn more and register at http://ad.doubleclick.net/clk;208669438;13503038;i?http://2009.visitmix.com/
_______________________________________________ Octave-dev mailing list Octave-dev@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/octave-dev
