@@ -350,9 +350,9 @@ def delsarte_bound_constant_weight_code(n, d, w, return_data=False, solver="PPL"
350
350
bd = p .solve ()
351
351
except MIPSolverException as exc :
352
352
print (f"Solver exception: { exc } " )
353
- return A , p , False if return_data else False
353
+ return ( A , p , False ) if return_data else False
354
354
355
- return A , p , bd if return_data else int (bd )
355
+ return ( A , p , bd ) if return_data else int (bd )
356
356
357
357
358
358
def delsarte_bound_hamming_space (n , d , q , return_data = False , solver = "PPL" , isinteger = False ):
@@ -433,9 +433,9 @@ def delsarte_bound_hamming_space(n, d, q, return_data=False, solver="PPL", isint
433
433
bd = p .solve ()
434
434
except MIPSolverException as exc :
435
435
print (f"Solver exception: { exc } " )
436
- return A , p , False if return_data else False
436
+ return ( A , p , False ) if return_data else False
437
437
438
- return A , p , bd if return_data else bd
438
+ return ( A , p , bd ) if return_data else bd
439
439
440
440
441
441
def delsarte_bound_additive_hamming_space (n , d , q , d_star = 1 , q_base = 0 , return_data = False , solver = "PPL" , isinteger = False ):
@@ -541,7 +541,7 @@ def delsarte_bound_additive_hamming_space(n, d, q, d_star=1, q_base=0, return_da
541
541
bd = p .solve ()
542
542
except MIPSolverException as exc :
543
543
print ("Solver exception:" , exc )
544
- return A , p , False if return_data else False
544
+ return ( A , p , False ) if return_data else False
545
545
# rounding the bound down to the nearest power of q_base, for q=q_base^m
546
546
# bd_r = roundres(log(bd, base=q_base))
547
547
m = - 1
@@ -550,7 +550,7 @@ def delsarte_bound_additive_hamming_space(n, d, q, d_star=1, q_base=0, return_da
550
550
if q_base ** (m + 1 ) == bd :
551
551
m += 1
552
552
553
- return A , p , m if return_data else m
553
+ return ( A , p , m ) if return_data else m
554
554
555
555
556
556
def _delsarte_Q_LP_building (q , d , solver , isinteger ):
@@ -690,6 +690,6 @@ def delsarte_bound_Q_matrix(q, d, return_data=False, solver="PPL", isinteger=Fal
690
690
bd = p .solve ()
691
691
except MIPSolverException as exc :
692
692
print (f"Solver exception: { exc } " )
693
- return A , p , False if return_data else False
693
+ return ( A , p , False ) if return_data else False
694
694
695
- return A , p , bd if return_data else bd
695
+ return ( A , p , bd ) if return_data else bd
0 commit comments