Fang-Wei Fu, Raymond W. Yeung On the capacity and error-correcting codes of write-efficient memories. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2299-2314 [Journal]
Mario Blaum, Jehoshua Bruck Coding for tolerance and detection of skew in parallel asynchronous communications. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2329-2335 [Journal]
Fred Daneshgaran, Marina Mondin Permutation fixed points with application to estimation of minimum distance of turbo codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2336-2349 [Journal]
Ryoh Fuji-Hara, Ying Miao Optical orthogonal codes: Their bounds and new optimal constructions. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2396-2406 [Journal]
Marat V. Burnashev On identification capacity of infinite alphabets or continuous-time channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2407-2414 [Journal]
Te Sun Han Hypothesis testing with the general source. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2415-2427 [Journal]
Wojciech Szpankowski Asymptotic average redundancy of Huffman (and other) block codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2434-2443 [Journal]
Gil I. Shamir, Daniel J. Costello Jr. Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources - Part 1: The regular case. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2444-2467 [Journal]
András Méhes, Kenneth Zeger Performance of quantizers on noisy channels using structured families of codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2468-2476 [Journal]
Teng Joon Lim, Yao Ma The Kalman Filter as the optimal linear minimum mean-squared error multiuser CDMA detector. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2561-2566 [Journal]
Brian L. Hughes Differential Space-Time modulation. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2567-2578 [Journal]
Mathias Friese On the achievable information rate with peak-power-limited orthogonal frequency-division multiplexing. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2579-2587 [Journal]
Carles Padró, Germán Sáez Secret sharing schemes with bipartite access structure. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2596-2604 [Journal]
Daniel Augot, Lancelot Pecquet A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2605-2614 [Journal]
Agnes E. Heydtmann, Jørn M. Jensen On the equivalence of the Berlekamp-Massey and the euclidean algorithms for decoding. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2614-2624 [Journal]
Dian-Wu Yue, Guang-Zeng Feng Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa Codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2625-2628 [Journal]
Thierry P. Berger Goppa and related codes invariant under a prescribed permutation. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2628-2633 [Journal]
Akiko Kato, Kenneth Zeger Partial characterization of the positive capacity region of two-dimensional asymmetric run length constrained channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2666-2670 [Journal]
Olgica Milenkovic, Bane V. Vasic Permutation (d, k) codes: Efficient enumerative coding and phrase length distribution shaping. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2671-2675 [Journal]
Lei Li, Bin Yu Iterated logarithmic expansions of the pathwise code lengths for exponential families. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2683-2689 [Journal]
András György, Tamás Linder Optimal entropy-constrained scalar quantization of a uniform source. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2704-2711 [Journal]
Bernard C. Picinbono Moments and polyspectra of the discrete-time random telegraph signal. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2735-2739 [Journal]
Igor V. Nikiforov A simple recursive algorithm for diagnosis of abrupt changes in random signals. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2740-2746 [Journal]
Eric Bax Validation of nearest neighbor classifiers. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2746-2752 [Journal]
Po-Ning Chen Generalization of Gártner-Ellis Theorem. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2752-2760 [Journal]
Weiwei Sun Lower bounds of the minimal eigenvalue of a Hermitian positive-definite matrix. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2760-2762 [Journal]
Xiao Ma, Xiao-Yi Zhang Correction to "Entropy bounds for constrained two-dimensional random fields". [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2763- [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP