fixup

Author: Fe-r-oz

docs/src/Classical/linear_code.md

@@ -31,6 +31,8 @@ cardinality
 rate
 ```
 
+See also: encode`
+
 If the linear code was created by passing in a generator (parity-check) matrix, then this matrix is stored in addition to the standard form. Note that this matrix is potentially over complete (has more rows than its rank). The standard form is returned when the optional parameter `stand_form` is set to true. Some code families are not constructed using these matrices. In these cases, the matrices are initially `missing` and are computed and cached when these functions are called for the first time. Direct access to the underlying structs is not recommended.
 ```@docs
 generator_matrix
@@ -82,6 +84,8 @@ set_distance_lower_bound!
 set_minimum_distance!
 ```
 
+See: `minimum_distance_lower_bound`, `set_distance_upper_bound!`
+
 ## Methods
 
 ```@docs

docs/src/Classical/new_codes_from_old.md

@@ -51,7 +51,7 @@ juxtaposition
 
 ## Methods
 
-If `C` is a quasi-cyclic code, `permute_code` returns a `LinearCode` object.
+If `C` is a quasi-cyclic code, `permute_code` returns a `LinearCode` object. See: `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

@@ -38,6 +38,8 @@ multiplicative_gap_lower_bound
 density_lower_bound
 ```
 
+See also: `plot_EXIT_chart`, `multiplicative_gap`
+
 ## Comments
 
 (these are just temporary notes)

docs/src/LDPC/codes.md

@@ -109,7 +109,8 @@ To count or explicitly enumerate the short cycles of the Tanner graph, use
 count_short_cycles
 ```
 
-Various information about the ACE values of cycles in the Tanner graph may be computed with the following functions.
+See also: `shortest_cycles`
 
+Various information about the ACE value  of cycles in the Tanner graph may be computed with the following functions. See: `ACE_spectrum`, `shortest_cycle_ACE`, `ACE_distribution`, `average_ACE_distribution`, `median_ACE_distribution`, `mode_ACE_distribution`
 
 ## Greedy Construction Algorithms

docs/src/LDPC/decoders.md

@@ -21,10 +21,14 @@ sum_product_box_plus
 min_sum
 ```
 
+See also: `find_MP_schedule`
+
 ## Linear Programming
 
 ```@docs
 LP_decoder_LDPC
 ```
 
 ## Simulations
+
+See: `decoder_simulation`