Changeset 7770:b786895b1e12

Timestamp:

11/27/07 16:52:14 (5 years ago)

Author:

R. L. Miller <rlmillster@…>

Branch:

default

Message:

fighting bugs in n=16

File:

• sage/coding/binary_code.pyx (modified) (5 diffs)

sage/coding/binary_code.pyx

@@ -2295 +2295 @@
 
         badass = 0
+        LLL = []
 
         state = 1
         while state != -1:
-            if False:#badass > 39:
+            print badass
+            if False:#badass > 620:
+                print '-----'
+                print badass
+                print "k:", k
+                if k != -1:
+                    if v[k]&nu.flag:
+                        print "v[k]: word ", v[k]^nu.flag
+                    else:
+                        print "v[k]: col ", v[k]
+                    if tvc&nu.flag:
+                        print "tvc- wd", tvc^nu.flag
+                    else:
+                        print "tvc- col", tvc
+                    if W[self.Phi_size * k]:
+                        print "W[k]: cols", Integer(W[self.Phi_size * k]).binary()
+                    else:
+                        j = nwords/self.radix
+                        if nwords%self.radix:
+                            j += 1
+                        L = ''
+                        for i from 0 <= i < j:
+                            if i == j - 1:
+                                jj = nwords%self.radix
+                                if jj == 0:
+                                    jj = self.radix
+                            else:
+                                jj = self.radix
+                            for ii from 0 <= ii < jj:
+                                if W[self.Phi_size * k + 1 + i] & (1 << ii):
+                                    L += '1'
+                                else:
+                                    L += '0'
+                        print "W[k]: words", L#[Integer(W[self.Phi_size * k + 1 + i]).binary() for i from 0 <= i < j]                
+                print "state:", state
+                print '-----'
+            if False:#badass > 620:
                 print '-----'
                 print badass
@@ -2458 +2495 @@
 
                 nu.get_permutation(zeta, word_gamma, col_gamma, ham_wts)
-#                print "gamma:", [word_gamma[i] for i from 0 <= i < nwords], [col_gamma[i] for i from 0 <= i < ncols]
+                #if badass > 620: 
+                print "gamma:", [word_gamma[i] for i from 0 <= i < nwords], [col_gamma[i] for i from 0 <= i < ncols]
+                print Theta
                 # if C^gamma == C, the permutation is an automorphism, goto 10
+                #if badass > 620:
+                print C.is_automorphism(col_gamma, word_gamma)
                 if C.is_automorphism(col_gamma, word_gamma):
                     state = 10
                 else:
+                    LLL.append([[col_gamma[i] for i from 0 <= i < ncols],[word_gamma[i] for i from 0 <= i < nwords]])
                     state = 8
 
@@ -2483 +2525 @@
                 # if C(nu) == C(rho), get the automorphism and goto 10
                 rho.get_permutation(nu, word_gamma, col_gamma, ham_wts)
-#                print "gamma:", [word_gamma[i] for i from 0 <= i < nwords], [col_gamma[i] for i from 0 <= i < ncols]
+                #if badass > 620:
+                print "gamma:", [word_gamma[i] for i from 0 <= i < nwords], [col_gamma[i] for i from 0 <= i < ncols]
+                print Theta
                 state = 10
 
@@ -2541 +2585 @@
                 # Now incorporate the automorphism into Theta
                 j = Theta.merge_perm(col_gamma, word_gamma)
-#                if not j: print "no j"
+                if badass > 620: print Theta
+
                 # j stores whether anything happened or not- if not, then the automorphism we have
                 # discovered is already in the subgroup spanned by the generators we have output
@@ -2756 +2801 @@
                 state = 13
 
+        for LL in LLL:
+            print LL, ',\\'
         # end big while loop
         rho.find_basis(ham_wts)