diff --git a/lib/ftrsd/ftrsd_paper/ftrsd.lyx b/lib/ftrsd/ftrsd_paper/ftrsd.lyx
index cf6aacb23..48ac38ff6 100644
--- a/lib/ftrsd/ftrsd_paper/ftrsd.lyx
+++ b/lib/ftrsd/ftrsd_paper/ftrsd.lyx
@@ -75,7 +75,7 @@
 \begin_body
 
 \begin_layout Title
-Open Source Soft-Decision Decoder for the JT65 (63,12) Reed-Solomon code
+Open Source Soft-Decision Decoder for the JT65 (63,12) Reed-Solomon Code
 \end_layout
 
 \begin_layout Author
@@ -851,7 +851,7 @@ The FT algorithm uses quality indices made available by a noncoherent 64-FSK
 \end_inset
 
  of the symbol's fractional power 
-\begin_inset Formula $p_{1,\, j}$
+\begin_inset Formula $p_{1,\,j}$
 \end_inset
 
  in a sorted list of 
@@ -921,7 +921,7 @@ t educated guesses to select symbols for erasure.
 , the soft distance between the received word and the codeword: 
 \begin_inset Formula 
 \begin{equation}
-d_{s}=\sum_{j=1}^{n}\alpha_{j}\,(1+p_{1,\, j}).\label{eq:soft_distance}
+d_{s}=\sum_{j=1}^{n}\alpha_{j}\,(1+p_{1,\,j}).\label{eq:soft_distance}
 \end{equation}
 
 \end_inset
@@ -939,7 +939,7 @@ Here
 \end_inset
 
  if the received symbol and codeword symbol are different, and 
-\begin_inset Formula $p_{1,\, j}$
+\begin_inset Formula $p_{1,\,j}$
 \end_inset
 
  is the fractional power associated with received symbol 
@@ -983,7 +983,7 @@ In practice we find that
 \begin_layout Standard
 \begin_inset Formula 
 \begin{equation}
-u=\frac{1}{n}\sum_{j=1}^{n}S(c_{j},\, j).\label{eq:u-metric}
+u=\frac{1}{n}\sum_{j=1}^{n}S(c_{j},\,j).\label{eq:u-metric}
 \end{equation}
 
 \end_inset
@@ -1016,7 +1016,7 @@ The correct JT65 codeword produces a value for
 
  bins containing noise only.
  Thus, if the spectral array 
-\begin_inset Formula $S(i,\, j)$
+\begin_inset Formula $S(i,\,j)$
 \end_inset
 
  has been normalized so that the average value of the noise-only bins is
@@ -1265,7 +1265,7 @@ For each received symbol, define the erasure probability as 1.3 times the
 a priori
 \emph default
  symbol-error probability determined from soft-symbol information 
-\begin_inset Formula $\{p_{1}\textrm{-rank},\, p_{2}/p_{1}\}$
+\begin_inset Formula $\{p_{1}\textrm{-rank},\,p_{2}/p_{1}\}$
 \end_inset
 
 .
@@ -2450,10 +2450,6 @@ kvasd[.exe]
 Acknowledgments
 \end_layout
 
-\begin_layout Standard
-We thank X, Y, and Z for A and B...
-\end_layout
-
 \begin_layout Bibliography
 \begin_inset CommandInset bibitem
 LatexCommand bibitem
@@ -2582,7 +2578,12 @@ key "wsjt_sourceforge"
 
 \end_inset
 
-The WSJT project at SourceForge, https://sourceforge.net/projects/wsjt/
+Source code for all programs in the 
+\emph on
+WSJT
+\emph default
+ project is stored in a Subversion repository at Sourceforge: https://sourceforg
+e.net/projects/wsjt/
 \end_layout
 
 \begin_layout Bibliography
@@ -2593,7 +2594,8 @@ key "karn"
 
 \end_inset
 
-Berlekamp-Massey decoder written by Phil Karn, KA9Q: http://www.ka9q.net/code/fec/
+Errors-and erasures decoder for the Berlekamp-Massey algorithm written by
+ Phil Karn, KA9Q: http://www.ka9q.net/code/fec/
 \end_layout
 
 \begin_layout Section