sasha edits + minor stuff

Author: valbert4

code_extra/bib_preset.yml

@@ -143,172 +143,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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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) \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:
@@ -624,12 +624,12 @@ Sidelnikov97:
 Sloane04:
   _ready_formatted:
     flm: >-
-      N. J. A. Sloane, R. H. Hardin, and W. D. Smith, "Tables of spherical codes." Published electronically at https://neilsloane.com/packings/ (2004), in collaboration with R. H. Hardin, W. D. Smith, and others
+      N. J. A. Sloane, R. H. Hardin, and W. D. Smith, "Tables of spherical codes." Published electronically at https://neilsloane.com/packings/ (2004)
 
 Sole93:
   _ready_formatted:
     flm: >-
-      P. Sole, "Generalized theta functions for lattice vector quantization", in Coding and Quantization, DIMACS Series in Dr,crete Mathenulies and Theoretical Computer Science, vol. 14. Providence, RH: American Math. Soc., 1993, pp. 27-32
+      P. Sole, "Generalized theta functions for lattice vector quantization", in Coding and Quantization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 14. Providence, RH: American Math. Soc., 1993, pp. 27-32
 
 Stroud71:
   _ready_formatted:

codes/classical/bits/nonlinear/gray_map/originals/nordstrom_robinson.yml

@@ -9,10 +9,10 @@ logical: bits
 
 name: '\((16,256,6)\) Nordstrom-Robinson (NR) code'
 short_name: 'NR'
-introduced: '\cite{doi:10.1016/S0019-9958(67)90835-2,manual:{N. V. Semakov and V. A. Zinovev, "Complete and Quasi-complete Balanced Codes", Problemy Peredachi Informatsii, 5:2 (1969), 14–18; Problems of Information Transmission, 5:2 (1969), 11–13}}'
+introduced: '\cite{doi:10.1016/S0019-9958(67)90835-2,manual:{N. V. Semakov and V. A. Zinoviev, "Complete and Quasi-complete Balanced Codes", Problemy Peredachi Informatsii, 5:2 (1969), 14–18; Problems of Information Transmission, 5:2 (1969), 11–13}}'
 
 alternative_names:
-  - 'Semakov-Zinovev code'
+  - 'Semakov-Zinoviev code'
 
 description: |
   A nonlinear \((16,256,6)\) binary code that is the smallest Kerdock code and the smallest Preparata code.

codes/classical/bits/tanner/irregular/protograph_ldpc.yml

@@ -9,7 +9,7 @@ physical: bits
 logical: bits
 
 name: 'Protograph LDPC code'
-introduced: '\cite{manual:{J. Thorpe, "Low-density parity-check (LDPC) codes constructed from protographs." IPN progress report 42.154 (2003): 42-154},doi:10.1109/GLOCOM.2005.1577834,doi:10.1109/MILCOM.2006.302313,doi:10.1109/JSAC.2009.090806}'
+introduced: '\cite{manual:{J. Thorpe, "Low-density parity-check (LDPC) codes constructed from protographs." IPN progress report 42.154 (2003): pp. 1-7},doi:10.1109/GLOCOM.2005.1577834,doi:10.1109/MILCOM.2006.302313,doi:10.1109/JSAC.2009.090806}'
 
 description: |
   Binary version of a \(q\)-ary protograph LDPC code.

codes/classical/properties/block/copyright/frameproof.yml

@@ -51,7 +51,7 @@ relations:
         A sufficient condition for an evaluation AG code to be FP can be recast as an instance of the Riemann-Roch equation \cite[Sec. 15.8.2]{preset:HKSag}.
         AG-based constructions of binary \((2,1)\)-separating systems can beat a random-coding lower bound \cite[Thm. 15.8.13]{preset:HKSag}.
     - code_id: kerdock
-      detail: 'Kerdock codes of sufficient order are separating \cite{manual:{A. Krasnopeev and Yu. L. Sagalovich, "The Kerdock codes and separating systems." Eight International Workshop on Algebraic and Combinatorial Coding Theory. Vol. 7. No. 7.2. 2002},doi:10.1109/TIT.2004.838106}.'
+      detail: 'Kerdock codes of sufficient order are separating \cite{manual:{A. Krasnopeev and Y. L. Sagalovich, "The Kerdock codes and separating systems," in Proc. 8th Int. Workshop on Algebraic and Combinatorial Coding Theory, Sept. 2002, pp. 165–167},doi:10.1109/TIT.2004.838106}.'
 
 # - code_id: traceability
 #   detail: 'FP codes fingerprint digital data and also they help prevent copyrighted information from unauthorized use \cite{arxiv:1411.5782}.

codes/classical/q-ary_digits/ag/evaluationAG/plane_curve.yml

@@ -17,7 +17,7 @@ protection: 'Bezout''s theorem yields parameters \([n,k,d]\), which depend on th
 
 features:
   decoders:
-    - 'Generalization of the Peterson algorithm for BCH codes \cite{doi:10.1109/18.32157,doi:10.1109/18.57204,manual:{V. Yu. Krachkovskii, "Decoding of codes on algebraic curves," (in Russian), Conference Odessa, 1988}}.'
+    - 'Generalization of the Peterson algorithm for BCH codes \cite{doi:10.1109/18.32157,doi:10.1109/18.57204,manual:{V. Yu. Krachkovsky, (1988) "Decoding of codes on algebraic curves", Proceedings of the IX All-Union Conference on the Theory of Coding and Information Transmission, Moscow-Odessa: USSR Academy of Sciences, 1988 Part 2, pp. 143–146 (in Russian)}}.'
 
 relations:
   parents:

codes/classical/q-ary_digits/packing/covering/covering.yml

@@ -32,10 +32,10 @@ description: |
   \end{align}
   A code is perfect iff it satisfies Eqs. \eqref{eq:perfect-ref} and \eqref{eq:spherepacking-perfect-label} with equality.
 
-  In general, finding the covering radius of a code is \(NP\)-hard \cite{doi:10.1109/TIT.1984.1056978}. Complexity analysis as well as an extensive study of bounds can be found in Ref. \cite{manual:{G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein, "Covering Codes", Elsevier (1997)}}.
+  In general, finding the covering radius of a code is \(NP\)-hard \cite{doi:10.1109/TIT.1984.1056978}. Complexity analysis as well as an extensive study of bounds can be found in Ref. \cite{preset:CoveringBook}.
 
 realizations:
-  - 'Data compression, both with and without distortion constraints, can be phrased in terms of covering codes \cite{manual:{G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein, "Covering Codes", Elsevier (1997)}}.'
+  - 'Data compression, both with and without distortion constraints, can be phrased in terms of covering codes \cite{preset:CoveringBook}.'
   - 'Football-pool problem: finding the smallest number of bets on a set of matches needed to guarantee at least one bet has at most \(\rho\) errors \cite{doi:10.2307/2974552,doi:10.1007/BF03025254}.'
 
 notes: