| 2008 |
|---|
| 33 | EE | Imre Csiszár:
On Iterative Algorithms with an Information Geometry Background.
ALT 2008: 1 |
| 32 | EE | Imre Csiszár:
On Iterative Algorithms with an Information Geometry Background.
Discovery Science 2008: 1 |
| 31 | EE | Imre Csiszár,
Prakash Narayan:
Secrecy Capacities for Multiterminal Channel Models.
IEEE Transactions on Information Theory 54(6): 2437-2452 (2008) |
| 2006 |
|---|
| 30 | EE | Imre Csiszár,
Z. Talata:
Context tree estimation for not necessarily finite memory processes, via BIC and MDL.
IEEE Transactions on Information Theory 52(3): 1007-1016 (2006) |
| 2004 |
|---|
| 29 | EE | Imre Csiszár,
Paul C. Shields:
Information Theory and Statistics: A Tutorial.
Foundations and Trends in Communications and Information Theory 1(4): (2004) |
| 28 | EE | Imre Csiszár,
Prakash Narayan:
Secrecy capacities for multiple terminals.
IEEE Transactions on Information Theory 50(12): 3047-3061 (2004) |
| 27 | | Imre Csiszár,
Frantisek Matús:
On information closures of exponential families: a counterexample.
IEEE Transactions on Information Theory 50(5): 922-924 (2004) |
| 2003 |
|---|
| 26 | | Imre Csiszár,
Frantisek Matús:
Information projections revisited.
IEEE Transactions on Information Theory 49(6): 1474-1490 (2003) |
| 25 | | Imre Csiszár:
A first course in information theory [Book Review].
IEEE Transactions on Information Theory 49(7): 1869-1869 (2003) |
| 2002 |
|---|
| 24 | | Imre Csiszár:
Large-scale typicality of Markov sample paths and consistency of MDL Order estimators.
IEEE Transactions on Information Theory 48(6): 1616-1628 (2002) |
| 2000 |
|---|
| 23 | | Imre Csiszár,
Prakash Narayan:
Common randomness and secret key generation with a helper.
IEEE Transactions on Information Theory 46(2): 344-366 (2000) |
| 1999 |
|---|
| 22 | | Imre Csiszár,
Fabrice Gamboa,
Elisabeth Gassiat:
MEM pixel correlated solutions for generalized moment and interpolation problems.
IEEE Transactions on Information Theory 45(7): 2253-2270 (1999) |
| 1998 |
|---|
| 21 | | Rudolf Ahlswede,
Imre Csiszár:
Common Randomness in Information Theory and Cryptography - Part II: CR Capacity.
IEEE Transactions on Information Theory 44(1): 225-240 (1998) |
| 20 | | Imre Csiszár:
The Method of Types.
IEEE Transactions on Information Theory 44(6): 2505-2523 (1998) |
| 1996 |
|---|
| 19 | | Imre Csiszár,
Paul C. Shields:
Redundancy rates for renewal and other processes.
IEEE Transactions on Information Theory 42(6): 2065-2072 (1996) |
| 1995 |
|---|
| 18 | | Imre Csiszár:
Generalized cutoff rates and Renyi's information measures.
IEEE Transactions on Information Theory 41(1): 26-34 (1995) |
| 17 | | Imre Csiszár,
Prakash Narayan:
Channel capacity for a given decoding metric.
IEEE Transactions on Information Theory 41(1): 35-43 (1995) |
| 16 | | Imre Csiszár:
Review of 'Universal Compression and Retrieval' (Krichevsky, R.; 1994).
IEEE Transactions on Information Theory 41(3): 862- (1995) |
| 1993 |
|---|
| 15 | | Rudolf Ahlswede,
Imre Csiszár:
Common randomness in information theory and cryptography - I: Secret sharing.
IEEE Transactions on Information Theory 39(4): 1121-1132 (1993) |
| 1992 |
|---|
| 14 | | Imre Csiszár:
Arbitrarily varying channels with general alphabets and states.
IEEE Transactions on Information Theory 38(6): 1725-1742 (1992) |
| 1990 |
|---|
| 13 | | Imre Csiszár,
János Körner,
László Lovász,
Katalin Marton,
Gábor Simonyi:
Entropy splitting for antiblocking corners and perfect graphs.
Combinatorica 10(1): 27-40 (1990) |
| 1989 |
|---|
| 12 | | Imre Csiszár,
Prakash Narayan:
Capacity and decoding rules for classes of arbitrarily varying channels.
IEEE Transactions on Information Theory 35(4): 752-769 (1989) |
| 1988 |
|---|
| 11 | | Imre Csiszár,
Prakash Narayan:
Arbitrarily varying channels with constrained inputs and states.
IEEE Transactions on Information Theory 34(1): 27-34 (1988) |
| 10 | | Imre Csiszár,
Prakash Narayan:
The capacity of the arbitrarily varying channel revisited: Positivity, constraints.
IEEE Transactions on Information Theory 34(2): 181-193 (1988) |
| 1987 |
|---|
| 9 | | Imre Csiszár,
Thomas M. Cover,
Byoung-Seon Choi:
Conditional limit theorems under Markov conditioning.
IEEE Transactions on Information Theory 33(6): 788-801 (1987) |
| 1986 |
|---|
| 8 | | Rudolf Ahlswede,
Imre Csiszár:
Hypothesis testing with communication constraints.
IEEE Transactions on Information Theory 32(4): 533-542 (1986) |
| 1982 |
|---|
| 7 | | Imre Csiszár,
János Körner:
Feedback does not affect the reliability function of a DMC at rates above capacity.
IEEE Transactions on Information Theory 28(1): 92- (1982) |
| 6 | | Imre Csiszár:
Linear codes for sources and source networks: Error exponents, universal coding.
IEEE Transactions on Information Theory 28(4): 585-592 (1982) |
| 5 | | Imre Csiszár:
On the error exponent of source-channel transmission with a distortion threshold.
IEEE Transactions on Information Theory 28(6): 823-827 (1982) |
| 1981 |
|---|
| 4 | | Imre Csiszár,
János Körner:
Graph decomposition: A new key to coding theorems.
IEEE Transactions on Information Theory 27(1): 5-11 (1981) |
| 3 | | Rudolf Ahlswede,
Imre Csiszár:
To get a bit of information may be as hard as to get full information.
IEEE Transactions on Information Theory 27(4): 398-408 (1981) |
| 1969 |
|---|
| 2 | | Imre Csiszár:
Simple Proofs of Some Theorems on Noiseless Channels
Information and Control 14(3): 285-298 (1969) |
| 1967 |
|---|
| 1 | | Imre Csiszár:
Two Remarks to Noiseless Coding
Information and Control 11(3): 317-322 (1967) |
