bib lint

Author: valbert4

codes/classical/analog/sphere_packing/lattice/points_into_lattices.yml

@@ -53,7 +53,7 @@ protection: |
   \begin{align}
     G(\Pi)=\frac{\frac{1}{n}\int_{\Pi}x\cdot x\,\textnormal{d}x}{\text{Vol}(\Pi)^{1+2/n}}\,.
   \end{align}
-  Higher-dimensional lattices yield quantizers with lower normalized second moments than the 1D integer lattice \cite{manual:{P. L. Zador, "Development and evaluation of procedures for quantizing multivariate distributions", PhD thesis, Stanford University, 1963},doi:10.1109/TIT.1982.1056490}.
+  Higher-dimensional lattices yield quantizers with lower normalized second moments than the 1D integer lattice \cite{manual:{P. L. Zador, “Development and evaluation of procedures for quantizing multivariate distributions”, PhD thesis, Stanford University, 1963},doi:10.1109/TIT.1982.1056490}.
 
   The \textit{shortest vector problem} (SVP) asks for the shortest nonzero vector in a given lattice and is related to cryptographic protocols.
   Solving SVP up to an error independent of lattice dimension is NP-complete \cite{manual:{P. van Emde Boas, “Another NP-complete problem and the complexity of computing short vectors in a lattice”, Technical Report, Department of Mathematics, University of Amsterdam (1981)},doi:10.1137/S0097539700373039}.
@@ -63,7 +63,7 @@ protection: |
 
 features:
   rate: |
-    Lattices with minimal-distance decoding achieve the capacity of the AWGN channel \cite{doi:10.1109/18.651040,doi:10.1109/TIT.1975.1055409,manual:{R. de Buda and W. Kassem, About lattices and the random coding theorem, in Abstracts of Papers, IEEE Inter. Symp. Info. Theory 1981, IEEE Press, NY 1981, p. 145},manual:{W. Kassem, "Optimal Lattice Codes for the Gaussian Channel", PhD thesis, McMaster University, 1981}}.
+    Lattices with minimal-distance decoding achieve the capacity of the AWGN channel \cite{doi:10.1109/18.651040,doi:10.1109/TIT.1975.1055409,manual:{R. de Buda and W. Kassem, About lattices and the random coding theorem, in Abstracts of Papers, IEEE Inter. Symp. Info. Theory 1981, IEEE Press, NY 1981, p. 145},manual:{W. Kassem, “Optimal Lattice Codes for the Gaussian Channel”, PhD thesis, McMaster University, 1981}}.
 
   decoders:
     - 'Sphere decoder \cite{doi:10.1090/S0025-5718-1985-0777278-8,doi:10.1007/bf01581144}.'

codes/classical/analog/sphere_packing/sphere_packing.yml

@@ -13,7 +13,7 @@ description: |
   An analog code whose points can be thought of as forming centers of spheres that pack Euclidean space \(\mathbb{R}^n\).
   Such packings can also be interpreted as complex sphere packings by mapping pairs of real coordinates to the complex plane.
   Sphere packings provide ways of encoding digital or analog information into the frequency, amplitude, and phase of one or more analog waveforms for transmission through, e.g., an optical fiber or free space.
-  This is due to Kotelnikov's \cite{manual:{V. A. Kotelnikov, "The theory of optimum noise immunity", PhD thesis, Molotov Energy Institute, Moscow, 1947}} and Shannon's \cite{doi:10.1109/JRPROC.1949.232969} fundamental observation that a discretized electromagnetic signal of finite bandwidth and average power \(P\) can be represented as a vector in \(\mathbb{R}^n\) with squared norm \(nP\).
+  This is due to Kotelnikov's \cite{manual:{V. A. Kotelnikov, “The theory of optimum noise immunity”, PhD thesis, Molotov Energy Institute, Moscow, 1947}} and Shannon's \cite{doi:10.1109/JRPROC.1949.232969} fundamental observation that a discretized electromagnetic signal of finite bandwidth and average power \(P\) can be represented as a vector in \(\mathbb{R}^n\) with squared norm \(nP\).
   Questions of capacity of electromagnetic communication channels then translate to packing problems in \(\mathbb{R}^n\) \cite{doi:10.1007/978-1-4757-6568-7}.
 
   In the electromagnetic context, the information stored in the code is called the \textit{bitstream}, coordinates used for encoding are often called \textit{signal points} and form a \textit{constellation}, and \(\mathbb{R}^n\) is called the \textit{signal space}.
@@ -68,7 +68,7 @@ features:
     - 'Each signal point is assigned its own Voronoi cell, and a received point is mapped back to the center of the Voronoi cell in which it is located upon reception.'
 
 notes:
-  - 'Database of sphere packings \cite{manual:{E. Agrell, "Database of sphere packings", 2019 \href{https://codes.se/packings}{URL}}}.'
+  - 'Database of sphere packings \cite{manual:{E. Agrell, “Database of sphere packings”, 2019 \href{https://codes.se/packings}{URL}}}.'
   - 'See Refs. \cite{doi:10.1109/18.720549,arxiv:cs/0611112} for reviews of sphere packing.'
   - 'Popular summary of an improvement over the Rogers bound in \href{https://www.quantamagazine.org/to-pack-spheres-tightly-mathematicians-throw-them-at-random-20240430/}{Quanta Magazine}.'
 

codes/classical/bits/constant_weight/combinatorial_design.yml

@@ -80,7 +80,7 @@ relations:
     - code_id: algebraic_ldpc
       detail: 'Combinatorial designs can be used to construct explicit LDPC codes \cite{doi:10.1109/ITW.2001.955146,doi:10.1109/GLOCOM.2001.965562,doi:10.1109/TCOMM.2003.816946}.'
     - code_id: hadamard
-      detail: '\textit{Hadamard designs} are combinatorial designs constructed from Hadamard matrices \cite{manual:{J. Seberry and M. Yamada, "Hadamard matrices, Sequences, and Block Designs", University of Wollongong (1992) \href{https://hdl.handle.net/10779/uow.27846666.v1}{URL}},doi:10.1002/sapm1933121321}; see Ref. \cite{doi:10.1201/9781420010541}.'
+      detail: '\textit{Hadamard designs} are combinatorial designs constructed from Hadamard matrices \cite{manual:{J. Seberry and M. Yamada, “Hadamard matrices, Sequences, and Block Designs”, University of Wollongong (1992) \href{https://hdl.handle.net/10779/uow.27846666.v1}{URL}},doi:10.1002/sapm1933121321}; see Ref. \cite{doi:10.1201/9781420010541}.'
 
 
 # Begin Entry Meta Information

codes/classical/bits/covering/nearly_perfect.yml

@@ -18,9 +18,9 @@ description: |
     \frac{{n \choose t}\left(\frac{n-t}{t+1}-\left\lfloor \frac{n-t}{t+1}\right\rfloor \right)}{\left\lfloor \frac{n}{t+1}\right\rfloor }+\sum_{j=0}^{t}{n \choose j}\leq2^{n}/K
   \end{align}
   becomes an equality \cite[Sec. 2.3.5]{doi:10.1017/CBO9780511807077}\cite[Ch. 17]{preset:MacSlo}.
-  All nearly perfect binary codes are either perfect or correspond to shortened Preparata codes or a particular family of distance-three nonlinear codes \cite{manual:{K. Lindström, "The nonexistence of unknown nearly perfect binary codes", PhD thesis, Turun yliopisto, 1975}}.
+  All nearly perfect binary codes are either perfect or correspond to shortened Preparata codes or a particular family of distance-three nonlinear codes \cite{manual:{K. Lindström, “The nonexistence of unknown nearly perfect binary codes”, PhD thesis, Turun yliopisto, 1975}}.
 
-  Similar definitions can be made for \(q\)-ary codes, but all nearly perfect \(q\)-ary codes must be perfect \cite{manual:{K. Lindstrom and M. J. Aaltonen, "The nonexistence of nearly perfect nonbinary codes for 1 =< e =< 10", Annales Universitatis Turkuensis, Ser. A I, 172 (1976)},doi:10.1016/S0019-9958(77)90519-8}.
+  Similar definitions can be made for \(q\)-ary codes, but all nearly perfect \(q\)-ary codes must be perfect \cite{manual:{K. Lindstrom and M. J. Aaltonen, “The nonexistence of nearly perfect nonbinary codes for 1 =< e =< 10”, Annales Universitatis Turkuensis, Ser. A I, 172 (1976)},doi:10.1016/S0019-9958(77)90519-8}.
 
 #  A nearly perfect \((n,K,2t+1)_q\) binary or \(q\)-ary code has the property that any \(q\)-ary string is at most \(t\) bit flips away from a codeword (see also Ref. \cite{preset:MacSlo}, \cite[Chs. 17, or the definition from]{manual:{D. Terr, “Nearly Perfect Code”, From MathWorld--A Wolfram Web Resource, created by E. W. Weisstein. https://mathworld.wolfram.com/NearlyPerfectCode.html}}).
 

codes/classical/bits/cyclic/bch.yml

@@ -22,7 +22,7 @@ features:
   rate: 'Primitive BCH codes are asymptotically bad \cite[Thm. 2.6.3]{preset:HKScyclic}.'
 
   decoders:
-    - 'Peterson decoder with runtime of \hyperref[topic:asymptotics]{order} \(O(n^3)\) \cite{doi:10.1109/TIT.1960.1057586,manual:{S. Arimoto, "Encoding and decoding of p-ary group codes and the correction system", Information Processing in Japan (in Japanese) 2, 320-325 (1961)}} (see exposition in Ref. \cite{preset:Blahut}).'
+    - 'Peterson decoder with runtime of \hyperref[topic:asymptotics]{order} \(O(n^3)\) \cite{doi:10.1109/TIT.1960.1057586,manual:{S. Arimoto, “Encoding and decoding of p-ary group codes and the correction system”, Information Processing in Japan (in Japanese) 2, 320-325 (1961)}} (see exposition in Ref. \cite{preset:Blahut}).'
     - 'Berlekamp-Massey decoder with runtime of \hyperref[topic:asymptotics]{order} \(O(n^2)\) \cite{doi:10.1109/TIT.1969.1054260,preset:Berlekamp} and modification by Burton \cite{doi:10.1109/TIT.1971.1054655}; see also \cite{preset:PetersonWeldon,doi:10.1007/978-3-7091-2945-6}.'
     - 'Sugiyama et al. modification of the extended Euclidean algorithm \cite{doi:10.1016/S0019-9958(75)90090-X,doi:10.1017/CBO9780511606267}.'
     - 'Guruswami-Sudan list decoder \cite{doi:10.1109/18.782097,doi:10.1109/SFCS.1998.743426}.'

codes/classical/bits/easy/checksum/parity_check.yml

@@ -35,7 +35,7 @@ realizations:
   - 'Can be realized on almost every communication device. SPCs are some of the earliest error-correcting codes \cite[Ch. 27]{doi:10.1201/9781315115870}.'
 
 notes:
-  - 'A parity-check code is the mod-two version of the casting out nines procedure \cite{manual:{W. W. Peterson, "Error-Correcting Codes", Scientific American 206(2), 96–111 (1962) \href{http://www.jstor.org/stable/24937230}{URL}},doi:10.1007/978-1-4612-4072-3}.'
+  - 'A parity-check code is the mod-two version of the casting out nines procedure \cite{manual:{W. W. Peterson, “Error-Correcting Codes”, Scientific American 206(2), 96–111 (1962) \href{http://www.jstor.org/stable/24937230}{URL}},doi:10.1007/978-1-4612-4072-3}.'
 
 relations:
   parents:

codes/classical/bits/graph/adjacency/higman-sims_graph.yml

@@ -13,7 +13,7 @@ introduced: '\cite{doi:10.1109/18.568714,doi:10.1016/S0012-365X(02)00513-7}'
 description: |
   A graph-based code whose generator matrix is the row space of the adjacency matrix of the Higman-Sims graph, yielding a \([100,22,22]\) code \(C_{HS}\) whose dual is a \([100,78,6]\) code \cite[Table IV]{doi:10.1109/18.568714}.
 
-  A related \([100,22,32]\) code \(C_{100}\), invariant under the Higman-Sims simple group \(HS\), is obtained by restricting a \([176,22,50]\) code invariant under the simple group \(Co_3\) \cite{manual:{W. H. Haemers, C. Parker, V. S. Pless, and V. D. Tonchev, "A design and a code invariant under the simple group \(Co_3\)", Journal of Combinatorial Theory, Series A 62, 225–233 (1993)}} to the 100 nonzero coordinates of a fixed minimum-weight codeword.
+  A related \([100,22,32]\) code \(C_{100}\), invariant under the Higman-Sims simple group \(HS\), is obtained by restricting a \([176,22,50]\) code invariant under the simple group \(Co_3\) \cite{manual:{W. H. Haemers, C. Parker, V. S. Pless, and V. D. Tonchev, “A design and a code invariant under the simple group \(Co_3\)”, Journal of Combinatorial Theory, Series A 62, 225–233 (1993)}} to the 100 nonzero coordinates of a fixed minimum-weight codeword.
   Its dual is an optimal \([100,78,8]\) code \cite[Table VI]{doi:10.1109/18.568714}.
   The full automorphism groups are \(\mathrm{Aut}(C_{HS}) = 2\cdot HS\) and \(\mathrm{Aut}(C_{100}) = HS\) \cite[Rem. 1.5]{doi:10.1109/18.568714}.
   The codes \(C_{HS}\) and \(C_{100}\) intersect in their doubly-even-weight subcodes, which have dimension 21 \cite[Rem. 1.5]{doi:10.1109/18.568714}.

codes/classical/bits/graph/incidence/homological_classical.yml

@@ -8,7 +8,7 @@ physical: bits
 logical: bits
 
 name: 'Cycle code'
-introduced: '\cite{manual:{T. Kasami, "A topological approach to construction of group codes", Journal of the Institute of Electrical Communication Engineers of Japan 44, 1316-1321 (1961)},manual:{D. A. Huffman, “A graph-theoretic formulation of binary group codes”, Summaries of papers presented at ICMCI, part 3, 29-30 (1964)},manual:{W. D. Frazer, “A graph theoretic approach to linear codes”, Proc. Second Annual Allerton Conf. On Circuit & System Theory. 1964},doi:10.1109/TIT.1965.1053789,doi:10.1109/TIT.1968.1054190,arxiv:quant-ph/0605094,doi:10.1007/s10623-011-9594-x}'
+introduced: '\cite{manual:{T. Kasami, “A topological approach to construction of group codes”, Journal of the Institute of Electrical Communication Engineers of Japan 44, 1316-1321 (1961)},manual:{D. A. Huffman, “A graph-theoretic formulation of binary group codes”, Summaries of papers presented at ICMCI, part 3, 29-30 (1964)},manual:{W. D. Frazer, “A graph theoretic approach to linear codes”, Proc. Second Annual Allerton Conf. On Circuit & System Theory. 1964},doi:10.1109/TIT.1965.1053789,doi:10.1109/TIT.1968.1054190,arxiv:quant-ph/0605094,doi:10.1007/s10623-011-9594-x}'
 
 alternative_names:
   - 'Graph theoretic code'

codes/classical/bits/nonlinear/levenshtein.yml

@@ -8,7 +8,7 @@ physical: bits
 logical: bits
 
 name: 'Levenshtein code'
-introduced: '\cite{manual:{V. I. Levenshtein, "Application of Hadamard matrices to a problem in coding theory", Problems of Cybernetics 5, 125–136 (1961)}}'
+introduced: '\cite{manual:{V. I. Levenshtein, “Application of Hadamard matrices to a problem in coding theory”, Problems of Cybernetics 5, 125–136 (1961)}}'
 
 description: |
   Binary codes constructed from combining two codes \(A'\) constructed out of Hadamard matrices.

codes/classical/bits/nonlinear/superimposed.yml

@@ -8,7 +8,7 @@ physical: bits
 logical: bits
 
 name: 'Superimposed code'
-introduced: '\cite{manual:{C. N. Mooers, "Application of random codes to the gathering of statistical information", PhD thesis, Massachusetts Institute of Technology, 1948},doi:10.1108/eb026235,doi:10.1002/asi.5090110209,doi:10.1109/TIT.1964.1053689}'
+introduced: '\cite{manual:{C. N. Mooers, “Application of random codes to the gathering of statistical information”, PhD thesis, Massachusetts Institute of Technology, 1948},doi:10.1108/eb026235,doi:10.1002/asi.5090110209,doi:10.1109/TIT.1964.1053689}'
 
 description: |
   A set of binary strings with the property that the bitwise OR of any subset of at most \(s\) codewords uniquely identifies that subset, for some prescribed strength \(s\).