bib lint

Author: valbert4

codes/classical/bits/nonlinear/gray_map/gray.yml

@@ -8,10 +8,10 @@ physical: bits
 logical: bits
 
 name: 'Gray code'
-introduced: '\cite{manual:{F. Gray, PULSE CODE COMMUNICATION. United States Patent Number 2632058 (1953)},doi:10.1002/j.1538-7305.1958.tb03887.x,doi:10.1137/0209013}'
+introduced: '\cite{manual:{F. Gray, "Pulse Code Communication", U.S. Patent 2632058 (1953)},doi:10.1002/j.1538-7305.1958.tb03887.x,doi:10.1137/0209013}'
 
 description: |
-  The first Gray code \cite{manual:{F. Gray, PULSE CODE COMMUNICATION. United States Patent Number 2632058 (1953)}}, now called the \textit{binary reflected Gray code}, is a trivial code that orders length-\(n\) binary strings such that nearest-neighbor strings differ by only one digit via what is known as the \term{Gray map}.
+  The first Gray code \cite{manual:{F. Gray, "Pulse Code Communication", U.S. Patent 2632058 (1953)}}, now called the \textit{binary reflected Gray code}, is a trivial code that orders length-\(n\) binary strings such that nearest-neighbor strings differ by only one digit via what is known as the \term{Gray map}.
 
   \begin{defterm}{Gray map}
   The Gray map converts a quaternary string over \(\mathbb{Z}_4\) into a binary string such that the Hamming distance of the binary representation is one between any two consecutive quaternary digits. 

codes/classical/bits/tanner/irregular/ra/ira.yml

@@ -10,7 +10,7 @@ logical: bits
 
 name: 'Irregular repeat-accumulate (IRA) code'
 short_name: 'IRA'
-introduced: '\cite{manual:{H. Jin, A. Khandekar, and R. J. McEliece, “Irregular repeat-accumulate codes”, Proc. 2nd Int. Symp. Turbo Codes and Related Topics, 2000},doi:10.7907/Q06G-MW38,manual:{H. Jin, A. Khandekar, and R. J. McEliece, SERIAL CONCATENATION OF INTERLEAVED CONVOLUTIONAL CODES FORMING TURBO-LIKE CODES. United States Patent Number 7116710B1 (2023)}}'
+introduced: '\cite{manual:{H. Jin, A. Khandekar, and R. J. McEliece, “Irregular repeat-accumulate codes”, Proc. 2nd Int. Symp. Turbo Codes and Related Topics, 2000},doi:10.7907/Q06G-MW38,manual:{H. Jin, A. Khandekar, and R. J. McEliece, "Serial Concatenation of Interleaved Convolutional Codes Forming Turbo-Like Codes", U.S. Patent 7116710B1 (2023)}}'
 
 description: |
   A generalization of the RA code in which the outer 1-in-3 repetition encoding step is replaced by an LDGM code.
@@ -30,8 +30,8 @@ features:
     - 'Linear-time decoder \cite{manual:{H. Jin, A. Khandekar, and R. J. McEliece, “Irregular repeat-accumulate codes”, Proc. 2nd Int. Symp. Turbo Codes and Related Topics, 2000}}.'
 
 realizations:
-  - 'LDPC codes used for digital satellite video broadcasting per the DVB-S2 standard \cite{doi:10.1109/ICARES.2014.7024407,manual:{ETSI, ETSI, “Digital video broadcasting (dvb); second generation framing structure, channel coding and modulation systems for broadcasting, interactive services, news gathering and other broadband satellite applications”, Part II: S2-Extensions (DVB-S2X) (2005): 22-27}} utilize IRA code features and were subject to litigation; see Ref. \cite{manual:{H. Jin, A. Khandekar, and R. J. McEliece, SERIAL CONCATENATION OF INTERLEAVED CONVOLUTIONAL CODES FORMING TURBO-LIKE CODES. United States Patent Number 7116710B1 (2023)}}.'
-  - 'Apple and Broadcom Wi-Fi devices utilize IRA encoding and decoding features and are subject to ongoing litigation; see Ref. \cite{manual:{H. Jin, A. Khandekar, and R. J. McEliece, SERIAL CONCATENATION OF INTERLEAVED CONVOLUTIONAL CODES FORMING TURBO-LIKE CODES. United States Patent Number 7116710B1 (2023)}}.'
+  - 'LDPC codes used for digital satellite video broadcasting per the DVB-S2 standard \cite{doi:10.1109/ICARES.2014.7024407,manual:{ETSI, ETSI, “Digital video broadcasting (dvb); second generation framing structure, channel coding and modulation systems for broadcasting, interactive services, news gathering and other broadband satellite applications”, Part II: S2-Extensions (DVB-S2X) (2005): 22-27}} utilize IRA code features and were subject to litigation; see Ref. \cite{manual:{H. Jin, A. Khandekar, and R. J. McEliece, "Serial Concatenation of Interleaved Convolutional Codes Forming Turbo-Like Codes", U.S. Patent 7116710B1 (2023)}}.'
+  - 'Apple and Broadcom Wi-Fi devices utilize IRA encoding and decoding features and are subject to ongoing litigation; see Ref. \cite{manual:{H. Jin, A. Khandekar, and R. J. McEliece, "Serial Concatenation of Interleaved Convolutional Codes Forming Turbo-Like Codes", U.S. Patent 7116710B1 (2023)}}.'
 
 relations:
   parents:

codes/classical/bits/tanner/qc/qc_ldpc.yml

@@ -10,7 +10,7 @@ logical: bits
 
 name: 'Quasi-cyclic LDPC (QC-LDPC) code'
 short_name: 'QC-LDPC'
-introduced: '\cite[Appx. C]{preset:Gallager63}\cite{manual:{H. Jin, T. Richardson, and V. Novichkov, ERROR CORRECTION OF ALGEBRAIC BLOCK CODES. U.S. Patent, Number US8751902B2 2002},doi:10.1109/ISIEA.2009.5356472,preset:Tanner01,doi:10.1109/ISIT.2002.1023584,doi:10.1109/LCOMM.2003.814716,doi:10.1109/ISIT.2003.1228165,doi:10.1109/TIT.2004.831841}'
+introduced: '\cite[Appx. C]{preset:Gallager63}\cite{manual:{H. Jin, T. Richardson, and V. Novichkov, "Error Correction of Algebraic Block Codes", U.S. Patent US8751902B2 (2002)},doi:10.1109/ISIEA.2009.5356472,preset:Tanner01,doi:10.1109/ISIT.2002.1023584,doi:10.1109/LCOMM.2003.814716,doi:10.1109/ISIT.2003.1228165,doi:10.1109/TIT.2004.831841}'
 
 description: |
   LDPC code that can be put into quasi-cyclic form.

codes/classical/properties/block/symmetry/cyclic/quasi_cyclic.yml

@@ -35,7 +35,7 @@ relations:
     - code_id: self_dual
       detail: 'Quasi-cyclic self-dual constructions include double circulant codes and, in odd characteristic, their negacirculant analogs such as double negacirculant and four-negacirculant codes \cite[Sec. 4.4]{preset:HKSselfdual}.'
     - code_id: convolutional
-      detail: 'Quasi-cyclic codes can be \textit{unwrapped} to obtain convolutional codes \cite{manual:{G. D. Forney, Jr., “Why quasi cyclic codes are interesting”, unpublished note, 1970},doi:10.1137/0137027,manual:{R. M. Tanner, ERROR-CORRECTING CODING SYSTEM, U.S. Patent 4295218, 1981},manual:{R. M. Tanner. Convolutional codes from quasi-cyclic codes: A link between the theories of block and convolutional codes. University of California, Santa Cruz, Computer Research Laboratory, 1987},manual:{H. H. Ma, “Generalized tail-biting convolutional codes”, PhD thesis, University of Massachusetts, Amherst, 1985},manual:{Y. Levy and J. Costello, Jr., “An algebraic approach to constructing convolutional codes from quasi-cyclic codes”, DIMACS Ser. Discr. Math. and Theor. Comp. Sci. 14, 189–198 (1993)},doi:10.1109/18.651076}.'
+      detail: 'Quasi-cyclic codes can be \textit{unwrapped} to obtain convolutional codes \cite{manual:{G. D. Forney, Jr., “Why quasi cyclic codes are interesting”, unpublished note, 1970},doi:10.1137/0137027,manual:{R. M. Tanner, "Error-Correcting Coding System", U.S. Patent 4295218 (1981)},manual:{R. M. Tanner. Convolutional codes from quasi-cyclic codes: A link between the theories of block and convolutional codes. University of California, Santa Cruz, Computer Research Laboratory, 1987},manual:{H. H. Ma, “Generalized tail-biting convolutional codes”, PhD thesis, University of Massachusetts, Amherst, 1985},manual:{Y. Levy and J. Costello, Jr., “An algebraic approach to constructing convolutional codes from quasi-cyclic codes”, DIMACS Ser. Discr. Math. and Theor. Comp. Sci. 14, 189–198 (1993)},doi:10.1109/18.651076}.'
     - code_id: sc_qldpc
       detail: 'Quasi-cyclic binary code parity-check matrices can be used as sub-matrices to define a 1D SC-QLDPC code \cite{arxiv:1102.3181}.'
     - code_id: quantum_divisible

codes/classical/q-ary_digits/ag/reed_solomon/generalized_reed_solomon.yml

@@ -31,7 +31,7 @@ features:
     - 'The decoding process of GRS codes reduces to the solution of a polynomial congruence equation, usually referred to as the key equation. Decoding schemes are based on applications of the Euclid algorithm to solve the key equation.'
     - 'Berlekamp-Massey decoder with runtime of \hyperref[topic:asymptotics]{order} \(O(n^2)\) \cite{doi:10.1109/TIT.1968.1054109,doi:10.1109/TIT.1969.1054260,preset:Berlekamp}.'
     - 'Guruswami-Sudan list decoder \cite{doi:10.1109/18.782097,doi:10.1109/SFCS.1998.743426} and modification by Koetter-Vardy for soft-decision decoding \cite{doi:10.1109/TIT.2003.819332}.'
-    - 'Hard-decision decoder for errors within the Singleton bound \cite{manual:{A. Berman, A. Dor, Y. Shany, I. Shapir, and A. Doubchak (2023). U.S. Patent (1)1,855,658. Washington, DC: U.S. Patent and Trademark Office}}.'
+    - 'Hard-decision decoder for errors within the Singleton bound \cite{manual:{A. Berman, A. Dor, Y. Shany, I. Shapir, and A. Doubchak, "Efficient Hard Decision Decoding of Generalized Reed-Solomon Codes in Presence of Erasures and Errors within the Singleton Bound", U.S. Patent US11855658B1 (2023)}}.'
 
 realizations:
   - 'Commonly used in mass storage systems such as CDs, DVDs, QR codes etc.'

codes/classical/q-ary_digits/ag/reed_solomon/irs/cross_interleaved_reed_solomon.yml

@@ -9,7 +9,7 @@ logical: q-ary_digits
 
 name: 'Cross-interleaved RS (CIRS) code'
 short_name: 'CIRS'
-introduced: '\cite{manual:{L. B. Vries and K. Odaka, 1982, June, “CIRC-the error-correcting code for the compact disc digital audio system”. In Audio Engineering Society Conference: 1st International Conference: Digital Audio. Audio Engineering Society},manual:{K. Odaka, Y. Sako, I. Iwamoto, T. Doi, and L. B. Vries, SONY: ERROR CORRECTABLE DATA TRANSMISSION METHOD (Patent US4413340) filing date May 21, 1980}}'
+introduced: '\cite{manual:{L. B. Vries and K. Odaka, 1982, June, “CIRC-the error-correcting code for the compact disc digital audio system”. In Audio Engineering Society Conference: 1st International Conference: Digital Audio. Audio Engineering Society},manual:{K. Odaka, Y. Sako, I. Iwamoto, T. Doi, and L. B. Vries, "Error Correctable Data Transmission Method", U.S. Patent US4413340A (1983)}}'
 
 description: |
   An IRS code constructed from two shortened RS codes and two forms of interleaving. In a 2D array visualization, one component code runs vertically and the other diagonally \cite{preset:HPArray}.

codes/classical/q-ary_digits/ag/reed_solomon/rs/reed_solomon.yml

@@ -38,7 +38,7 @@ features:
     - 'Although using iFFT has its counterpart iNNT for finite fields, the decoding is usually standard polynomial interpolation in \(k=O(n\log^2 n)\). However, in erasure decoding, encoded values are only erased in \(r\) points, which is a specific case of polynomial interpolation and can be done in \(O(n\log n)\) by computing product of the received polynomial and an erasure locator polynomial and using long division to find an original polynomial. The long division step can be omitted to increase speed further by only dividing the derivative of the product polynomial, and derivative of erasure locator polynomial evaluated at erasure locations.'
     - 'Berlekamp-Massey decoder with runtime of \hyperref[topic:asymptotics]{order} \(O(n^2)\) \cite{doi:10.1109/TIT.1969.1054260,preset:Berlekamp}.'
     - 'Gorenstein-Peterson-Zierler decoder with runtime of \hyperref[topic:asymptotics]{order} \(O(n^3)\) \cite{doi:10.1109/TIT.1960.1057586,doi:10.1137/0109020} (see exposition in Ref. \cite{preset:Blahut}).'
-    - 'Berlekamp-Welch decoder with runtime of \hyperref[topic:asymptotics]{order} \(O(n^3)\) \cite{manual:{E. R. Berlekamp and L. Welch, ERROR CORRECTION OF ALGEBRAIC BLOCK CODES. U.S. Patent, Number 4,633,470 1986}} (see exposition in Ref. \cite{doi:10.1016/0020-0190(92)90195-2}), assuming that \(t \geq (n+k)/2\).'
+    - 'Berlekamp-Welch decoder with runtime of \hyperref[topic:asymptotics]{order} \(O(n^3)\) \cite{manual:{E. R. Berlekamp and L. Welch, “Error Correction of Algebraic Block Codes”, U.S. Patent 4,633,470 (1986)}} (see exposition in Ref. \cite{doi:10.1016/0020-0190(92)90195-2}), assuming that \(t \geq (n+k)/2\).'
     - 'Sugiyama et al. modification of the extended Euclidean algorithm \cite{doi:10.1016/S0019-9958(75)90090-X,doi:10.1017/CBO9780511606267,arxiv:0906.3778}.'
     - 'Gao decoder using extended Euclidean algorithm \cite{doi:10.1007/978-1-4757-3789-9_5}.'
     - 'Fast-Fourier-transform decoder with runtime of \hyperref[topic:asymptotics]{order} \(O(n \text{polylog}n)\) \cite{doi:10.1109/TIT.1978.1055816}.'

codes/classical/q-ary_digits/easy/tetracode.yml

@@ -39,7 +39,7 @@ relations:
       detail: 'The tetracode is a lexicode \cite{doi:10.1109/TIT.1986.1057187}.'
   cousins:
     - code_id: mds
-      detail: 'The tetracode is a unique MDS code \cite{manual:{O. Taussky and J. Todd, “Covering theorems for groups”, Bulletin of the American Mathematical Society. 54. (3). 201 CHARLES ST, PROVIDENCE, RI 02940-2213: AMER MATHEMATICAL SOC, 1948},doi:10.1112/jlms/s1-44.1.60}.'
+      detail: 'The tetracode is a unique MDS code \cite{manual:{O. Taussky and J. Todd, “Covering theorems for groups”, Bulletin of the American Mathematical Society 54(3) (1948)},doi:10.1112/jlms/s1-44.1.60}.'
     - code_id: ternary_golay
       detail: 'Extended ternary Golay codewords can be obtained from tetracodewords \cite{doi:10.1007/978-1-4757-6568-7}.
       The tetracode can be used to decode the extended ternary Golay code \cite{doi:10.1109/TIT.1986.1057197}.'

codes/quantum/groups/rotors/stabilizer/css/current_mirror.yml

@@ -8,7 +8,7 @@ physical: groups
 logical: qudits
 
 name: 'Kitaev current-mirror qubit code'
-introduced: '\cite{arxiv:cond-mat/0609441,manual:{A. Yu. Kitaev, PROTECTED QUBIT BASED ON SUPERCONDUCTING CURRENT MIRROR. United States Patent Number 7858966B2 (2006)},arxiv:2303.13723}'
+introduced: '\cite{arxiv:cond-mat/0609441,manual:{A. Yu. Kitaev, "Protected Qubit Based on Superconducting Current Mirror", U.S. Patent 7858966B2 (2006)},arxiv:2303.13723}'
 
 description: |
   Member of the family of \([[2n,(0,2),(2,n)]]_{\mathbb{Z}}\) homological rotor codes storing a logical qubit on a thin Möbius strip.

codes/quantum/oscillators/stabilizer/lattice/gkp.yml

@@ -82,7 +82,7 @@ relations:
     - code_id: hypercubic
       detail: 'GKP codewords, when written in terms of coherent states, form a square lattice in phase space.'
     - code_id: fusion
-      detail: 'GKP states can be used to perform computation in a fusion-based encoding \cite{manual:{A. Doherty, M. Gimeno-Segovia, D. Litinski, N. Nickerson, M. Pant, T. Rudolph, and C. Sparrow, Psiquantum, Corp., 2024. GENERATION AND MEASUREMENT OF ENTANGLED SYSTEMS OF PHOTONIC GKP QUBITS. U.S. Patent Application 18/273,753}}.'
+      detail: 'GKP states can be used to perform computation in a fusion-based encoding \cite{manual:{A. Doherty, M. Gimeno-Segovia, D. Litinski, N. Nickerson, M. Pant, T. Rudolph, and C. Sparrow, "Generation and Measurement of Entangled Systems of Photonic GKP Qubits", U.S. Patent Application 18/273,753 (2024)}}.'
     - code_id: spt
       detail: 'The Segal-Bargmann representations of GKP states are the theta functions of the lowest Landau level on a torus \cite[Sec. V]{arXiv:2002.07718}\cite[Prop. 6.3]{arxiv:2106.11093} (see also Refs. \cite{doi:10.1103/PhysRevB.31.2529,doi:10.1007/978-0-8176-4577-9,arxiv:1507.08966}).'