ankush_jn2000
Junior Member level 1
Hi,
I am seeking a routine (preferably in C) that finds the FULL solution set (if such exists) to an overdetermined, BINARY, linear system of equations (i.e. I'm working 'mod 2' GF(2)). There are many equations ( in thousands )so i am looking for any efficeint code.
I have performed various web searches, and checked out a number of numerical libraries, such as LAPACK, but of course these all work with reals or complex numbers. I have coded one of the algorithms from Numerical Recipes in C, which I have 'customised' to work mod 2, but I doubt that this is really that efficient - I'd like something really slick.
If anyone can point me at a source of efficient linear algebra routines that work over fields OTHER than the reals or the complex numbers, or can tell me where to start looking, or has a smart idea for how I might use a numerical one to give me results mod 2, then I would be most grateful.
Thanks in Advance
Ankush
I am seeking a routine (preferably in C) that finds the FULL solution set (if such exists) to an overdetermined, BINARY, linear system of equations (i.e. I'm working 'mod 2' GF(2)). There are many equations ( in thousands )so i am looking for any efficeint code.
I have performed various web searches, and checked out a number of numerical libraries, such as LAPACK, but of course these all work with reals or complex numbers. I have coded one of the algorithms from Numerical Recipes in C, which I have 'customised' to work mod 2, but I doubt that this is really that efficient - I'd like something really slick.
If anyone can point me at a source of efficient linear algebra routines that work over fields OTHER than the reals or the complex numbers, or can tell me where to start looking, or has a smart idea for how I might use a numerical one to give me results mod 2, then I would be most grateful.
Thanks in Advance
Ankush