bib lint

Author: valbert4

code_extra/bib_preset.yml

@@ -8,7 +8,7 @@ physical: reals
 logical: reals
 
 name: 'Simplex integer-based code'
-introduced: '\cite{manual:{D. J. C. MacKay, J. Sayir, and N. Goldman, "Near-Capacity Codes for Fountain Channels with Insertions, Deletions, and Substitutions, with Applications to DNA Archives," Unpublished manuscript, 2015},arxiv:1612.08837,doi:10.1109/TIT.2018.2791990}'
+introduced: '\cite{manual:{D. J. C. MacKay, J. Sayir, and N. Goldman, “Near-Capacity Codes for Fountain Channels with Insertions, Deletions, and Substitutions, with Applications to DNA Archives”, Unpublished manuscript, 2015},arxiv:1612.08837,doi:10.1109/TIT.2018.2791990}'
 
 alternative_names:
   - 'Multiset code'

codes/classical/analog/integers/simplex_discrete.yml

@@ -21,8 +21,8 @@ features:
     - 'Syndrome repairing (SR) decoder \cite{doi:10.4028/www.scientific.net/AMR.341-342.514}.'
 
 notes:
-  - 'CRS codes are useful for compressed sensing \cite{doi:10.1109/ICASSP.2008.4518494,manual:{M. Mohamed, S. Rizkalla, H. Zoerlein and M. Bossert, "Deterministic Compressed Sensing with Power Decoding for Complex Reed-Solomon Codes," SCC 2015; 10th International ITG Conference on Systems, Communications and Coding, Hamburg, Germany, 2015, pp. 1-6}}.'
-  - 'CRS codes are potentially useful for Orthogonal Frequency-Division Multiplexing (OFDM) \cite{manual:{W. Henkel (2000). "Analog codes for peak-to-average ratio reduction". ITG FACHBERICHT, 151-156}}.'
+  - 'CRS codes are useful for compressed sensing \cite{doi:10.1109/ICASSP.2008.4518494,manual:{M. Mohamed, S. Rizkalla, H. Zoerlein and M. Bossert, “Deterministic Compressed Sensing with Power Decoding for Complex Reed-Solomon Codes”, SCC 2015; 10th International ITG Conference on Systems, Communications and Coding, Hamburg, Germany, 2015, pp. 1-6}}.'
+  - 'CRS codes are potentially useful for Orthogonal Frequency-Division Multiplexing (OFDM) \cite{manual:{W. Henkel (2000), “Analog codes for peak-to-average ratio reduction”. ITG FACHBERICHT, 151-156}}.'
 
 
 

codes/classical/analog/real_block/analog_reed_solomon.yml

@@ -14,7 +14,7 @@ description: |
   Lattice-based \(n\)-dimensional code whose codewords form the dual of the \(A_n\) lattice.
 
 protection: |
-  Exhibits the thinnest covering in two dimensions and the thinnest lattice covering in dimensions three \cite{preset:Bambah54}, four \cite{manual:{B. N. Delaunay and S. S. Ryskov, "Solution of the problem of least dense lattice covering of a four-dimensional space by equal spheres." Soviet Mathematics Doklady Vol. 4. 1963}}, and five \cite{manual:{S. S. Ryshkov and E. P. Baranovskii, "Solution of the problem of least dense lattice covering of five-dimensional space by equal spheres", Doklady Akademii Nauk SSSR, 222:1 (1975), 39–42},manual:{S. S. Ryshkov and E. P. Baranovskii, "C-types of n-dimensional lattices and 5-dimensional primitive parallelohedra (with application to the theory of coverings)", Trudy Matematicheskogo Instituta imeni V. A. Steklova, 137, 1976, 3–131; Proceedings of the Steklov Institute of Mathematics, 137 (1976), 1–140}}.
+  Exhibits the thinnest covering in two dimensions and the thinnest lattice covering in dimensions three \cite{preset:Bambah54}, four \cite{manual:{B. N. Delaunay and S. S. Ryskov, “Solution of the problem of least dense lattice covering of a four-dimensional space by equal spheres”, Soviet Mathematics Doklady 4. 1963}}, and five \cite{manual:{S. S. Ryshkov and E. P. Baranovskii, “Solution of the problem of least dense lattice covering of five-dimensional space by equal spheres”, Doklady Akademii Nauk SSSR 222(1), 39–42 (1975)},manual:{S. S. Ryshkov and E. P. Baranovskii, “C-types of n-dimensional lattices and 5-dimensional primitive parallelohedra (with application to the theory of coverings)”, Trudy Matematicheskogo Instituta imeni V. A. Steklova 137, 3–131 (1976); Proceedings of the Steklov Institute of Mathematics 137, 1–140 (1976)}}.
 
 relations:
   parents:

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

@@ -45,7 +45,7 @@ description: |
 
 protection: |
   The \(E_8\) lattice has a nominal coding gain of \(2\).
-  It exhibits the densest lattice packing \cite{preset:Blichfeldt25,doi:10.1007/BF01454863,doi:10.1007/BF01201341,doi:10.1112/plms/s3-13.1.549}, the densest packing \cite{arxiv:1603.06518}, and the highest kissing number of 240 \cite{manual:{N. M. Vetchinkin, "Uniqueness of classes of positive quadratic and highest kissing number of 240 in eight dimensions"}} in eight dimensions.
+  It exhibits the densest lattice packing \cite{preset:Blichfeldt25,doi:10.1007/BF01454863,doi:10.1007/BF01201341,doi:10.1112/plms/s3-13.1.549}, the densest packing \cite{arxiv:1603.06518}, and the highest kissing number of 240 \cite{manual:{N. M. Vetchinkin, “Uniqueness of classes of positive quadratic and highest kissing number of 240 in eight dimensions”}} in eight dimensions.
 
 notes:
   - 'Popular summary of solution to the sphere-packing problem in \href{https://www.quantamagazine.org/sphere-packing-solved-in-higher-dimensions-20160330/}{Quanta Magazine}.'

codes/classical/analog/sphere_packing/lattice/dual/eeight.yml

@@ -47,31 +47,31 @@ protection: |
   \end{align}
 
   The covering radius of a lattice is defined similarly as above, but with the spheres' \textit{covering radius} now being the smallest one such that the spheres cover all space.
-  In general, finding the covering radius of a lattice is \(NP\)-hard \cite{manual:{P. van Emde Boas, "Another NP-complete partition problem and the complexity of computing short vectors in lattices," Technical Report (1981)}}.
+  In general, finding the covering radius of a lattice is \(NP\)-hard \cite{manual:{P. van Emde Boas, “Another NP-complete partition problem and the complexity of computing short vectors in lattices”, Technical Report (1981)}}.
 
   The \textit{lattice quantizer problem} is to find a lattice whose \textit{fundamental Voronoi cell} \(\Pi\), the Voronoi cell at the origin, has the smallest possible normalized second moment,
   \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}.
+  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}.
   The Lenstra-Lenstra-Lovasz (LLL) algorithm solves SVP in polynomial time, but up to an error exponential in the dimension \cite{doi:10.1007/BF01457454}; see the book \cite{doi:10.1007/978-0-387-77993-5}.
 
 # Lattices are also characterized by the \textit{minimal norm} \(\mu\), which is the minimal norm of a nonzero vector in the lattice.
 
 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, Hamilton, Ontario, 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}.'
 
 notes:
   - 'See books \cite{doi:10.1007/978-1-4757-6568-7,doi:10.1007/b98975,manual:{C. A. Rogers, \emph{Packing and covering}, vol. 54 (Cambridge University Press, 1964)}} for introductions and overviews of lattices.'
-  - 'See LMFDB \cite{preset:LMFDB} and Catalogue of Lattices \cite{manual:{G. Nebe and N. J. A. Sloane. "Catalogue of Lattices." \url{https://www.math.rwth-aachen.de/~Gabriele.Nebe/LATTICES/index.html}}} for databases of lattices.'
-  - 'Tables of bounds on kissing numbers \cite{manual:{H. Cohn. "Kissing numbers." \url{https://cohn.mit.edu/kissing-numbers}}}. Popular summary of bounds on kissing numbers in 17-21 dimensions in \href{https://www.quantamagazine.org/mathematicians-discover-new-way-for-spheres-to-kiss-20250115/}{Quanta Magazine}.'
+  - 'See LMFDB \cite{preset:LMFDB} and Catalogue of Lattices \cite{manual:{G. Nebe and N. J. A. Sloane, “Catalogue of Lattices” \href{https://www.math.rwth-aachen.de/~Gabriele.Nebe/LATTICES/index.html}{URL}}} for databases of lattices.'
+  - 'Tables of bounds on kissing numbers \cite{manual:{H. Cohn, “Kissing numbers” \href{https://cohn.mit.edu/kissing-numbers}{URL}}}. Popular summary of bounds on kissing numbers in 17-21 dimensions in \href{https://www.quantamagazine.org/mathematicians-discover-new-way-for-spheres-to-kiss-20250115/}{Quanta Magazine}.'
   - 'See Refs. \cite{manual:{J. Cannon, W. Bosma, C. Fieker, and A. Steel (2008). HANDBOOK OF MAGMA FUNCTIONS},doi:10.1145/190347.190362,doi:10.1006/jsco.1996.0125} for various examples and implementations in Magma.'
 
 

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

@@ -29,7 +29,7 @@ description: |
 
   The Voronoi cell of the lattice is the reciprocal of the Gosset \(2_{31}\) polytope \cite[Ch. 21, pg. 465]{doi:10.1007/978-1-4757-6568-7}.
 
-protection: 'The \(E_7\) root lattice exhibits the densest lattice packing \cite{preset:Blichfeldt25,doi:10.1007/BF01454863,doi:10.1007/BF01201341,doi:10.1112/plms/s3-13.1.549,manual:{N. M. Vetchinkin, "Uniqueness of classes of positive quadratic and highest known kissing number in seven dimensions."}}.'
+protection: 'The \(E_7\) root lattice exhibits the densest lattice packing \cite{preset:Blichfeldt25,doi:10.1007/BF01454863,doi:10.1007/BF01201341,doi:10.1112/plms/s3-13.1.549,manual:{N. M. Vetchinkin, “Uniqueness of classes of positive quadratic and highest known kissing number in seven dimensions”,}}.'
 
 
 relations:

codes/classical/analog/sphere_packing/lattice/root/eseven.yml

@@ -26,7 +26,7 @@ description: |
   \end{pmatrix}~.
   \end{align}
 
-protection: 'The root \(E_6\) lattice exhibits the densest lattice packing \cite{preset:Blichfeldt25,doi:10.1007/BF01454863,doi:10.1007/BF01201341,doi:10.1112/plms/s3-13.1.549,manual:{N. M. Vetchinkin, "Uniqueness of classes of positive quadratic forms, on which values of Hermite constants are reached for 6≤n≤8." Trudy Matematicheskogo Instituta imeni VA Steklova 152 (1980): 34-86}} and highest known kissing number in six dimensions.'
+protection: 'The root \(E_6\) lattice exhibits the densest lattice packing \cite{preset:Blichfeldt25,doi:10.1007/BF01454863,doi:10.1007/BF01201341,doi:10.1112/plms/s3-13.1.549,manual:{N. M. Vetchinkin, “Uniqueness of classes of positive quadratic forms, on which values of Hermite constants are reached for 6≤n≤8”, Trudy Matematicheskogo Instituta imeni VA Steklova 152, 34-86 (1980)}} and highest known kissing number in six dimensions.'
 
 
 relations:

codes/classical/analog/sphere_packing/lattice/root/esix.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, Jan. 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." Online: \url{https://codes.se/packings}. Accessed (2015)}}.'
+  - '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/analog/sphere_packing/sphere_packing.yml

@@ -19,7 +19,7 @@ relations:
     - code_id: binary_linear
   cousins:
     - code_id: griesmer
-      detail: 'Several anticode (e.g., \cite{manual:{B. I. Belov, V. N. Logachev, and V. P. Sandimirov, "Construction of a Class of Linear Binary Codes Achieving the Varshamov-Griesmer Bound", Problemy Peredachi Informatsii, 10:3 (1974), 36–44; Problems of Information Transmission, 10:3 (1974), 211–217},manual:{R. Hill, "Optimal Linear Codes in: C. Mitchell (Ed.) Cryptography and Coding." (1992): 75-104}}) and related \cite{manual:{B. I. Belov, "A conjecture on the Griesmer bound." Optimization Methods and Their Applications,(Russian), Sibirsk. Energet. Inst. Sibirsk. Otdel. Akad. Nauk SSSR, Irkutsk 182 (1974): 100-106}} constructions saturate the Griesmer bound; see Refs. \cite{doi:10.1201/9781315371993,doi:10.1016/S0012-365X(99)00183-1,preset:MacSlo} for more details.'
+      detail: 'Several anticode (e.g., \cite{manual:{B. I. Belov, V. N. Logachev, and V. P. Sandimirov, “Construction of a Class of Linear Binary Codes Achieving the Varshamov-Griesmer Bound”, Problemy Peredachi Informatsii 10(3), 36–44 (1974); Problems of Information Transmission 10(3), 211–217 (1974)},manual:{R. Hill, “Optimal Linear Codes” in: C. Mitchell (Ed.) Cryptography and Coding, (1992): 75-104}}) and related \cite{manual:{B. I. Belov, “A conjecture on the Griesmer bound”, Optimization Methods and Their Applications,(Russian), Sibirsk. Energet. Inst. Sibirsk. Otdel. Akad. Nauk SSSR, Irkutsk 182, 100-106 (1974)}} constructions saturate the Griesmer bound; see Refs. \cite{doi:10.1201/9781315371993,doi:10.1016/S0012-365X(99)00183-1,preset:MacSlo} for more details.'
 
 # Begin Entry Meta Information
 _meta: