diff --git a/test/test_ecc_delfosse_generalized_reedmuller.jl b/test/test_ecc_delfosse_generalized_reedmuller.jl
index 99fbf0d7b..6d09764c0 100644
--- a/test/test_ecc_delfosse_generalized_reedmuller.jl
+++ b/test/test_ecc_delfosse_generalized_reedmuller.jl
@@ -3,16 +3,17 @@
     using LinearAlgebra
     using QuantumClifford
     using QuantumClifford.ECC
-    using QuantumClifford.ECC: DelfosseGeneralizedReedMuller, _generalize_ReedMuller_code, logz_ops, logx_ops
+    using QuantumClifford.ECC: DelfosseGeneralizedReedMuller, _generalize_ReedMuller_code
     using Nemo: matrix, GF, echelon_form
 
     @testset "Testing [[8rp, (8r − 2)p − 2m, 4]] DelfosseRepCode properties" begin
+        # TODO use MIP solver to test minimum distance
         @testset "test [16p, 14p − 8, 4]] code family that uses RM(2,4)" begin
             r = 2
             m = 4
             for i in 2:100
                 p = i
-                n = 8 *r*p
+                n = 8*r*p
                 k = (8*r-2)*p-2*m
                 stab = parity_checks(DelfosseGeneralizedReedMuller(p,r,m))
                 H = stab_to_gf2(stab)
@@ -22,12 +23,13 @@
             end
         end
 
+        # TODO use MIP solver to test minimum distance
         @testset "test [[8p, 6(p−1), 4]] code family that uses RM(1,3)" begin
             r = 1
             m = 3
             for i in 2:100
                 p = i
-                n = 8 *r*p
+                n = 8*r*p
                 k = (8*r-2)*p-2*m
                 stab = parity_checks(DelfosseGeneralizedReedMuller(p,r,m))
                 H = stab_to_gf2(stab)