refs

codes/classical/bits/easy/dual_hamming/hadamard.yml

@@ -38,7 +38,7 @@ relations:
     - code_id: simplex
       detail: 'The \([2^m-1,m,2^{m-1}]\) shortened Hadamard code is the simplex code (a.k.a. RM\(^*(1,m)\)).'
     - code_id: biorthogonal
-      detail: 'The \([2^m,m+1,2^{m-1}]\) augmented Hadamard code is the first-order RM code (a.k.a. RM\((1,m)\)).'
+      detail: 'The \([2^m,m+1,2^{m-1}]\) augmented Hadamard code is the first-order RM code (a.k.a. RM\((1,m)\)). Rows of a Hadamard matrix forming a Prometheus orthonormal set (PONS) are codewords of a coset of RM\((1,m)\) in RM\((2,m)\) \cite{doi:10.1007/1-4020-2307-3_7}.'
     - code_id: delsarte_optimal_q-ary
       detail: 'Hadamard codes for \(q=4r\) are sharp configurations \cite[Table 12.1]{preset:HKSbounds}.'
     - code_id: univ_opt_q-ary

codes/classical/bits/tanner/ldpc.yml

@@ -46,7 +46,7 @@ features:
 
 notes:
   - 'The potential of LDPC codes was noted by Margulis \cite{doi:10.1007/BF02579283}, but realized by the broader community \cite{doi:10.1049/el:19970362,doi:10.1109/18.748992} much later after their discovery by Gallager \cite{doi:10.1109/TIT.1962.1057683,manual:{R. Gallager, \emph{Low-density parity check codes}. 1963. PhD thesis, MIT Cambridge, MA.}}.'
-  - 'See books \cite{doi:10.1093/acprof:oso/9780198570837.001.0001,doi:10.1017/9781009283403} and reviews \cite{doi:10.1088/0305-4470/37/6/R01,doi:10.1016/S0924-8099(07)80009-6} for introductions to LDPC codes, belief-propagation decoding, and connections to statistical mechanics.
+  - 'See books \cite{doi:10.1093/acprof:oso/9780198570837.001.0001,doi:10.1093/acprof:oso/9780198509417.001.0001,doi:10.1017/9781009283403} and reviews \cite{doi:10.1088/0305-4470/37/6/R01,doi:10.1016/S0924-8099(07)80009-6} for introductions to LDPC codes, belief-propagation decoding, and connections to statistical mechanics.
   Other introductory references include Refs. \cite{doi:10.1109/MCOM.2003.1222728,manual:{Johnson, Sarah J. "Introducing low-density parity-check codes." University of Newcastle, Australia 1 (2006): 2006.},preset:MacKay,doi:10.1201/9780203490310} as well as a review of LDPC codes circa 2005 \cite{doi:10.1007/978-3-0348-7865-4_5}.'
   - 'See Kaiserslautern database \cite{preset:KLdatabase} for explicit representatives of several classes of LDPC codes, including \(q\)-ary, WiMAX, multi-edge, and spatially-coupled.'
   - 'See pretty-good-codes database \cite{preset:PGCdatabase} for explicit representatives and benchmarking.'
@@ -66,7 +66,7 @@ relations:
     - code_id: random
       detail: 'LDPC codes are often constructed non-determinisitically.'
     - code_id: hamiltonian
-      detail: 'There are relations between LDPC codes and statistical mechanical models of spin glasses \cite{arxiv:cond-mat/0205051,doi:10.1093/acprof:oso/9780198570837.001.0001,doi:10.1017/9781009283403}.'
+      detail: 'There are relations between LDPC codes and statistical mechanical models of spin glasses \cite{arxiv:cond-mat/0205051,doi:10.1093/acprof:oso/9780198570837.001.0001,doi:10.1093/acprof:oso/9780198509417.001.0001,doi:10.1017/9781009283403}.'
 
 
 # Begin Entry Meta Information

codes/classical/q-ary_digits/convolutional/convolutional.yml

@@ -29,7 +29,7 @@ realizations:
   - 'A convolutional code with rate 1/2 was used for deep-space and satellite communication \cite{manual:{Butman, Deutsch, and Miller. Performance of concatenated codes for deep space missions. 1981.}}'
 
 notes:
-  - 'There are connections between convolutional codes and statistical mechanical models \cite{doi:10.1103/PhysRevLett.70.2968,doi:10.1093/acprof:oso/9780198570837.001.0001}.'
+  - 'There are connections between convolutional codes and statistical mechanical models \cite{doi:10.1103/PhysRevLett.70.2968,doi:10.1093/acprof:oso/9780198570837.001.0001,doi:10.1093/acprof:oso/9780198509417.001.0001}.'
 
 relations:
   parents: