Publications of Katona, G.O.H.

Frankl P, Katona GO. If the intersection of any r sets has a size 6= r ¡ 1. Studia Scientiarum Mathematicarum Hungarica. 1979;14:47-9.
Katona GO. Continuous versions of some extremal hypergraph problems. In: Colloquia mathematica Societatis János Bolyai. Vol 18.; 1978. p. 653-78. (Bolyai Society Mathematical Studies; vol 18).
Katona GO. Optimization for order ideals under a weight assignment. In: Problemes combinatoires et theorie des graphes. Vol 260. Paris: Éditions du Centre national de la recherche scientifique,; 1978. p. 257-8. (Colloques internationaux du Centre national de la recherche scientifique; vol 260).
Katona GO. Search using sets with small intersection. In: Théorie de l'information : développements récents et applications. Vol 276. Paris: Éditions du Centre national de la recherche scientifique; 1978. p. 381-8. (Colloques internationaux du Centre national de la recherche scientifique; vol 276).
Ahlswede R, Katona GO. Graphs With Maximal Number Of Adjacent Pairs Of Edges. Acta Mathematica Academiae Scientiarum Hungaricae. 1978;32(1-2):97-120.
Katona GO. On a problem of L. Fejes Tóth. Studia Scientiarum Mathematicarum Hungarica. 1977;12(2):77-80.
Katona GO, Nemetz TO. Huffman Codes And Self-Information. IEEE Transactions on Information Theory. 1976;22(3):337-40.
Greene C, Katona GO, Kleitman DJ. Extensions of the Erdős-Ko-Rado theorem. In: Fiedler M, editor. Recent advances in graph theory : proceedings of the symposium held in Prague, June 1974. Prague: Czechoslovak Academy of Sciences; 1975. p. 223-31.
Katona GO. The Hamming-sphere has minimum boundary. Studia Scientiarum Mathematicarum Hungarica. 1975;10:131-41.
Katona GO. Extremal problems for hypergraphs. In: Hall MJ, van Lint JH, editors. Combinatorics. Dordrecht: D. Reidel Publishing Co.; 1974. p. 215-44. (Proceedings of the NATO Advanced Study Institute held at Nijenrode Castle, Breukelen, 8--20 July 1974).
Katona GO. Solution of a problem of A. Ehrenfeucht and J. Mycielski. Journal of Combinatorial Theory Series A. 1974;17:265-6.
Katona GO. Combinatorial search problems. In: Srivastava NJ, editor. A Survey of combinatorial theory. New York: Elsevier; 1973. p. 285-308.
Katona GO. A three part Sperner theorem. Studia Scientiarum Mathematicarum Hungarica. 1973;8:379-90.
Katona GO. A generalization of some generalizations of Sperner's theorem. Journal of Combinatorial Theory Series B. 1972;12(1):72-81.
Katona GO, Lee MA. Some remarks on the construction of optimal codes. Acta Mathematica Academiae Scientiarum Hungaricae. 1972;23:439-42.
Katona GO. Sperner type theorems. Budapest: Hungarian Academy of Sciences; 1972.
Katona GO, Szász DO. Matching problems. Journal of Combinatorial Theory Series B. 1971;10(1):60-92.

Courses and lectures / International Centre for Mechanical Sciences

Lectures held at the Department for Automation and Information, June 1970

Katona GO. How many sums of vectors can lie in a circle of radius 2. In: Combination theory and its application. Vol 4. Budapest: János Bolyai Mathematical Society; 1970. p. 687-93. (Colloquia mathematica Societatis János Bolyai; vol 4).
Katona GO, Szász DO. Matching problems. In: Combination theory and its application. Vol 4. Budapest: János Bolyai Mathematical Society; 1970. p. 695-703. (Colloquia mathematica Societatis János Bolyai; vol 4).

Information sources with different costscales and the principle of conservation of entropy

The aim of this paper is to provide a mathematically rigorous and sufficiently general treatment of the basic information-theoretic problems concerning sources with symbols of different costs and noiseless coding in a general sense. The main new concepts defined in this paper are the entropy rate (entropy per unit cost) of a source with respect to a stochastic cost scale and the encoding (in particular decodable encoding) of a source in a general sense. On the basis of these concepts, we prove some general theorems on the relation of entropy rates with respect to different cost scales and on the effect of encoding to the entropy rate. In particular, the ldquoprinciple of conservation of entropyrdquo and the ldquonoiseless coding theoremrdquo are proved under very general conditions.The main results of this research have been reported at the Second Congress of Bulgarian Mathematicians, Varna, August 1967, at the International Symposium on Information Theory, San Remo, September 1967 and at the Colloquium on Information Theory, Debrecen, September 1967.

Katona GO. A theorem of finite sets. In: Erdős P, Katona GOH, editors. Theory of Graphs. Budapest: Akadémia Kiadó; 1968. p. 187-207.
Katona GO, Korvin G. Functions defined on a directed graph. In: Erdős P, Katona GOH, editors. Theory of Graphs. New York: Academic Press; 1968. p. 209-13.
Katona GO. Sperner típusú tételek. Budapest: Eötvös Lórán University; 1968.
Katona GO, Szemerédi E. On a problem of graph theory. Studia Scientiarum Mathematicarum Hungarica. 1967;2:23-8.
Katona GO. Intersection theorems for systems of finite sets. Acta Mathematica Academiae Scientiarum Hungaricae. 1964;15:339-337.