Indexed text attachment
entropy-sources-and-channels-in-higher-categories.tex
Source for Entropy, Sources, and Channels in Higher Categories
View paper · Download original file
Lines 4121–4220 of 4249. Source text is displayed literally.
4121\backmatter4122%% ---- begin bib.tex ----4123\chapter{References}4124\begingroup\small4125\renewcommand{\chapter}[2]{}4126\begin{thebibliography}{FGLPS26}\setlength{\itemsep}{1pt}4127\newcommand{\bi}[1]{\bibitem[#1]{#1}}4128\bi{AC88} P. Algoet and T. Cover. A sandwich proof of the Shannon--McMillan--Breiman theorem. \emph{Ann. Probab.} 16 (1988).4129\bi{AD75} J. Acz\'el and Z. Dar\'oczy. \emph{On Measures of Information and Their Characterizations}. Academic Press, 1975.4130\bi{Adl61} R. Adler. Ergodic and mixing properties of infinite memory channels. \emph{Proc. Amer. Math. Soc.} 12 (1961).4131\bi{Alo98} N. Alon. The Shannon capacity of a union. \emph{Combinatorica} 18 (1998).4132\bi{Ari09} E. Ar\i kan. Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. \emph{IEEE Trans. Inform. Theory} 55 (2009).4133\bi{AT09} E. Ar\i kan and E. Telatar. On the rate of channel polarization. \emph{Proc. IEEE ISIT} (2009).4134\bi{BB15} P. Baudot and D. Bennequin. The homological nature of entropy. \emph{Entropy} 17 (2015).4135\bi{BF14} J. Baez and T. Fritz. A Bayesian characterization of relative entropy. \emph{Theory Appl. Categ.} 29 (2014).4136\bi{BFL11} J. Baez, T. Fritz and T. Leinster. A characterization of entropy in terms of information loss. \emph{Entropy} 13 (2011).4137\bi{Bil65} P. Billingsley. \emph{Ergodic Theory and Information}. Wiley, 1965.4138\bi{Bir31} G. D. Birkhoff. Proof of the ergodic theorem. \emph{Proc. Nat. Acad. Sci. USA} 17 (1931).4139\bi{Bla57} D. Blackwell. The entropy of functions of finite-state Markov chains. \emph{Trans. First Prague Conf. Information Theory} (1957).4140\bi{BMSS12} L. Birkedal, R. M\o gelberg, J. Schwinghammer and K. St\o vring. First steps in synthetic guarded domain theory: step-indexing in the topos of trees. \emph{Log. Methods Comput. Sci.} 8(4) (2012).4141\bi{Bra21} T.-D. Bradley. Entropy as a topological operad derivation. \emph{Entropy} 23 (2021).4142\bi{Bre57} L. Breiman. The individual ergodic theorem of information theory. \emph{Ann. Math. Statist.} 28 (1957); correction, 31 (1960).4143\bi{Bre60} L. Breiman. On achieving channel capacity in finite-memory channels. \emph{Illinois J. Math.} 4 (1960).4144\bi{Cat88} J.-L. Cathelineau. Sur l'homologie de $\mathrm{SL}_2$ \`a coefficients dans l'action adjointe. \emph{Math. Scand.} 63 (1988).4145\bi{Cen82} N. N. \v{C}encov. \emph{Statistical Decision Rules and Optimal Inference}. Amer. Math. Soc., 1982.4146\bi{CFS16} B. Coecke, T. Fritz and R. Spekkens. A mathematical theory of resources. \emph{Inform. and Comput.} 250 (2016).4147\bi{Chu61} K. L. Chung. A note on the ergodic theorem of information theory. \emph{Ann. Math. Statist.} 32 (1961).4148\bi{CJ19} K. Cho and B. Jacobs. Disintegration and Bayesian inversion via string diagrams. \emph{Math. Structures Comput. Sci.} 29 (2019).4149\bi{CK11} I. Csisz\'ar and J. K\"orner. \emph{Information Theory: Coding Theorems for Discrete Memoryless Systems}, 2nd ed. Cambridge Univ. Press, 2011.4150\bi{CT06} T. Cover and J. Thomas. \emph{Elements of Information Theory}, 2nd ed. Wiley, 2006.4151\bi{Dar70} Z. Dar\'oczy. Generalized information functions. \emph{Inform. and Control} 16 (1970).4152\bi{DDGK16} F. Dahlqvist, V. Danos, I. Garnier and O. Kammar. Bayesian inversion by $\omega$-complete cone duality. \emph{Proc. CONCUR 2016}.4153\bi{DGB13} D. Dikranjan and A. Giordano Bruno. Entropy in a category. \emph{Appl. Categ. Structures} 21 (2013).4154\bi{DHKK14} G. Dimitrov, F. Haiden, L. Katzarkov and M. Kontsevich. Dynamical systems and categories. \emph{Contemp. Math.} 621 (2014).4155\bi{Dob59} R. L. Dobrushin. General formulation of Shannon's main theorem in information theory. \emph{Uspekhi Mat. Nauk} 14 (1959).4156\bi{Doo53} J. L. Doob. \emph{Stochastic Processes}. Wiley, 1953.4157\bi{EP23} N. Ensarguet and P. Perrone. Categorical probability spaces, ergodic decompositions, and transitions to equilibrium. arXiv:2310.04267 (2023).4158\bi{Erd46} P. Erd\H{o}s. On the distribution function of additive functions. \emph{Ann. of Math.} 47 (1946).4159\bi{EVG02} P. Elbaz-Vincent and H. Gangl. On poly(ana)logs I. \emph{Compositio Math.} 130 (2002).4160\bi{Fad56} D. K. Faddeev. On the concept of entropy of a finite probabilistic scheme. \emph{Uspekhi Mat. Nauk} 11 (1956).4161\bi{Fan61} R. Fano. \emph{Transmission of Information}. MIT Press, 1961.4162\bi{Fei54} A. Feinstein. A new basic theorem of information theory. \emph{IRE Trans. Inform. Theory} 4 (1954).4163\bi{Fei58} A. Feinstein. \emph{Foundations of Information Theory}. McGraw-Hill, 1958.4164\bi{Fei59} A. Feinstein. On the coding theorem and its converse for finite-memory channels. \emph{Inform. and Control} 2 (1959).4165\bi{FGLPS26} T. Fritz, T. Gonda, A. Lorenzin, P. Perrone and A. Shah Mohammed. Empirical measures and strong laws of large numbers in categorical probability. \emph{Log. Methods Comput. Sci.} 22(2) (2026).4166\bi{FR20} T. Fritz and E. F. Rischel. Infinite products and zero-one laws in categorical probability. \emph{Compositionality} 2 (2020).4167\bi{Fri17} T. Fritz. Resource convertibility and ordered commutative monoids. \emph{Math. Structures Comput. Sci.} 27 (2017).4168\bi{Fri20} T. Fritz. A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics. \emph{Adv. Math.} 370 (2020).4169\bi{Fuj78} S. Fujishige. Polymatroidal dependence structure of a set of random variables. \emph{Inform. and Control} 39 (1978).4170\bi{FuP21} J. Fullwood and A. Parzygnat. The information loss of a stochastic map. \emph{Entropy} 23 (2021).4171\bi{Gir82} M. Giry. A categorical approach to probability theory. \emph{Lecture Notes in Math.} 915 (1982).4172\bi{Gla03} E. Glasner. \emph{Ergodic Theory via Joinings}. Amer. Math. Soc., 2003.4173\bi{Gra09} R. Gray. \emph{Probability, Random Processes, and Ergodic Properties}, 2nd ed. Springer, 2009.4174\bi{Gra11} R. Gray. \emph{Entropy and Information Theory}, 2nd ed. Springer, 2011.4175\bi{Gro13} M. Gromov. In a search for a structure, Part 1: On entropy. Preprint, 2013.4176\bi{Hae79} W. Haemers. On some problems of Lov\'asz concerning the Shannon capacity of a graph. \emph{IEEE Trans. Inform. Theory} 25 (1979).4177\bi{Han03} T. S. Han. \emph{Information-Spectrum Methods in Information Theory}. Springer, 2003.4178\bi{HC67} J. Havrda and F. Charv\'at. Quantification method of classification processes: concept of structural $a$-entropy. \emph{Kybernetika} 3 (1967).4179\bi{Hed69} G. Hedlund. Endomorphisms and automorphisms of the shift dynamical system. \emph{Math. Systems Theory} 3 (1969).4180\bi{HJS07} I. Hasuo, B. Jacobs and A. Sokolova. Generic trace semantics via coinduction. \emph{Log. Methods Comput. Sci.} 3(4) (2007).4181\bi{Hu62} Hu Kuo Ting. On the amount of information. \emph{Theory Probab. Appl.} 7 (1962).4182\bi{Huf52} D. Huffman. A method for the construction of minimum-redundancy codes. \emph{Proc. IRE} 40 (1952).4183\bi{HV93} T. S. Han and S. Verd\'u. Approximation theory of output statistics. \emph{IEEE Trans. Inform. Theory} 39 (1993).4184\bi{Jac59} K. Jacobs. Die \"Ubertragung diskreter Informationen durch periodische und fastperiodische Kan\"ale. \emph{Math. Ann.} 137 (1959).4185\bi{JV20} A. Jensen and P. Vrana. The asymptotic spectrum of LOCC transformations. \emph{IEEE Trans. Inform. Theory} 66 (2020).4186\bi{Ken64} D. G. Kendall. Functional equations in information theory. \emph{Z. Wahrscheinlichkeitstheorie verw. Gebiete} 2 (1964).4187\bi{Khi53} A. I. Khinchin. The entropy concept in probability theory. \emph{Uspekhi Mat. Nauk} 8(3) (1953). English translation in \cite{Khi57}.4188\bi{Khi56} A. I. Khinchin. On the fundamental theorems of information theory. \emph{Uspekhi Mat. Nauk} 11(1) (1956). English translation in \cite{Khi57}.4189\bi{Khi57} A. I. Khinchin. \emph{Mathematical Foundations of Information Theory}. Translated by R. A. Silverman and M. D. Friedman. Dover, 1957.4190\bi{KK13} H. Kerstan and B. K\"onig. Coalgebraic trace semantics for continuous probabilistic transition systems. \emph{Log. Methods Comput. Sci.} 9(4) (2013).4191\bi{Kli07} M. Klimesh. Inequalities that collectively completely characterize the catalytic majorization relation. arXiv:0709.3680 (2007).4192\bi{Kol58} A. N. Kolmogorov. A new metric invariant of transient dynamical systems and automorphisms in Lebesgue spaces. \emph{Dokl. Akad. Nauk SSSR} 119 (1958).4193\bi{Kon95} M. Kontsevich. The $1\frac12$-logarithm. Appendix to \cite{EVG02}; circulated 1995.4194\bi{Kra49} L. G. Kraft. A device for quantizing, grouping, and coding amplitude-modulated pulses. M.S. thesis, MIT, 1949.4195\bi{Kri70} W. Krieger. On entropy and generators of measure-preserving transformations. \emph{Trans. Amer. Math. Soc.} 149 (1970).4196\bi{Law62} F. W. Lawvere. The category of probabilistic mappings. Unpublished manuscript, 1962.4197\bi{Law73} F. W. Lawvere. Metric spaces, generalized logic, and closed categories. \emph{Rend. Sem. Mat. Fis. Milano} 43 (1973).4198\bi{Lee64} P. M. Lee. On the axioms of information theory. \emph{Ann. Math. Statist.} 35 (1964).4199\bi{Lei21} T. Leinster. \emph{Entropy and Diversity: The Axiomatic Approach}. Cambridge Univ. Press, 2021.4200\bi{Lei21p} T. Leinster. Entropy modulo a prime. \emph{Commun. Number Theory Phys.} 15 (2021).4201\bi{Lin01} E. Lindenstrauss. Pointwise theorems for amenable groups. \emph{Invent. Math.} 146 (2001).4202\bi{LM95} D. Lind and B. Marcus. \emph{An Introduction to Symbolic Dynamics and Coding}. Cambridge Univ. Press, 1995.4203\bi{Lov79} L. Lov\'asz. On the Shannon capacity of a graph. \emph{IEEE Trans. Inform. Theory} 25 (1979).4204\bi{Mat07} F. Mat\'u\v{s}. Infinitely many information inequalities. \emph{Proc. IEEE ISIT} (2007).4205\bi{McM53} B. McMillan. The basic theorems of information theory. \emph{Ann. Math. Statist.} 24 (1953).4206\bi{McM56} B. McMillan. Two inequalities implied by unique decipherability. \emph{IRE Trans. Inform. Theory} 2 (1956).4207\bi{Mes59} L. D. Meshalkin. A case of isomorphism of Bernoulli schemes. \emph{Dokl. Akad. Nauk SSSR} 128 (1959).4208\bi{MP23} S. Moss and P. Perrone. A category-theoretic proof of the ergodic decomposition theorem. \emph{Ergodic Theory Dynam. Systems} 43 (2023).4209\bi{Ned57} J. Nedoma. The capacity of a discrete channel. \emph{Trans. First Prague Conf. Information Theory} (1957).4210\bi{Orn70} D. Ornstein. Bernoulli shifts with the same entropy are isomorphic. \emph{Adv. Math.} 4 (1970).4211\bi{OW83} D. Ornstein and B. Weiss. The Shannon--McMillan--Breiman theorem for a class of amenable groups. \emph{Israel J. Math.} 44 (1983).4212\bi{Par61} K. R. Parthasarathy. On the integral representation of the rate of transmission of a stationary channel. \emph{Illinois J. Math.} 5 (1961).4213\bi{Par64} W. Parry. Intrinsic Markov chains. \emph{Trans. Amer. Math. Soc.} 112 (1964).4214\bi{Par22} A. Parzygnat. A functorial characterization of von Neumann entropy. \emph{Cah. Topol. G\'eom. Diff\'er. Cat\'eg.} 63 (2022).4215\bi{Per24} P. Perrone. Markov categories and entropy. \emph{IEEE Trans. Inform. Theory} 70 (2024).4216\bi{Pet83} K. Petersen. \emph{Ergodic Theory}. Cambridge Univ. Press, 1983.4217\bi{PVB24} P. Perrone and R. Van Belle. Convergence of martingales via enriched dagger categories. arXiv:2404.15191 (2024).4218\bi{PW25} Y. Polyanskiy and Y. Wu. \emph{Information Theory: From Coding to Learning}. Cambridge Univ. Press, 2025.4219\bi{Ren61} A. R\'enyi. On measures of entropy and information. \emph{Proc. Fourth Berkeley Symp. Math. Statist. Probab.} 1 (1961).4220\bi{SBBR13} A. Silva, F. Bonchi, M. Bonsangue and J. Rutten. Generalizing determinization from automata to coalgebras. \emph{Log. Methods Comput. Sci.} 9(1) (2013).