Journal: IEEE Transactions on Information Theory

Volume 49, Issue 11

2809 -- 2825Ralf Koetter, Alexander Vardy. Algebraic soft-decision decoding of Reed-Solomon codes
2826 -- 2833Venkatesan Guruswami. List decoding from erasures: bounds and code constructions
2834 -- 2843Joaquim Borges, Kevin T. Phelps, Josep Rifà, Victor A. Zinoviev. On Z::4::-linear Preparata-like and Kerdock-like code
2844 -- 2855Neri Merhav, Shlomo Shamai. On joint source-channel coding for the Wyner-Ziv source and the Gel fand-Pinsker channel
2856 -- 2873Prashant Koulgi, Ertem Tuncel, Shankar L. Regunathan, Kenneth Rose. On zero-error coding of correlated sources
2874 -- 2894En-Hui Yang, Da-ke He. Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform .2. With context models
2895 -- 2909Nihar Jindal, Andrea J. Goldsmith. Capacity and optimal power allocation for fading broadcast channels with minimum rates
2910 -- 2917Tryphon T. Georgiou, Anders Lindquist. Kullback-Leibler approximation of spectral density functions
2918 -- 2940Remco van der Hofstad, Marten J. Klok. Performance of DS-CDMA systems with optimal hard-decision parallel interference cancellation
2941 -- 2952Elias Masry. Deconvolving multivariate kernel density estimates from contaminated associated observations
2953 -- 2959Chan Vee Chong, Raman Venkataramani, Vahid Tarokh. A new construction of 16-QAM Golay complementary sequences
2960 -- 2971Chieh-Fu Chang, Mark R. Bell. Frequency-coded waveforms for enhanced delay-Doppler resolution
2972 -- 2975G. Arico, Jos H. Weber. Limited-trial Chase decoding
2975 -- 2984Victor Yu. Krachkovsky. Reed-Solomon codes for correcting phased error bursts
2984 -- 2988Xue-Bin Liang, Xiang-Gen Xia. On the nonexistence of rate-one generalized complex orthogonal designs
2989 -- 2992G. Miller, G. Cohen. The rate of regular LDPC codes
2993 -- 3000Frédéric Lehmann, Gian Mario Maggio. Analysis of the iterative decoding of LDPC and product codes using the Gaussian approximation
3001 -- 3005. New binary one-generator quasi-cyclic codes
3005 -- 3009Jean-Claude Carlach, Ayoub Otmani. A systematic construction of self-dual codes
3010 -- 3016Luo Yuan, Fang-Wei Fu, A. J. Han Vinck, Wende Chen. On constant-composition codes over Z::q::
3016 -- 3019Thierry P. Berger. Isometries for rank distance and permutation group of Gabidulin codes
3020 -- 3030Amir Dembo, Tsachy Weissman. The minimax distortion redundancy in noisy source coding
3031 -- 3037András György, Tamás Linder, Philip A. Chou, Bradley J. Betts. Do optimal entropy-constrained quantizers have a finite or infinite number of codewords?
3037 -- 3047Igor V. Nikiforov. A lower bound for the detection/isolation delay in a class of sequential tests
3047 -- 3059Nicholas Kolokotronis, Nicholas Kalouptsidis. On the linear complexity of nonlinearly filtered PN-sequences
3059 -- 3065Sang-Hyo Kim, Jong-Seon No. New families of binary sequences with low correlation
3066 -- 3071Keqin Feng, Fengmei Liu. New results on the nonexistence of generalized bent functions
3072 -- 3076Wensong Chu, Solomon W. Golomb. A new recursive construction for optical orthogonal codes
3076 -- 3093Shraga I. Bross, Shlomo Shamai. Capacity and decoding rules for the Poisson arbitrarily varying chann
3094 -- 3098William S. Evans, Leonard J. Schulman. On the maximum tolerable noise of k-input gates for reliable computation by formulas
3099 -- 3106Olivier Alata, Mohamed Najim, Clarisse Ramananjarasoa, F. Turcu. Extension of the Schur-Cohn stability test for 2-D AR quarter-plane model
3106 -- 3115Erdal Panayirci. Analysis of self-noise in a clock recovery system with a high-order nonlinearity
3117 -- 0P. R. Kumar. A correction to the proof of a lemma in The capacity of wireless networks