János Körner

From MaRDI portal
Person:168586

Available identifiers

zbMath Open korner.janosDBLP73/2629WikidataQ15822188 ScholiaQ15822188MaRDI QIDQ168586

List of research outcomes





PublicationDate of PublicationType
Structured Codes of Graphs2023-03-30Paper
Guest Editorial Special Issue: “From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein”2021-07-23Paper
Divergent permutations2020-03-20Paper
Interlocked Permutations2019-09-16Paper
Families of locally separated Hamilton paths2018-08-16Paper
Hamilton Paths With Lasting Separation2018-06-27Paper
Skewincidence2017-07-12Paper
Path Separation by Short Cycles2017-06-30Paper
Zero-Error Capacity of Binary Channels With Memory2017-04-28Paper
Information Theory2015-10-28Paper
Connector families of graphs2015-01-20Paper
Degree-doubling graph families2014-01-21Paper
Families of very different paths2013-11-01Paper
Permutation capacities and oriented infinite paths2013-11-01Paper
Families of graph-different Hamilton paths2012-08-22Paper
Forbiddance and capacity2012-01-24Paper
Permutation Capacities of Families of Oriented Infinite Paths2011-04-15Paper
Information Theory2011-02-16Paper
On types of growth for graph-different permutations2009-06-17Paper
Graph-Different Permutations2009-05-27Paper
Appendix: On Common Information and Related Characteristics of Correlated Information Sources2009-01-22Paper
Codes for a long silence2008-12-21Paper
On Cancellative Set Families2008-02-22Paper
Cross‐intersecting couples of graphs2008-01-04Paper
Delta-systems and qualitative (in)dependence2007-05-29Paper
Pairwise colliding permutations and the capacity of infinite graphs2006-06-01Paper
Local chromatic number and Sperner capacity2005-09-28Paper
Delta-systems and qualitative (in)dependence2003-03-26Paper
A note on counting very different sequences2002-09-11Paper
Self-similarity bounds for locally thin set families2002-06-03Paper
A better bound for locally thin set families2002-03-29Paper
String quartets in binary2002-01-21Paper
Locally thin set families2001-11-09Paper
Relative capacity and dimension of graphs2001-07-18Paper
Colour number, capacity, and perfectness of directed graphs2001-06-26Paper
Graph pairs and their entropies: Modularity problems2001-04-01Paper
Compact representations of the intersection structure of families of finite sets2001-03-19Paper
Compressing inconsistent data2000-07-06Paper
On the odd cycles of normal graphs2000-01-02Paper
Zero-error information theory1999-11-21Paper
On clique growth in products of directed graphs1998-09-14Paper
Tiling Hamming space with few spheres1997-12-02Paper
Tight packings of Hamming spheres1996-12-16Paper
https://portal.mardi4nfdi.de/entity/Q48782881996-09-29Paper
https://portal.mardi4nfdi.de/entity/Q48584411996-05-27Paper
On the extremal combinatorics of the Hamming space1995-11-26Paper
Cancellative pairs of families of sets1995-10-23Paper
On the capacity of Boolean graph formulæ1995-09-11Paper
Capacities: From information theory to extremal set theory1995-03-05Paper
Different capacities of a digraph1994-09-26Paper
Sperner capacities1993-06-29Paper
Qualitative independence and Sperner problems for directed graphs1993-01-17Paper
Perfect couples of graphs1993-01-16Paper
Search problems for two irregular coins with incomplete feedback: The underweight model1992-09-27Paper
A Sperner-type theorem and qualitative independence1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39775871992-06-25Paper
Entropy splitting for antiblocking corners and perfect graphs1990-01-01Paper
On the capacity of uniform hypergraphs1990-01-01Paper
Separating Partition Systems and Locally Different Sequences1988-01-01Paper
Fredman–Komlós bounds and information theory1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37738121986-01-01Paper
Addendum to ``Odd and even Hamming spheres also have minimum boundary1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38152401985-01-01Paper
Selecting non-consecutive balls arranged in many lines1984-01-01Paper
Odd and even Hamming spheres also have minimum boundary1984-01-01Paper
OPEC or a basic problem in source networks1984-01-01Paper
Successive encoding of correlated sources1983-01-01Paper
Feedback does not affect the reliability function of a DMC at rates above capacity (Corresp.)1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36866151981-01-01Paper
On the capacity of the arbitrarily varying channel for maximum probability of error1981-01-01Paper
Graph decomposition: A new key to coding theorems1981-01-01Paper
Universally attainable error exponents for broadcast channels with degraded message sets1980-01-01Paper
Towards a general theory of source networks1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36692981980-01-01Paper
How to encode the modulo-two sum of binary sources (Corresp.)1979-01-01Paper
Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)1979-01-01Paper
Broadcast channels with confidential messages1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33121411978-01-01Paper
General broadcast channels with degraded message sets1977-01-01Paper
Correction to bounds on conditional probabilities with applications1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41452581977-01-01Paper
Images of a set via two channels and their role in multi-user communication1977-01-01Paper
Bounds on conditional probabilities with applications in multi-user communication1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41986071976-01-01Paper
Source coding with side information and a converse for degraded broadcast channels1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41218121975-01-01Paper
Two-step encoding for finite sources1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40795031973-01-01Paper

Research outcomes over time

This page was built for person: János Körner