Imre Csiszár - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 68 from 68

2021

Error Exponents for Asynchronous Multiple Access Channels, Controlled Asynchronism May Outperform SynchronismImre Csiszár, Lóránt Farkas, Tamás Kói. TIT, 67(12):7684-7707, 2021. [doi]

2018

Expected Value Minimization in Information Theoretic Multiple Priors ModelsImre Csiszár, Thomas Breuer. TIT, 64(6):3957-3974, 2018. [doi]

2017

Error exponents for sparse communicationLóránt Farkas, Tamás Kói, Imre Csiszár. isit 2017: 3145-3149 [doi]

2016

Convergence of generalized entropy minimizers in sequences of convex problemsImre Csiszár, Frantisek Matús. isit 2016: 2609-2613 [doi]

2015

An Information Geometry Problem in Mathematical FinanceImre Csiszár, Thomas Breuer. gsi 2015: 435-443 [doi]

2013

2012

Minimization of entropy functionals revisitedImre Csiszár, Frantisek Matús. isit 2012: 150-154 [doi]

Generalized minimizers of convex integral functionals, Bregman distance, Pythagorean identitiesImre Csiszár, Frantisek Matús. kybernetika, 48(4):637-689, 2012. [doi]

2011

On Information Theoretic Security: Mathematical Models and Techniques - (Invited Talk)Imre Csiszár. icits 2011: 73-75 [doi]

Information Theory - Coding Theorems for Discrete Memoryless Systems, Second EditionImre Csiszár, János Körner. Cambridge University Press, 2011. [doi]

2010

On rate of convergence of statistical estimation of stationary ergodic processesImre Csiszár, Zsolt Talata. TIT, 56(8):3637-3641, 2010. [doi]

Capacity of a shared secret keyImre Csiszár, Prakash Narayan. isit 2010: 2593-2596 [doi]

2009

2008

2007

On Oblivious Transfer CapacityRudolf Ahlswede, Imre Csiszár. isit 2007: 2061-2064 [doi]

On Multiterminal Secrecy CapacitiesImre Csiszár, Prakash Narayan. isit 2007: 2051-2055 [doi]

2006

Context tree estimation for not necessarily finite memory processes, via BIC and MDLImre Csiszár, Z. Talata. TIT, 52(3):1007-1016, 2006. [doi]

Generalized maximum likelihood estimates for exponential familiesImre Csiszár, Frantisek Matús. isit 2006: 1939-1943 [doi]

2005

Context tree estimation for not necessarily finite memory processes, via BIC and MDLImre Csiszár, Zsolt Talata. isit 2005: 755-759 [doi]

Secrecy capacities for multiterminal channel modelsImre Csiszár, Prakash Narayan. isit 2005: 2138-2141 [doi]

2004

2003

A first course in information theory [Book Review]Imre Csiszár. TIT, 49(7):1869-1869, 2003.

Information projections revisitedImre Csiszár, Frantisek Matús. TIT, 49(6):1474-1490, 2003.

2002

Large-scale typicality of Markov sample paths and consistency of MDL Order estimatorsImre Csiszár. TIT, 48(6):1616-1628, 2002.

The secret key capacity for multiple terminalsImre Csiszár, Prakash Narayan. itw 2002: 8-10 [doi]

2000

Common randomness and secret key generation with a helperImre Csiszár, Prakash Narayan. TIT, 46(2):344-366, 2000.

1999

MEM pixel correlated solutions for generalized moment and interpolation problemsImre Csiszár, Fabrice Gamboa, Elisabeth Gassiat. TIT, 45(7):2253-2270, 1999.

1998

Common Randomness in Information Theory and Cryptography - Part II: CR CapacityRudolf Ahlswede, Imre Csiszár. TIT, 44(1):225-240, 1998.

The Method of TypesImre Csiszár. TIT, 44(6):2505-2523, 1998.

1996

Redundancy rates for renewal and other processesImre Csiszár, Paul C. Shields. TIT, 42(6):2065-2072, 1996.

1995

Generalized cutoff rates and Renyi s information measuresImre Csiszár. TIT, 41(1):26-34, 1995.

Review of Universal Compression and Retrieval (Krichevsky, R.; 1994)Imre Csiszár. TIT, 41(3):862, 1995.

Channel capacity for a given decoding metricImre Csiszár, Prakash Narayan. TIT, 41(1):35-43, 1995.

1993

Common randomness in information theory and cryptography - I: Secret sharingRudolf Ahlswede, Imre Csiszár. TIT, 39(4):1121-1132, 1993.

1992

Arbitrarily varying channels with general alphabets and statesImre Csiszár. TIT, 38(6):1725-1742, 1992.

1991

Capacity of the Gaussian arbitrarily varying channelImre Csiszár, Prakash Narayan. TIT, 37(1):18-26, 1991. [doi]

1990

Entropy splitting for antiblocking corners and perfect graphsImre Csiszár, János Körner, László Lovász, Katalin Marton, Gábor Simonyi. combinatorica, 10(1):27-40, 1990.

1989

Capacity and decoding rules for classes of arbitrarily varying channelsImre Csiszár, Prakash Narayan. TIT, 35(4):752-769, 1989.

1988

The capacity of the arbitrarily varying channel revisited: Positivity, constraintsImre Csiszár, Prakash Narayan. TIT, 34(2):181-193, 1988.

Arbitrarily varying channels with constrained inputs and statesImre Csiszár, Prakash Narayan. TIT, 34(1):27-34, 1988.

1987

Conditional limit theorems under Markov conditioningImre Csiszár, Thomas M. Cover, Byoung-Seon Choi. TIT, 33(6):788-801, 1987.

1986

Hypothesis testing with communication constraintsRudolf Ahlswede, Imre Csiszár. TIT, 32(4):533-542, 1986.

1982

Feedback does not affect the reliability function of a DMC at rates above capacityImre Csiszár, János Körner. TIT, 28(1):92, 1982.

Linear codes for sources and source networks: Error exponents, universal codingImre Csiszár. TIT, 28(4):585-592, 1982.

On the error exponent of source-channel transmission with a distortion thresholdImre Csiszár. TIT, 28(6):823-827, 1982.

1981

To get a bit of information may be as hard as to get full informationRudolf Ahlswede, Imre Csiszár. TIT, 27(4):398-408, 1981.

Graph decomposition: A new key to coding theoremsImre Csiszár, János Körner. TIT, 27(1):5-11, 1981.

1980

Towards a general theory of source networksImre Csiszár, János Körner. TIT, 26(2):155-165, 1980. [doi]

1978

Broadcast channels with confidential messagesImre Csiszár, János Körner. TIT, 24(3):339-348, 1978. [doi]

1976

Review of ́On Measures of Information and Their Characterizationś (Aczél, J., and Daróczy, Z.; 1975)Imre Csiszár. TIT, 22(6):765-766, 1976. [doi]

1974

On the computation of rate-distortion functions (Corresp.)Imre Csiszár. TIT, 20(1):122-124, 1974. [doi]

1969

Simple Proofs of Some Theorems on Noiseless ChannelsImre Csiszár. iandc, 14(3):285-298, March 1969.

1967

Two Remarks to Noiseless CodingImre Csiszár. iandc, 11(3):317-322, September 1967.

Sign in or sign up to see more results.

runs on WebDSL