| 2009 |
|---|
| 127 | EE | Neri Merhav:
Physics of the Shannon Limits
CoRR abs/0903.1484: (2009) |
| 126 | EE | Erez Sabbag,
Neri Merhav:
Achievable Error Exponents for Channel with Side Information - Erasure and List Decoding
CoRR abs/0903.2203: (2009) |
| 125 | EE | Neri Merhav,
Marcelo J. Weinberger:
Universal Simulation With Fidelity Criteria.
IEEE Transactions on Information Theory 55(1): 292-302 (2009) |
| 124 | EE | Neri Merhav:
Relations Between Random Coding Exponents and the Statistical Physics of Random Codes.
IEEE Transactions on Information Theory 55(1): 83-92 (2009) |
| 123 | EE | Neri Merhav:
The Generalized Random Energy Model and its Application to the Statistical Physics of Ensembles of Hierarchical Codes.
IEEE Transactions on Information Theory 55(3): 1250-1268 (2009) |
| 122 | EE | Yaniv Akirav,
Neri Merhav:
Exact Characterization of the Minimax Loss in Error Exponents of Universal Decoders.
IEEE Transactions on Information Theory 55(4): 1440-1459 (2009) |
| 2008 |
|---|
| 121 | EE | Pedro Comesaña,
Neri Merhav,
Mauro Barni:
Asymptotically Optimum Universal One-Bit Watermarking for Gaussian Covertexts and Gaussian Attacks
CoRR abs/0803.3880: (2008) |
| 120 | EE | Raul Etkin,
Neri Merhav,
Erik Ordentlich:
Error Exponents of Optimum Decoding for the Interference Channel
CoRR abs/0810.1980: (2008) |
| 119 | EE | Neri Merhav:
Joint source-channel coding via statistical mechanics: thermal equilibrium between the source and the channel
CoRR abs/0810.2164: (2008) |
| 118 | EE | Neri Merhav:
On the statistical physics of directed polymers in a random medium and their relation to tree codes
CoRR abs/0812.2454: (2008) |
| 117 | EE | Alina Maor,
Neri Merhav:
On Successive Refinement for the Kaspi/Heegard-Berger Problem
CoRR abs/0812.3285: (2008) |
| 116 | EE | Neri Merhav,
Dongning Guo,
Shlomo Shamai:
Statistical Physics of Signal Estimation in Gaussian Noise: Theory and Examples of Phase Transitions
CoRR abs/0812.4889: (2008) |
| 115 | EE | Neri Merhav,
Erez Sabbag:
Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources.
IEEE Transactions on Information Theory 54(1): 255-274 (2008) |
| 114 | EE | Alina Maor,
Neri Merhav:
On Successive Refinement With Causal Side Information at the Decoders.
IEEE Transactions on Information Theory 54(1): 332-343 (2008) |
| 113 | EE | Neri Merhav:
Error Exponents of Erasure/List Decoding Revisited Via Moments of Distance Enumerators.
IEEE Transactions on Information Theory 54(10): 4439-4447 (2008) |
| 112 | EE | Anelia Somekh-Baruch,
Neri Merhav:
Correction to "On the Capacity Game of Private Fingerprinting Systems Under Collusion Attacks" [Mar 05 884-899].
IEEE Transactions on Information Theory 54(11): 5263-5264 (2008) |
| 111 | EE | Neri Merhav,
Gadiel Seroussi,
Marcelo J. Weinberger:
Universal Delay-Limited Simulation.
IEEE Transactions on Information Theory 54(12): 5525-5533 (2008) |
| 110 | EE | Asaf Cohen,
Tsachy Weissman,
Neri Merhav:
Scanning and Sequential Decision Making for Multidimensional Data - Part II: The Noisy Case.
IEEE Transactions on Information Theory 54(12): 5609-5631 (2008) |
| 109 | EE | Neri Merhav:
Shannon's Secrecy System With Informed Receivers and its Application to Systematic Coding for Wiretapped Channels.
IEEE Transactions on Information Theory 54(6): 2723-2734 (2008) |
| 108 | EE | Neri Merhav:
An Identity of Chernoff Bounds With an Interpretation in Statistical Physics and Applications in Information Theory.
IEEE Transactions on Information Theory 54(8): 3710-3721 (2008) |
| 2007 |
|---|
| 107 | EE | Mauro Barni,
Angela D'Angelo,
Neri Merhav:
Expanding the class of watermark de-synchronization attacks.
MM&Sec 2007: 195-204 |
| 106 | EE | Neri Merhav,
Erez Sabbag:
Optimal Watermark Embedding and Detection Strategies Under Limited Detection Resources
CoRR abs/0705.1919: (2007) |
| 105 | EE | Asaf Cohen,
Tsachy Weissman,
Neri Merhav:
Scanning and Sequential Decision Making for Multi-Dimensional Data - Part II: the Noisy Case
CoRR abs/0705.2854: (2007) |
| 104 | EE | Yaniv Akirav,
Neri Merhav:
Competitive minimax universal decoding for several ensembles of random codes
CoRR abs/0707.4507: (2007) |
| 103 | EE | Neri Merhav:
Relations between random coding exponents and the statistical physics of random codes
CoRR abs/0708.0850: (2007) |
| 102 | EE | Neri Merhav:
Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators
CoRR abs/0711.2501: (2007) |
| 101 | EE | Neri Merhav:
The Generalized Random Energy Model and its Application to the Statistical Physics of Ensembles of Hierarchical Codes
CoRR abs/0712.4209: (2007) |
| 100 | EE | Neri Merhav:
An identity of Chernoff bounds with an interpretation in statistical physics and applications in information theory
CoRR abs/cs/0702101: (2007) |
| 99 | EE | Guy Keshet,
Yossef Steinberg,
Neri Merhav:
Channel Coding in the Presence of Side Information.
Foundations and Trends in Communications and Information Theory 4(6): 445-586 (2007) |
| 98 | EE | Tsachy Weissman,
Erik Ordentlich,
Marcelo J. Weinberger,
Anelia Somekh-Baruch,
Neri Merhav:
Universal Filtering Via Prediction.
IEEE Transactions on Information Theory 53(4): 1253-1264 (2007) |
| 97 | EE | Neri Merhav,
Meir Feder:
Minimax Universal Decoding With an Erasure Option.
IEEE Transactions on Information Theory 53(5): 1664-1675 (2007) |
| 96 | EE | Anelia Somekh-Baruch,
Neri Merhav:
Achievable Error Exponents for the Private Fingerprinting Game.
IEEE Transactions on Information Theory 53(5): 1827-1838 (2007) |
| 95 | EE | Jacob Ziv,
Neri Merhav:
On Context-Tree Prediction of Individual Sequences.
IEEE Transactions on Information Theory 53(5): 1860-1866 (2007) |
| 94 | EE | Neri Merhav,
Shlomo Shamai:
Information Rates Subject to State Masking.
IEEE Transactions on Information Theory 53(6): 2254-2261 (2007) |
| 93 | EE | Asaf Cohen,
Neri Merhav,
Tsachy Weissman:
Scanning and Sequential Decision Making for Multidimensional Data-Part I: The Noiseless Case.
IEEE Transactions on Information Theory 53(9): 3001-3020 (2007) |
| 2006 |
|---|
| 92 | EE | Neri Merhav,
Meir Feder:
Universal decoding with an erasure option
CoRR abs/cs/0604069: (2006) |
| 91 | EE | Asaf Cohen,
Neri Merhav,
Tsachy Weissman:
Scanning and Sequential Decision Making for Multi-Dimensional Data - Part I: the Noiseless Case
CoRR abs/cs/0609049: (2006) |
| 90 | EE | Neri Merhav:
Shannon's secrecy system with informed receivers and its application to systematic coding for wiretapped channels
CoRR abs/cs/0611129: (2006) |
| 89 | EE | Neri Merhav:
On joint coding for watermarking and encryption.
IEEE Transactions on Information Theory 52(1): 190-205 (2006) |
| 88 | EE | Neri Merhav,
Erik Ordentlich:
On causal and semicausal codes for joint information embedding and source coding.
IEEE Transactions on Information Theory 52(1): 213-226 (2006) |
| 87 | EE | Neri Merhav:
On the shannon cipher system with a capacity-limited key-distribution channel.
IEEE Transactions on Information Theory 52(3): 1269-1273 (2006) |
| 86 | EE | Neri Merhav,
Jacob Ziv:
On the Wyner-Ziv problem for individual sequences.
IEEE Transactions on Information Theory 52(3): 867-873 (2006) |
| 85 | EE | Yossef Steinberg,
Neri Merhav:
On hierarchical joint source-channel coding with degraded side information.
IEEE Transactions on Information Theory 52(3): 886-903 (2006) |
| 84 | EE | Alina Maor,
Neri Merhav:
Two-way successively refined joint source-channel coding.
IEEE Transactions on Information Theory 52(4): 1483-1494 (2006) |
| 83 | EE | Neri Merhav,
Tsachy Weissman:
Coding for the Feedback Gel'fand-Pinsker Channel and the Feedforward Wyner-Ziv Source.
IEEE Transactions on Information Theory 52(9): 4207-4211 (2006) |
| 2005 |
|---|
| 82 | EE | Neri Merhav:
On Joint Coding for Watermarking and Encryption.
Information Hiding 2005: 1-10 |
| 81 | EE | Neri Merhav,
Jacob Ziv:
On the Wyner-Ziv problem for individual sequences
CoRR abs/cs/0505010: (2005) |
| 80 | EE | Neri Merhav:
On the Shannon cipher system with a capacity-limited key-distribution channel
CoRR abs/cs/0505012: (2005) |
| 79 | EE | Jacob Ziv,
Neri Merhav:
On context-tree prediction of individual sequences
CoRR abs/cs/0508127: (2005) |
| 78 | EE | Neri Merhav,
Tsachy Weissman:
Coding for the feedback Gel'fand-Pinsker channel and the feedforward Wyner-Ziv source
CoRR abs/cs/0509039: (2005) |
| 77 | EE | Neri Merhav:
On joint coding for watermarking and encryption
CoRR abs/cs/0509064: (2005) |
| 76 | EE | I. Hen,
Neri Merhav:
On the error exponent of trellis source coding.
IEEE Transactions on Information Theory 51(11): 3734-3741 (2005) |
| 75 | EE | Tsachy Weissman,
Neri Merhav:
On causal source codes with side information.
IEEE Transactions on Information Theory 51(11): 4003-4013 (2005) |
| 74 | EE | Anelia Somekh-Baruch,
Neri Merhav:
On the capacity game of private fingerprinting systems under collusion attacks.
IEEE Transactions on Information Theory 51(3): 884-899 (2005) |
| 73 | EE | Alina Maor,
Neri Merhav:
On joint information embedding and lossy compression.
IEEE Transactions on Information Theory 51(8): 2998-3008 (2005) |
| 72 | EE | Alina Maor,
Neri Merhav:
On Joint Information Embedding and Lossy Compression in the Presence of a Stationary Memoryless Attack Channel.
IEEE Transactions on Information Theory 51(9): 3166-3175 (2005) |
| 71 | EE | Neri Merhav,
Marcelo J. Weinberger:
Addendum to "On Universal Simulation of Information Sources Using Training Data.
IEEE Transactions on Information Theory 51(9): 3381-3383 (2005) |
| 70 | EE | Yonina C. Eldar,
Neri Merhav:
Minimax MSE-ratio estimation with signal covariance uncertainties.
IEEE Transactions on Signal Processing 53(4): 1335-1347 (2005) |
| 2004 |
|---|
| 69 | EE | Erik Ordentlich,
Tsachy Weissman,
Marcelo J. Weinberger,
Anelia Somekh-Baruch,
Neri Merhav:
Discrete Universal Filtering Through Incremental Parsing.
Data Compression Conference 2004: 352-361 |
| 68 | | Anelia Somekh-Baruch,
Neri Merhav:
On the capacity game of public watermarking systems.
IEEE Transactions on Information Theory 20(3): 511-524 (2004) |
| 67 | | Neri Merhav:
Achievable key rates for universal simulation of random data with respect to a set of statistical tests.
IEEE Transactions on Information Theory 50(1): 21-30 (2004) |
| 66 | | Neri Merhav,
Marcelo J. Weinberger:
On universal simulation of information sources using training data.
IEEE Transactions on Information Theory 50(1): 5-20 (2004) |
| 65 | | I. Hen,
Neri Merhav:
On the Threshold Effect in the Estimation of Chaotic Sequences.
IEEE Transactions on Information Theory 50(11): 2894-2904 (2004) |
| 64 | | Asaf Cohen,
Neri Merhav:
Lower bounds on the error probability of block codes based on improvements on de Caen's inequality.
IEEE Transactions on Information Theory 50(2): 290-310 (2004) |
| 63 | | Yossef Steinberg,
Neri Merhav:
On Successive Refinement for the Wyner-Ziv Problem.
IEEE Transactions on Information Theory 50(8): 1636-1654 (2004) |
| 2003 |
|---|
| 62 | | Neri Merhav,
Tsachy Weissman:
Scanning and prediction in multidimensional data arrays.
IEEE Transactions on Information Theory 49(1): 65-82 (2003) |
| 61 | | Neri Merhav,
Shlomo Shamai:
On joint source-channel coding for the Wyner-Ziv source and the Gel'fand-Pinsker channel.
IEEE Transactions on Information Theory 49(11): 2844-2855 (2003) |
| 60 | | Tsachy Weissman,
Neri Merhav:
On competitive prediction and its relation to rate-distortion theory.
IEEE Transactions on Information Theory 49(12): 3185-3194 (2003) |
| 59 | | Neri Merhav:
A large-deviations notion of perfect secrecy.
IEEE Transactions on Information Theory 49(2): 506-508 (2003) |
| 58 | | Anelia Somekh-Baruch,
Neri Merhav:
On the error exponent and capacity games of private watermarking systems.
IEEE Transactions on Information Theory 49(3): 537-562 (2003) |
| 57 | | Neri Merhav,
Ioannis Kontoyiannis:
Source coding exponents for zero-delay coding with finite memory.
IEEE Transactions on Information Theory 49(3): 609-625 (2003) |
| 2002 |
|---|
| 56 | | Tsachy Weissman,
Neri Merhav:
Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding.
IEEE Transactions on Information Theory 48(2): 396-415 (2002) |
| 55 | | Tsachy Weissman,
Neri Merhav:
On limited-delay lossy coding and filtering of individual sequences.
IEEE Transactions on Information Theory 48(3): 721-733 (2002) |
| 54 | | Meir Feder,
Neri Merhav:
Universal composite hypothesis testing: A competitive minimax approach.
IEEE Transactions on Information Theory 48(6): 1504-1517 (2002) |
| 53 | | Yariv Ephraim,
Neri Merhav:
Hidden Markov processes.
IEEE Transactions on Information Theory 48(6): 1518-1569 (2002) |
| 52 | | Neri Merhav,
Erik Ordentlich,
Gadiel Seroussi,
Marcelo J. Weinberger:
On sequential strategies for loss functions with memory.
IEEE Transactions on Information Theory 48(7): 1947-1958 (2002) |
| 51 | | Evgeny Levitan,
Neri Merhav:
A competitive Neyman-Pearson approach to universal hypothesis testing with applications.
IEEE Transactions on Information Theory 48(8): 2215-2229 (2002) |
| 2001 |
|---|
| 50 | | Yossef Steinberg,
Neri Merhav:
Identification in the presence of side information with application to watermarking.
IEEE Transactions on Information Theory 47(4): 1410-1422 (2001) |
| 49 | | Tsachy Weissman,
Neri Merhav,
Anelia Somekh-Baruch:
Twofold universal prediction schemes for achieving the finite-state predictability of a noisy individual binary sequence.
IEEE Transactions on Information Theory 47(5): 1849-1866 (2001) |
| 48 | | Tsachy Weissman,
Neri Merhav:
Universal prediction of individual binary sequences in the presence of noise.
IEEE Transactions on Information Theory 47(6): 2151-2173 (2001) |
| 2000 |
|---|
| 47 | | Neri Merhav,
Gadiel Seroussi,
Marcelo J. Weinberger:
Optimal prefix codes for sources with two-sided geometric distributions.
IEEE Transactions on Information Theory 46(1): 121-135 (2000) |
| 46 | | Neri Merhav,
Gadiel Seroussi,
Marcelo J. Weinberger:
Coding of sources with two-sided geometric distributions and unknown parameters.
IEEE Transactions on Information Theory 46(1): 229-236 (2000) |
| 45 | | Neri Merhav:
On random coding error exponents of watermarking systems.
IEEE Transactions on Information Theory 46(2): 420-430 (2000) |
| 44 | | Neri Merhav:
Universal detection of messages via finite-state channels.
IEEE Transactions on Information Theory 46(6): 2242-2246 (2000) |
| 1999 |
|---|
| 43 | EE | Tsachy Weissman,
Neri Merhav:
On Prediction of Individual Sequences Relative to a Set of Experts in the Presence of Noise.
COLT 1999: 19-28 |
| 42 | | Neri Merhav,
Bhaskaran Vasudev:
A Multiplication-Free Approximate Algorithm for the Inverse Discrete Cosine Transform.
ICIP (2) 1999: 759-763 |
| 41 | EE | Neri Merhav:
Multiplication-free approximate algorithms for compressed-domain linear operations on images.
IEEE Transactions on Image Processing 8(2): 247-254 (1999) |
| 40 | EE | Renato Kresch,
Neri Merhav:
Fast DCT domain filtering using the DCT and the DST.
IEEE Transactions on Image Processing 8(6): 821-833 (1999) |
| 39 | | Neri Merhav,
Ron M. Roth,
Erdal Arikan:
Hierarchical Guessing with a Fidelity Criterion.
IEEE Transactions on Information Theory 45(1): 330-337 (1999) |
| 38 | | Gil I. Shamir,
Neri Merhav:
Low-complexity sequential lossless coding for piecewise-stationary memoryless sources.
IEEE Transactions on Information Theory 45(5): 1498-1519 (1999) |
| 37 | | Neri Merhav,
Erdal Arikan:
The Shannon cipher system with a guessing wiretapper.
IEEE Transactions on Information Theory 45(6): 1860-1866 (1999) |
| 1998 |
|---|
| 36 | | Erdal Arikan,
Neri Merhav:
Guessing Subject to Distortion.
IEEE Transactions on Information Theory 44(3): 1041-1056 (1998) |
| 35 | | Erdal Arikan,
Neri Merhav:
Joint Source-Channel Coding and Guessing with Application to Sequential Decoding.
IEEE Transactions on Information Theory 44(5): 1756-1769 (1998) |
| 34 | | Neri Merhav,
Meir Feder:
Universal Prediction.
IEEE Transactions on Information Theory 44(6): 2124-2147 (1998) |
| 1997 |
|---|
| 33 | | Neri Merhav:
On list size exponents in rate-distortion coding.
IEEE Transactions on Information Theory 43(2): 765-769 (1997) |
| 32 | | Neri Merhav,
Jacob Ziv:
On the amount of statistical side information required for lossy data compression.
IEEE Transactions on Information Theory 43(4): 1112-1121 (1997) |
| 31 | | Neri Merhav:
How many information bits does a decoder need about the channel statistics?
IEEE Transactions on Information Theory 43(5): 1707-1714 (1997) |
| 1996 |
|---|
| 30 | | Meir Feder,
Neri Merhav:
Hierarchical universal coding.
IEEE Transactions on Information Theory 42(5): 1354-1364 (1996) |
| 29 | | J. Stein,
Jacob Ziv,
Neri Merhav:
Universal delay estimation for discrete channels.
IEEE Transactions on Information Theory 42(6): 2085-2093 (1996) |
| 1995 |
|---|
| 28 | | Meir Feder,
Neri Merhav:
Universal Coding for Arbitrarily Varying Sources and for Hierarchies of Model Classes.
Data Compression Conference 1995: 82-91 |
| 27 | | Neri Merhav,
Meir Feder:
A strong version of the redundancy-capacity theorem of universal coding.
IEEE Transactions on Information Theory 41(3): 714-722 (1995) |
| 26 | | Neri Merhav:
A comment on 'A rate of convergence result for a universal D-semifaithful code'.
IEEE Transactions on Information Theory 41(4): 1200-1202 (1995) |
| 25 | | Ronny Meir,
Neri Merhav:
On the Stochastic Complexity of Learning Realizable and Unrealizable Rules.
Machine Learning 19(3): 241-261 (1995) |
| 1994 |
|---|
| 24 | | Neri Merhav,
Meir Feder:
The Minimax Redundancy is a Lower Bound for Most Sources.
Data Compression Conference 1994: 52-61 |
| 23 | | Meir Feder,
Neri Merhav:
Relations between entropy and error probability.
IEEE Transactions on Information Theory 40(1): 259- (1994) |
| 22 | | Meir Feder,
Neri Merhav,
Michael Gutman:
Correction to 'Universal prediction of individual sequences' (Jul 92 1258-1270).
IEEE Transactions on Information Theory 40(1): 285 (1994) |
| 21 | | Marcelo J. Weinberger,
Neri Merhav,
Meir Feder:
Optimal sequential probability assignment for individual sequences.
IEEE Transactions on Information Theory 40(2): 384-396 (1994) |
| 20 | | Neri Merhav:
Bounds on achievable convergence rates of parameter estimators via universal coding.
IEEE Transactions on Information Theory 40(4): 1210- (1994) |
| 19 | | Neri Merhav,
Gideon Kaplan,
Amos Lapidoth,
Shlomo Shamai:
On information rates for mismatched decoders.
IEEE Transactions on Information Theory 40(6): 1953-1967 (1994) |
| 1993 |
|---|
| 18 | | Neri Merhav,
Meir Feder,
Michael Gutman:
Some properties of sequential predictors for binary Markov sources.
IEEE Transactions on Information Theory 39(3): 887-892 (1993) |
| 17 | | Neri Merhav:
Universal decoding for memoryless Gaussian channels with a deterministic interference.
IEEE Transactions on Information Theory 39(4): 1261-1269 (1993) |
| 16 | | Jacob Ziv,
Neri Merhav:
A measure of relative entropy between individual sequences with application to universal classification.
IEEE Transactions on Information Theory 39(4): 1270-1279 (1993) |
| 15 | | Neri Merhav,
Meir Feder:
Universal schemes for sequential decision from individual data sequences.
IEEE Transactions on Information Theory 39(4): 1280-1292 (1993) |
| 14 | | Neri Merhav:
On the minimum description length principle for sources with piecewise constant parameters.
IEEE Transactions on Information Theory 39(6): 1962- (1993) |
| 1992 |
|---|
| 13 | EE | Neri Merhav,
Meir Feder:
Universal Sequential Learning and Decision from Individual Data Sequences.
COLT 1992: 413-427 |
| 12 | | Neri Merhav,
David L. Neuhoff:
Variable-to-fixed length codes provide better large deviations performance than fixed-to-variable length codes.
IEEE Transactions on Information Theory 38(1): 135- (1992) |
| 11 | | Jacob Ziv,
Neri Merhav:
Estimating the number of states of a finite-state source.
IEEE Transactions on Information Theory 38(1): 61-65 (1992) |
| 10 | | Meir Feder,
Neri Merhav,
Michael Gutman:
Universal prediction of individual sequences.
IEEE Transactions on Information Theory 38(4): 1258-1270 (1992) |
| 9 | | Ofer Zeitouni,
Jacob Ziv,
Neri Merhav:
When is the generalized likelihood ratio test optimal?
IEEE Transactions on Information Theory 38(5): 1597- (1992) |
| 8 | | Yariv Ephraim,
Neri Merhav:
Lower and upper bounds on the minimum mean-square error in composite source signal estimation.
IEEE Transactions on Information Theory 38(6): 1709-1724 (1992) |
| 1991 |
|---|
| 7 | | Neri Merhav:
Universal coding with minimum probability of codeword length overflow.
IEEE Transactions on Information Theory 37(3): 556-563 (1991) |
| 6 | | Neri Merhav,
Jacob Ziv:
A Bayesian approach for classification of Markov sources.
IEEE Transactions on Information Theory 37(4): 1067-1071 (1991) |
| 5 | | Neri Merhav:
Universal classification for hidden Markov models.
IEEE Transactions on Information Theory 37(6): 1586-1594 (1991) |
| 1990 |
|---|
| 4 | | Neri Merhav,
Jacob Ziv:
On universally efficient estimation of the first order autoregressive parameter and universal data compression.
IEEE Transactions on Information Theory 36(6): 1245-1254 (1990) |
| 1989 |
|---|
| 3 | | Neri Merhav,
Jacob Ziv:
Estimating with partial statistics the parameters of ergodic finite Markov sources.
IEEE Transactions on Information Theory 35(2): 326-333 (1989) |
| 2 | | Neri Merhav,
Michael Gutman,
Jacob Ziv:
On the estimation of the order of a Markov chain and universal data compression.
IEEE Transactions on Information Theory 35(5): 1014-1019 (1989) |
| 1 | | Neri Merhav:
The estimation of the model order in exponential families.
IEEE Transactions on Information Theory 35(5): 1109- (1989) |
