suppress false positives

Author: Fe-r-oz

docs/src/Classical/linear_code.md

@@ -78,10 +78,6 @@ The minimum distance and its bounds may be manually set as well. Nothing is done
 set_distance_lower_bound!
 ```
 
-```@docs
-set_distance_upper_bound!
-```
-
 ```@docs
 set_minimum_distance!
 ```
@@ -92,10 +88,6 @@ set_minimum_distance!
 Singleton_bound
 ```
 
-```@docs
-encode
-```
-
 ```@docs
 syndrome
 ```

docs/src/Classical/new_codes_from_old.md

@@ -22,29 +22,16 @@ construction_X3
 ```
 
 The direct sum code has generator matrix `G1 ⊕ G2` and parity-check matrix `H1 ⊕ H2`.
-```@docs
-CodingTheory.⊕
-```
 
 The generator matrix of the (direct) product code is the kronecker product of the generator matrices of the inputs.
-```@docs
-CodingTheory.×
-```
 
 The parity-check matrix of the tensor product code is the kronecker product of the parity-check matrices of the inputs.
-```@docs
-CodingTheory.⊗
-```
 
 There is some debate on how to define this product. This is known to often be the full ambient space.
 ```@docs
 entrywise_product_code
 ```
 
-```@docs
-CodingTheory./
-```
-
 `juxtaposition` is representation dependent and therefore works on the potentially over-complete generator matrices, not on the standard form.
 ```@docs
 juxtaposition
@@ -53,9 +40,6 @@ juxtaposition
 ## Methods
 
 If `C` is a quasi-cyclic code, `permute_code` returns a `LinearCode` object.
-```@docs
-permute_code
-```
 
 The most common way to extend a code is to add an extra column to the generator matrix whose values make the sum of the rows zero. This is called an even extension and is the default for `extend(C)`. Alternatively, this new column may be inserted at any index `c` in the matrix, e.g. `extend(C, c)`. In the most general case, one may provide a vector `a` and define the values of the new column to be `-a` dot the row. The standard definition is clearly just the special case that `a` is the all-ones vector.
 ```@docs

docs/src/LDPC/analysis.md

@@ -27,14 +27,8 @@ optimal_threshold
 density_evolution
 ```
 
-```@docs
-plot_EXIT_chart
-```
 
 # Misc
-```@docs
-multiplicative_gap
-```
 
 ```@docs
 multiplicative_gap_lower_bound

docs/src/LDPC/codes.md

@@ -31,14 +31,7 @@ Parity-check matrix: 6 × 9
         1 1 0 0 0 0 1 1 1
 ```
 
-Random regular LDPC codes maybe be constructed via
-```@docs
-regular_LDPC_code
-```
-and irregular LDPC codes via
-```@docs
-irregular_LDPC_code
-```
+Random regular LDPC codes maybe be constructed via `regular_LDPC_code` and `irregular_LDPC_code`
 
 ## Attributes
 The polynomials ``\lambda(x)`` and ``\rho(x)`` as well as the degrees of each variable and check nodes are computed upon construction.
@@ -116,10 +109,6 @@ To count or explicitly enumerate the short cycles of the Tanner graph, use
 count_short_cycles
 ```
 
-```@docs
-shortest_cycles
-```
-
 Various information about the ACE values of cycles in the Tanner graph may be computed with the following functions.