else:

aut_B_aug= libgap(PermutationGroup([PermutationGroupElement([a+1for ain g])for gin aug_aut_gp_gens]))

H= libgap(aut_m).Intersection2(aut_B_aug)

rt_transversal= aut_B_aug.RightTransversal(H).List().sage()

rt_transversal= [PermutationGroupElement(g)for gin rt_transversalifstr(g) !='()']

rt_transversal= [[a-1for ain g.domain()]for gin rt_transversal]

rt_transversal= [g+list(xrange(len(g), n))

for gin rt_transversal]

rt_transversal= [[int(a)-1for ain g.ListPerm(n)]for gin aut_B_aug.RightTransversal(H)ifnot g.IsOne()]

rt_transversal.append(list(xrange(n)))

bingo2=0

for coset_repin rt_transversal:

hwp= create_word_perm(coset_rep)

fromsage.misc.functionalimportsqrt,log

from .delsarte_boundsimport (delsarte_bound_hamming_space,

delsarte_bound_additive_hamming_space)

fromsage.features.gapimportGapPackage

def_check_n_q_d(n,q,d,field_based=True):

_check_n_q_d(n,q,d,field_based=False)

ifalgorithm=="gap":

GapPackage("guava",spkg="gap_packages").require()

libgap.load_package('guava')

returnint(libgap.UpperBound(n,d,q))

ifalgorithm=="LP":

_check_n_q_d(n,q,d,field_based=False)

ifalgorithm=="gap":

GapPackage("guava",spkg="gap_packages").require()

libgap.load_package("guava")

returnQQ(libgap.UpperBoundPlotkin(n,d,q))

else:

_check_n_q_d(n,q,d)

ifalgorithm=="gap":

GapPackage("guava",spkg="gap_packages").require()

libgap.load_package("guava")

returnQQ(libgap.UpperBoundGriesmer(n,d,q))

else:

_check_n_q_d(n,q,d,field_based=False)

ifalgorithm=="gap":

GapPackage("guava",spkg="gap_packages").require()

libgap.load_package("guava")

returnQQ(libgap.UpperBoundElias(n,d,q))

else: