bib lint

Author: valbert4

code_extra/bib_preset.yml

@@ -149,172 +149,172 @@ coxeterComplex:
 HKSbasics:
   _ready_formatted:
     flm: >-
-        W. C. Huffman, J.-L. Kim, and P. Solé, "Basics of coding theory." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 3-44 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        W. C. Huffman, J.-L. Kim, and P. Solé, “Basics of coding theory,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 3-44 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKScyclic:
   _ready_formatted:
     flm: >-
-        C. Ding, "Cyclic Codes over Finite Fields." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 45-60 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        C. Ding, “Cyclic Codes over Finite Fields,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 45-60 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKSclass:
   _ready_formatted:
     flm: >-
-        P. R. J. Östergård, "Construction and Classification of Codes." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 61-78 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        P. R. J. Östergård, “Construction and Classification of Codes,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 61-78 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKSselfdual:
   _ready_formatted:
     flm: >-
-        S. Bouyuklieva, "Self-dual codes." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 79-96 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        S. Bouyuklieva, “Self-dual codes,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 79-96 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKSdesigns:
   _ready_formatted:
     flm: >-
-        V. D. Tonchev, "Codes and designs." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 97-110 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        V. D. Tonchev, “Codes and designs,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 97-110 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKSrings:
   _ready_formatted:
     flm: >-
-        S. T. Dougherty, "Codes over rings." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 111-128 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        S. T. Dougherty, “Codes over rings,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 111-128 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKSconstacyclicrings:
   _ready_formatted:
     flm: >-
-        H. Q. Dinh, S. R. López-Permouth, "Constacyclic Codes over Finite Commutative Chain Rings." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 385-428 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        H. Q. Dinh, S. R. López-Permouth, “Constacyclic Codes over Finite Commutative Chain Rings,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 385-428 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 # HKSquasicyclic:
 #   _ready_formatted:
 #     flm: >-
-#         C. Güneri, S. Ling, B. Özkaya, "Quasi-cyclic codes." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 129-150 \href{https://doi.org/10.1201/9781315147901}{DOI}
+#         C. Güneri, S. Ling, B. Özkaya, “Quasi-cyclic codes,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 129-150 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 # HKSskewcyclic:
 #   _ready_formatted:
 #     flm: >-
-#         H. Gluesing-Luerssen, "Introduction to Skew-Polynomial Rings and Skew-Cyclic Codes." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 151-180 \href{https://doi.org/10.1201/9781315147901}{DOI}
+#         H. Gluesing-Luerssen, “Introduction to Skew-Polynomial Rings and Skew-Cyclic Codes,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 151-180 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 # HKSadditivecyclic:
 #   _ready_formatted:
 #     flm: >-
-#         J. Bierbrauer, S. Marcugini, F. Pambianco, "Additive cyclic codes." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 181-196 \href{https://doi.org/10.1201/9781315147901}{DOI}
+#         J. Bierbrauer, S. Marcugini, F. Pambianco, “Additive cyclic codes,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 181-196 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 # HKSconvolutional:
 #   _ready_formatted:
 #     flm: >-
-#         J. Lieb, R. Pinto, J. Rosenthal, "Convolutional codes." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 197-226 \href{https://doi.org/10.1201/9781315147901}{DOI}
+#         J. Lieb, R. Pinto, J. Rosenthal, “Convolutional codes,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 197-226 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 # HKSrankmetric:
 #   _ready_formatted:
 #     flm: >-
-#         E. Gorla, "Rank-metric codes." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 227-250 \href{https://doi.org/10.1201/9781315147901}{DOI}
+#         E. Gorla, “Rank-metric codes,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 227-250 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKSbounds:
   _ready_formatted:
     flm: >-
-        P. Boyvalenkov, D. Danev, "Linear programming bounds." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 251-266 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        P. Boyvalenkov, D. Danev, “Linear programming bounds,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 251-266 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKSpolar:
   _ready_formatted:
     flm: >-
-        N. Presman, S. Litsyn, "Polar codes." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 763-784 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        N. Presman, S. Litsyn, “Polar codes,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 763-784 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 # HKSsemidefinite:
 #   _ready_formatted:
 #     flm: >-
-#         F. Vallentin, "Semidefinite Programming Bounds for Error-Correcting Codes." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 267-282 \href{https://doi.org/10.1201/9781315147901}{DOI}
+#         F. Vallentin, “Semidefinite Programming Bounds for Error-Correcting Codes,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 267-282 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKSprojective:
   _ready_formatted:
     flm: >-
-        L. Storme, "Coding Theory and Galois Geometries." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 285-310 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        L. Storme, “Coding Theory and Galois Geometries,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 285-310 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKSag:
   _ready_formatted:
     flm: >-
-        A. Couvreur, H. Randriambololona, "Algebraic Geometry Codes and Some Applications." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 311-362 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        A. Couvreur, H. Randriambololona, “Algebraic Geometry Codes and Some Applications,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 311-362 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKSalgebra:
   _ready_formatted:
     flm: >-
-        W. Willems, "Codes in Group Algebras." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 363-384 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        W. Willems, “Codes in Group Algebras,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 363-384 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 # HKStrace:
 #   _ready_formatted:
 #     flm: >-
-#         M. Shi, "Weight Distribution of Trace Codes over Finite Rings." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 429-448 \href{https://doi.org/10.1201/9781315147901}{DOI}
+#         M. Shi, “Weight Distribution of Trace Codes over Finite Rings,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 429-448 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKStwoweight:
   _ready_formatted:
     flm: >-
-        A. E. Brouwer, "Two-weight Codes." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 449-462 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        A. E. Brouwer, “Two-weight Codes,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 449-462 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 # HKSfunctions:
 #   _ready_formatted:
 #     flm: >-
-#         S. Mesnager, "Linear Codes from Functions." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 463-526 \href{https://doi.org/10.1201/9781315147901}{DOI}
+#         S. Mesnager, “Linear Codes from Functions,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 463-526 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKSgraphs:
   _ready_formatted:
     flm: >-
-        C. A. Kelley, "Codes over Graphs." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 527-552 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        C. A. Kelley, “Codes over Graphs,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 527-552 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKSmetrics:
   _ready_formatted:
     flm: >-
-        M. Firer, "Alternative Metrics." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 555-574 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        M. Firer, “Alternative Metrics,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 555-574 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 # HKSalgo:
 #   _ready_formatted:
 #     flm: >-
-#         M. Wassermann, "Algorithmic Methods." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 575-598 \href{https://doi.org/10.1201/9781315147901}{DOI}
+#         M. Wassermann, “Algorithmic Methods,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 575-598 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 # HKSlattice:
 #   _ready_formatted:
 #     flm: >-
-#         F. Oggier, "Lattice Coding." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 645-656 \href{https://doi.org/10.1201/9781315147901}{DOI}
+#         F. Oggier, “Lattice Coding,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 645-656 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKSquantum:
   _ready_formatted:
     flm: >-
-        M. F. Ezerman, "Quantum Error-Control Codes." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 657-672 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        M. F. Ezerman, “Quantum Error-Control Codes,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 657-672 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKSstc:
   _ready_formatted:
     flm: >-
-        F. Oggier, "Space-Time Coding." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 673-684 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        F. Oggier, “Space-Time Coding,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 673-684 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKSnetwork:
   _ready_formatted:
     flm: >-
-        F. R. Kschischang, "Network Codes." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 685-714 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        F. R. Kschischang, “Network Codes,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 685-714 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKSdist:
   _ready_formatted:
     flm: >-
-        V. Ramkumar, M. Vajha, S. B. Balaji, M. N. Krishnan, B. Sasidharan, P. Vijay Kumar, "Codes for Distributed Storage." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 735-762 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        V. Ramkumar, M. Vajha, S. B. Balaji, M. N. Krishnan, B. Sasidharan, P. Vijay Kumar, “Codes for Distributed Storage,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 735-762 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKSfountain:
   _ready_formatted:
     flm: >-
-        I. F. Blake, "Coding for Erasures and Fountain Codes." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 715-734 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        I. F. Blake, “Coding for Erasures and Fountain Codes,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 715-734 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 # HKSinterp:
 #   _ready_formatted:
 #     flm: >-
-#         S. Kopparty, "Interpolation Decoding." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 599-612 \href{https://doi.org/10.1201/9781315147901}{DOI}
+#         S. Kopparty, “Interpolation Decoding,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 599-612 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 HKSpseudo:
   _ready_formatted:
     flm: >-
-        T. Helleseth, C. Li, "Pseudo-Noise Sequences." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 613-644 \href{https://doi.org/10.1201/9781315147901}{DOI}
+        T. Helleseth, C. Li, “Pseudo-Noise Sequences,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 613-644 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 # HKSsecretsharing:
 #   _ready_formatted:
 #     flm: >-
-#         C. Ding, "Secret Sharing with Linear Codes." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 785-798 \href{https://doi.org/10.1201/9781315147901}{DOI}
+#         C. Ding, “Secret Sharing with Linear Codes,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 785-798 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 # HKScrypto:
 #   _ready_formatted:
 #     flm: >-
-#         P. Gaborit, J.-C. Deneuville, "Code-Based Cryptography." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 799-822 \href{https://doi.org/10.1201/9781315147901}{DOI}
+#         P. Gaborit, J.-C. Deneuville, “Code-Based Cryptography,” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021), pp. 799-822 \href{https://doi.org/10.1201/9781315147901}{DOI}
 
 KLbounds:
   _ready_formatted:

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 Univ., 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 Univ., Hamilton, Ontario, 1981,doi:10.1109/18.651040}}.
+    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}}.
 
   decoders:
     - 'Sphere decoder \cite{doi:10.1090/S0025-5718-1985-0777278-8,doi:10.1007/bf01581144}.'

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, Univ. 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., vol. 14, pp. 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., vol. 14, pp. 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/projective/projective.yml

@@ -49,7 +49,7 @@ relations:
         correspondence between Griesmer codes and minihypers
         \cite{doi:10.1016/0378-3758(89)90098-0,manual:{N. Hamada,
         Characterization of minihypers in a finite projective geometry and its
-        applications to error-correcting codes, Bull. Osaka Women's Univ. 24
+        applications to error-correcting codes, Bull. Osaka Women's University 24
         (1987), 1-24}}; see \cite[Sec. 14.2.4]{preset:HKSprojective}
         \cite{doi:10.1007/978-1-4613-0283-4_13} for more details.
     - code_id: anticode