fix documentation errors

Author: Fe-r-oz

docs/src/Classical/cyclic_code.md

@@ -82,10 +82,6 @@ qcosets
 qcosets_reps
 ```
 
-```@docs
-defining_set
-```
-
 ```@docs
 zeros
 ```

docs/src/Classical/linear_code.md

@@ -50,9 +50,6 @@ standard_form_permutation
 ```
 
 The minimum distance of some code families are known and are set during construction. The minimum distance is automatically computed in the constructor for codes which are deemed "small enough". Otherwise, the minimum distance is `missing`. Primitive bounds on the minimum distance are given by
-```@docs
-minimum_distance_lower_bound
-```
 
 ```@docs
 minimum_distance_upper_bound

docs/src/LDPC/codes.md

@@ -121,28 +121,6 @@ shortest_cycles
 ```
 
 Various information about the ACE values of cycles in the Tanner graph may be computed with the following functions.
-```@docs
-ACE_spectrum
-```
-
-```@docs
-shortest_cycle_ACE
-```
-
-```@docs
-ACE_distribution
-```
 
-```@docs
-average_ACE_distribution
-```
-
-```@docs
-median_ACE_distribution
-```
-
-```@docs
-mode_ACE_distribution
-```
 
 ## Greedy Construction Algorithms

docs/src/LDPC/decoders.md

@@ -21,18 +21,10 @@ sum_product_box_plus
 min_sum
 ```
 
-```@docs
-find_MP_schedule
-```
-
 ## Linear Programming
 
 ```@docs
 LP_decoder_LDPC
 ```
 
 ## Simulations
-
-```@docs
-decoder_simulation
-```

docs/src/Tutorials/Message Passing.md

@@ -406,7 +406,7 @@ julia> Gallager_B(H, y)
 ```
 
 ## Decimation
-Decimation was previously used in message-passing applications outside of error correction and was applied to stabilizer codes in [](@cite). The idea is to freeze the value of a variable node. We can either do this from the start to obtain a so-called *genie-aided* decoder, or we can periodically pause message passing to fix a bit. In *guided decimation*, we pause every fixed number of rounds and freeze the value of the variable node with the highest log-likelihood ratio. In *automated decimation*, we pause after every iteration and fix any bit whose absolute value has passed a certain threshold.
+Decimation was previously used in message-passing applications outside of error correction and was applied to stabilizer codes [yao2024belief](@cite). The idea is to freeze the value of a variable node. We can either do this from the start to obtain a so-called *genie-aided* decoder, or we can periodically pause message passing to fix a bit. In *guided decimation*, we pause every fixed number of rounds and freeze the value of the variable node with the highest log-likelihood ratio. In *automated decimation*, we pause after every iteration and fix any bit whose absolute value has passed a certain threshold.
 
 It is important to note that when a variable node is fixed to a specific value, the decoder is now sampling possible solutions with that fixed bit, which is different from the ML and MAP problems above. Furthermore, if there is a unique solution and a bit is fixed which does not match the solution, the decoder will fail instead of correcting that bit. For example, fixing the most reliable bit in guided decimation may mean fixing a bit which is still far from reliable and could go either way. On the other hand, fixing a bit could help the decoder converge faster and also break out of trapping sets. In this sense, decimation can be very helpful decoding degenerate stabilizer codes where there are many valid solutions and BP has a difficult time picking one to converge to.
 

docs/src/references.bib

@@ -174,3 +174,12 @@ @article{roffe2023bias
   year={2023},
   publisher={Verein zur F{\"o}rderung des Open Access Publizierens in den Quantenwissenschaften}
 }
+
+@inproceedings{yao2024belief,
+  title={Belief propagation decoding of quantum LDPC codes with guided decimation},
+  author={Yao, Hanwen and Laban, Waleed Abu and H{\"a}ger, Christian and i Amat, Alexandre Graell and Pfister, Henry D},
+  booktitle={2024 IEEE International Symposium on Information Theory (ISIT)},
+  pages={2478--2483},
+  year={2024},
+  organization={IEEE}
+}

src/Classical/cyclic_code.jl

@@ -433,11 +433,7 @@ Return the set of representatives for the q-cyclotomic cosets of the cyclic code
 """
 qcosets_reps(C::AbstractCyclicCode) = C.qcosets_reps
 
-"""
-    defining_set(C::AbstractCyclicCode)
 
-Return the defining set of the cyclic code.
-"""
 defining_set(C::AbstractCyclicCode) = C.def_set
 
 """