Monographs

CSISZAR I., KORNER J. (1981) Information Theory: Coding Theorems for Discrete Memoryless Systems. Academic Press, New York, and Akademiai Kiado, Budapest, (460 pp.).

CSISZAR I., KORNER J. (2011) Information Theory: Coding Theorems for Discrete Memoryless Systems, 2nd,
revised edition. Cambridge University Press. (600 pp.).

Papers

• KORNER J., Monti A., Families of locally separated Hamilton paths, submitted to Journal of Graph Theory,


• COHEN, G., FACHINI E., KORNER J. Path separation by short cycles, Journal of Graph Theory, to appear


• COHEN, G., FACHINI E., KORNER J.,(2016) Zero-error capacity of binary channels with memory,IEEE Trans. Information Theory vol. 62 no. 1, pp. 3-7


• COHEN, G., FACHINI E., KORNER J. (2014) Connector families of graphs, Graphs and Combinatorics, vol. 30, pp. 1417-1425, doi: 10.1007/s00373-013-1347-3


• KORNER J., MUZI I.(2013) Degree-doubling graph families, SIAM J. on Discrete Mathematics, 27(3),pp. 1575-1583


• KORNER J., MESSUTI S., SIMONYI G. (2012) Families of graph-different Hamilton paths, SIAM J. on Discrete Mathematics, 26, pp. 321-329


• COHEN G., FACHINI E., KORNER J. (2011) Skewincidence, IEEE TRANS. ON INFORMATION THEORY, vol. 57, no. 11,pp. 7313-7316


• FACHINI E., KORNER J. (2011) Forbiddance and Capacity. GRAPHS AND COMBINATORICS, ISSN: 0911-0119, doi: 10.1007/s00373-010-0987-9


• BRIGHTWELL G., COHEN G., FACHINI E., FAIRTHORNE M., KORNER J., TÓTH A. (2010) Permutation capacities of families of oriented infinite paths. SIAM JOURNAL ON DISCRETE MATHEMATICS, vol. 24; p. 441-456, ISSN: 0895-4801, doi: 10.1137/090765407


• KORNER J., SIMONYI G., SINAIMERI B. (2009) On types of growth for graph-different permutations, J. Comb. Theory Ser.A, 116, pp. 713-723.doi: 10.1016/j.jcta.2008.11.003


• KORNER J., MALVENUTO C., SIMONYI G. (2008) Graph-different permutations, SIAM J. on Discrete Mathematics, 2, vol.22, pp. 489-499. doi: 10.1137/070692686


• FACHINI E., KORNER J. (2007) Cross-Intersecting Couples of Graphs. JOURNAL OF GRAPH THEORY, vol. 56; p. 105-112, ISSN: 0364-9024, doi: 10.1002/jgt.20252


• KORNER J., SINAIMERI B. (2007) On cancellative set families, Combinatorics, Probability and Computing, vol. 16, pp. 767-773. doi: 10.1017/S0963548307008413


• KORNER J., MALVENUTO C. (2006) Pairwise colliding permutations and the capacity of infinite graphs, SIAM J. on Discrete Mathematics, 1, vol. 20, pp. 203-212. doi: 10.1137/050632877


• KORNER J., PILOTTO C., SIMONYI G. (2005) Local chromatic number and Sperner capacity, J. Comb. Theory Ser. B, vol. 95(2005), pp. 101-117. doi: 10.1016/j.jctb.2005.03.006


• FACHINI E., KORNER J. (2003) Codes for a long silence. IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 49; p. 2020-2022, ISSN: 0018-9448. doi: 10.1109/TIT.2003.814933


• KORNER J., MONTI A. (2002) Delta-systems and qualitative (in)dependence, J. Comb. Theory Ser. A, 99, pp. 75-84. doi: 10.1006/jcta.2002.3256


• FACHINI E., KORNER J. (2001) A note on counting very different sequences. COMBINATORICS, PROBABILITY & COMPUTING, vol. 10; p. 501-504, ISSN: 0963-5483.doi: 10.1017/S0963548301004783


• FACHINI E., KORNER J., MONTI A. (2001) A better bound for locally thin set families. JOURNAL OF COMBINATORIAL THEORY. SERIES A, vol. 95; p. 209-218, ISSN: 0097-3165, doi:10.1006/jcta.2000.3162


• FACHINI E., KORNER J., MONTI A. (2001) Self--similarity bounds for locally thin set families. COMBINATORICS, PROBABILITY & COMPUTING, vol. 95; p. 209-218, ISSN: 0963-5483, doi: 10.1017/S0963548301004667


• KORNER J, MARTON K. (2001) Relative capacity and dimension of graphs, Transactions of the Fifth Czech-Slovak Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Discrete Math. 235, pp. 307-315. doi: 10.1016/S0012-365X(00)00283-1


• KORNER J, MONTI A. (2001) Compact representations of the intersection structure of families of finite sets,
  SIAM J. on Discrete Mathematics, 14(2001) no. 2, pp. 181-192.


• ALON N., FACHINI E., KORNER J. (2000) Locally thin set families. COMBINATORICS, PROBABILITY & COMPUTING, vol. 9; p. 481-488, ISSN: 0963-5483, doi: 10.1017/S0963548300004521


• FACHINI E., KORNER J. (2000) Colour number, capacity and perfectness of directed graphs. GRAPHS AND COMBINATORICS, vol. 16; p. 389-398, ISSN: 0911-0119,DOI: 10.1007/PL00007226


• ALON N., KORNER J., MONTI A.(2000) String quartets in binary, Combinatorics, Probability and Computing, 9 no. 5, pp. 381-390.


• KORNER J., SIMONYI G. (2000) Graph pairs and their entropies: modularity problems, Combinatorica, 220, pp. 227-240.


• DE SIMONE C., KORNER J.(1999) On the odd cycles of normal graphs, Disc. Appl. Math., 94, pp. 161-169.


• KORNER J., ORLITSKY A .(1999) Zero-error information theory, IEEE Trans. Inform. Theory, 44 no. 6, pp. 2207-2229.


• KORNER J. (1998) On clique growth in products of directed graphs, Graphs and Combinatorics, 14, pp. 25-36.


• HOLLMANN D.L., KORNER J., LITSYN S. (1997) Tiling Hamming space with few spheres, J. Comb. Theory, Ser. A, 8, pp. 388-393.


• FACHINI E., KORNER J. (1996) Tight Packings of Hamming Spheres. JOURNAL OF COMBINATORIAL THEORY. SERIES A, vol. 76,2; p. 292-294, ISSN: 0097-3165, doi:10.1006/jcta.1996.0105


• HOLZMAN R., KORNER J. (1995) Cancellative Pairs of Families, European J. Comb., 16, pp. 263-266.


• KORNER J. (1995) On the extremal combinatorics of the Hamming space, J. Comb. Th., Ser. A,
  71,no. 1, pp. 112-126.


• KORNER J. (1995) Intersection number and capacities of graphs, Discrete Math., 142, pp.169-184


• GARGANO L., KORNER J., VACCARO U.(1995) On the capacity of Boolean graph formulae, Graphs and Combinatorics,11(1995), pp. 29-48.


• KORNER J., SIMONYI G. (1995) Trifference, Studia Sci. Math. Hung., 30(1995), pp. 95-103.


• GARGANO L., KORNER J., VACCARO U. (1994) Capacities: from information theory to extremal set theory, J. Comb. Theory Ser. A, 68(1994), no. 2, pp. 296-315.


• LUCERTINI M., KORNER J. (1994) Compressing inconsistent data, IEEE Trans. Inform. Theory, 40 no. 3, pp. 706-715.


• GALLUCCIO A., GARGANO L., KORNER J., SIMONYI G. (1994) Different capacities of digraphs, Graphs and Combinatorics, 10, pp. 105-121.


• GARGANO L., KORNER J., VACCARO U. (1993) Sperner capacities, Graphs and Combinatorics, 9, (1993), pp. 31-46


• GARGANO L., KORNER J., VACCARO U. (1992) Search problems for two irregular coins with incomplete feedback: the under-weight model, Disc. Appl. Math., 36, pp.191-19.


• KORNER J., SIMONYI G., TUZA Z. (1992) Perfect couples of graphs, Combinatorica, 2(12), pp. 179-192.


• KORNER J., SIMONYI G.(1992) A Sperner-type theorem and qualitative independence, J. Comb. Theory, Ser.A, 1(59), pp. 90-103.


• GARGANO L., KORNER J., VACCARO U. (1992) Qualitative independence and Sperner problems for directed graphs, J. Comb. Theory, Ser. A, 61, pp. 173-192.


• KORNER J, MARTON K. (1990) On the capacity of uniform hypergraphs, IEEE Trans. Inform. Theory, 36, pp. 153-156.


• COHEN G., KORNER J., SIMONYI G. (1990) Zero-error capacities and very different sequences, in:Sequences. Combinatorics, Security and Transimission, Advanced International Workshop on Se- quences, Positano, Italy, June 1988, Springer, New York, R. M. Capocelli ed., pp.144-155.


• CSISZAR I., KORNER J., LOVASZ L., MARTON K., SIMONYI G. (1990) Entropy splitting for antiblocking corners and perfect graphs, Combinatorica,1(10), pp. 27-40.


• KORNER J., SIMONYI G. (1988) Separating partition systems and locally different sequences, SIAM J. Discrete Math., 3(1), pp. 355-359.


• KORNER J., MARTON K., (1988) New bounds for perfect hashing via information theory, European J. Combinatorics, 9, pp. 523-530.


• KORNER J., MARTON K., (1988) Graphs that split entropies, SIAM J. Discrete Math., 1(1), pp. 71-79.


• KORNER J., MARTON K., (1988) Random access communication and graph entropy, IEEE Trans. Inform. Theory 34, pp. 312-314.


• KORNER J., WEI V. K. (1986) Addendum to "Odd and even Hamming spheres also have minimum boundary",Discrete Math. 62, pp. 105-106.


• KORNER J., (1986) Fredman-Komlos bounds and information theory, SIAM J. on Algebraic and
  Discrete Meth., 4(7), pp.560-570.


• KORNER J., SGARRO A. (1986) A new approach to rate-distortion theory, Rend. Ist. Matem. Univ. Trieste,vol. XVIII., pp.177-187.


• KORNER J. (1984) OPEC or a basic problem in source networks, IEEE Trans. Inform. Theory 30, pp. 68-77.


• KORNER J., WOLF J.K., ZIV J. (1984) Coding for a write-once memory, Bell Syst. Tech. J. 6(63),pp. 1089-1112.


• KORNER J., WEI V. K. (1984) Odd and even Hamming spheres also have minimum boundary, Discrete Math.,51, pp.147- 165.


• HWANG F.K., KORNER J., WEI V. K. (1984) Selecting non-consecutive balls arranged in many lines, J.Comb. Theory, A37, pp. 327-336.


• ERICSON T., KORNER J., (1983) Successive encoding of correlated sources, IEEE Trans. Inform. Theory 29, pp. 390- 395.


• KORNER J. (1982) About a combinatorial proof of the noisy channel coding theorem, In: Multi-User Communication, Ed. G. Longo, Springer-Verlag, Wien, pp. 49-72


• CSISZAR I., KORNER J. (1981) On the capacity of the arbitrarily varying channel for maximum probability of error, Zeitschrift fur Wahrscheinlichkeitstheorie verw. Geb.57, pp.87-101.


• CSISZAR I., KORNER J. (1981) Graph decomposition: a new key to coding theorems, IEEE Trans. Inform. Theory 27, pp.5-12.


• CSISZAR I., KORNER J. (1980) Many coding theorems follow from an elementary combinatorial lemma, In:Third Czechoslovak-Soviet-Hungarian Seminar on Information Theory, Liblice, pp. 25- 44.


• CSISZAR I., KORNER J. (1980) Feedback does not eect the reliability function of a DMC at rates above capacity, IEEE Trans. Inform. Theory 28, pp. 92-93.


• CSISZAR I., KORNER J. (1980) Towards a general theory of source networks, IEEE Trans. Inform. Theory 26, pp.155-165.


• KORNER J., SGARRO A.(1980) Universally attainable error exponents for broadcast channels with degraded message sets, IEEE Trans. Inform. Theory 26, pp.670-679.


• KORNER J., DUECK G. (1979) Reliability function of a DMC at rates above capacity, IEEE Trans. Inform. Theory 25, pp. 82-85.


• KORNER J., MARTON K.(1979) How to encode the modulo 2 sum of binary sources, IEEE Trans. Inform.Theory 25, 219-221.


• CSISZAR I., KORNER J. (1978) Broadcast channels with condential messages, IEEE Trans. Inform. Theory 24, pp. 339-348.


• KORNER J. (1977) Source networks and new information measures, In: Colloques Internationaux du CNRS No. 276, Theorie de l'Information, Paris, pp. 235-242


• CSISZAR I., KORNER J., MARTON K. (1977) A new look at exponential error bounds for memoryless channels, Preprint, appeared in CSISZAR I., KORNER J.:Information Theory: Coding Theorems for Discrete Memoryless Systems


• KORNER J., MARTON K.(1977) Images of a set via two channels and their role in multi-user communication, IEEE Trans. Inform. Theory 23, pp. 751-761


• KORNER J., MARTON K.(1977) Comparison of two noisy channels, In: Topics in Information Theory, Coll. Math. Soc. J. Bolyai No. 16, Ed. P. Elias and I. Csiszar, North Holland, pp. 411-423.


• KORNER J., MARTON K.(1977) General broadcast channels with degraded message sets, IEEE Trans. Inform. Theory 23, pp. 60-64.


• KORNER J. (1976) Some methods in multi-user communication, In: Information Theory, New Trends and Open Problems, Ed. G. Longo, Springer-Verlag, pp. 172-224


• CSISZAR I., KORNER J. (1976) Source networks with unauthorized users, Journal of Combinatorics, Information and System Sciences, 1(1), pp. 25-40.


• AHLSWEDE R., GACS P., KORNER J. (1976) Bounds on conditional probabilities with applications in multi-user communication, Zeitschrift f. Wahrscheinlichkeitstheorie verw. Geb. 34, pp. 157-179.


• AHLSWEDE R., KORNER J. (1975) Source coding with side information and a converse for degraded broadcast channels, IEEE Trans. Inform. Theory 21, pp. 629-637.


• AHLSWEDE R., KORNER J. (1974) On the connection between the entropies of input and output distributions of discrete memoryless channels, Proceedings of the 5th Brasov Conference on Probability Theory, Brasov, l974. Editura Academiei, Bucuresti, 1977, pp. 13-23.


• AHLSWEDE R., KORNER J. (1974) On common information and related characteristics of correlated information sources, Preprint(1974), republished in: General Theory of Information Transfer and Combinatorics, edited by Rudolf Ahlswede et al., Lecture Notes in Computer Science vol. 4123, (2006), Springer Verlag, pp. 664-677.


• KORNER J. (1973) Coding of an information source having ambiguous alphabet and the entropy of graphs. Transactions of the 6th Prague conference on Information Theory, etc.,Academia, Prague, pp. 411-425


• GACS P., KORNER J. (1973) Common information is far less than mutual information. Problems of Control and Information Theory 2 (2), pp. 149-162


• LONGO G., KORNER J. (1972) A consistency problem of conditional distributions. International Centre for Mechanical Sciences Int. Rept. No. 4, Udine.


• LONGO G., KORNER J. (1973) Two-step encoding of finite sources, IEEE Trans. Inform. Theory 19, pp.778-782.


• KORNER J. (1973) Coding of finite sources with sum-type distortion, Preprint.


• KORNER J. (1973) An extension of the class of perfect graphs, Studia Sci. Math. Hung. 8, pp. 405-409


• KORNER J. (1971) A property of conditional entropy. Studia Sci.Math.Hung. 6, pp. 355-359.