misc cleanup

src/ecc/ECC.jl

@@ -102,8 +102,6 @@ function rate(c)
     return rate
 end
 
-function generator end
-
 """The distance of a code."""
 function distance end
 

src/ecc/codes/classical/recursivereedmuller.jl

@@ -19,7 +19,6 @@ Here, the matrix 0 denotes an all-zero matrix with dimensions matching `G(r - 1,
 In addition, the dimension of `RM(m - r - 1, m)` equals the dimension of the dual of `RM(r, m)`. Thus, `RM(m - r - 1, m) = RM(r, m)^⊥` shows that the [dual code](https://en.wikipedia.org/wiki/Dual_code) of `RM(r, m)` is `RM(m − r − 1, m)`, indicating the parity check matrix of `RM(r, m)` is the generator matrix for `RM(m - r - 1, m)`.
 
 See also: `ReedMuller`
-
 """
 struct RecursiveReedMuller <: ClassicalCode
     r::Int

src/ecc/codes/quantumreedmuller.jl

@@ -9,7 +9,6 @@ The ECC Zoo has an [entry for this family](https://errorcorrectionzoo.org/c/quan
 """
 struct QuantumReedMuller <: AbstractECC
     m::Int
-
     function QuantumReedMuller(m)
         if  m < 3 || m > 11
             throw(ArgumentError("Invalid parameters: m must be ≤ 3 and m ≤ 11 in order to valid code."))
@@ -23,8 +22,8 @@ function iscss(::Type{QuantumReedMuller})
 end
 
 function parity_checks(c::QuantumReedMuller)
-    RM₁₋ₘ = generator(RecursiveReedMuller(1, c.m))
-    RM₍ₘ₋₂₎₋ₘ₎ = generator(RecursiveReedMuller(c.m - 2, c.m))
+    RM₁₋ₘ = generator(RecursiveReedMuller(1,c.m))
+    RM₍ₘ₋₂₎₋ₘ₎ = generator(RecursiveReedMuller(c.m-2, c.m))
     QRM = CSS(RM₁₋ₘ[2:end, 2:end], RM₍ₘ₋₂₎₋ₘ₎[2:end, 2:end])
     Stabilizer(QRM)
 end