Volume 51, Number 1, January 2005

• 
  2004 IEEE Information Theory Society Paper Award. 2-3
• 
  2004 IEEE Communications Society and Information Theory Society Joint Paper Award. 4
• 
  Tsachy Weissman, Erik Ordentlich, Gadiel Seroussi, Sergio Verdú, Marcelo J. Weinberger: Universal discrete denoising: known channel. 5-28
• 
  Bo Wang, Junshan Zhang, Anders Høst-Madsen: On the capacity of MIMO relay channels. 29-43
• 
  Igor Devetak: The private classical capacity and quantum capacity of a quantum channel. 44-55
• 
  Charles H. Bennett, Patrick M. Hayden, Debbie W. Leung, Peter W. Shor, Andreas J. Winter: Remote preparation of quantum states. 56-74
• 
  Xiaoming Sun, Runyao Duan, Mingsheng Ying: The existence of quantum entanglement catalysts. 75-80
• 
  Minyue Fu: Stochastic analysis of turbo decoding. 81-100
• 
  Jing Sun, Oscar Y. Takeshita: Interleavers for turbo codes using permutation polynomials over integer rings. 101-119
• 
  Michael Luby, Michael Mitzenmacher: Verification-based decoding for packet-based low-density parity-check codes. 120-127
• 
  Ingo Steinwart: Consistency of support vector machines and other regularized kernel classifiers. 128-142
• 
  James A. Bucklew: Conditional importance sampling estimators. 143-153
• 
  Jian-Kang Zhang, Aleksandar Kavcic, Kon Max Wong: Equal-diagonal QR decomposition and its application to precoder design for successive-cancellation detection. 154-172
• 
  Tommy Guess, Mahesh K. Varanasi: An information-theoretic framework for deriving canonical decision-feedback receivers in Gaussian channels. 173-187
• 
  Joel A. Tropp, Inderjit S. Dhillon, Robert W. Heath Jr., Thomas Strohmer: Designing structured tight frames via an alternating projection method. 188-209
• 
  Christoforos N. Hadjicostis, George C. Verghese: Coding approaches to fault tolerance in linear dynamic systems. 210-228
• 
  Weifeng Su, Zoltan Safar, K. J. Ray Liu: Full-rate full-diversity space-frequency codes with optimum coding advantage. 229-249
• 
  Alexei E. Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn: Bounds on distance distributions in codes of known size. 250-258
• 
  Chaoping Xing: Goppa geometric codes achieving the Gilbert-Varshamov bound. 259-264
• 
  Nissim Halabi, Guy Even: Improved bounds on the word error probability of RA(2) codes with linear-programming-based decoding. 265-280
• 
  D. J. Katz: p-Adic valuation of weights in Abelian codes over /spl Zopf/(p/sup d/). 281-305
• 
  Peter J. Schreier, Louis L. Scharf, Clifford T. Mullis: Detection and estimation of improper complex random signals. 306-312
• 
  Igor Vajda, Edward C. van der Meulen: On minimum divergence adaptation of discrete bivariate distributions to given marginals. 313-320
• 
  Garry Bowen, Rajagopal Nagarajan: On feedback and the classical capacity of a noisy quantum channel. 320-324
• 
  Ming-Yang Chen, Hua-Chieh Li, Soo-Chang Pei: Algebraic identification for optimal nonorthogonality 4/spl times/4 complex space-time block codes using tensor product on quaternions. 324-330
• 
  Mohammad Gharavi-Alkhansari, Alex B. Gershman: Constellation space invariance of orthogonal space-time block codes. 331-334
• 
  Sharon Koubi, Mannque Mata-Montero, Nabil Shalaby: Using directed hill-climbing for the construction of difference triangle sets. 335-339
• 
  Kishan Chand Gupta, Palash Sarkar: Improved construction of nonlinear resilient S-boxes. 339-348
• 
  George N. Karystinos, Dimitrios A. Pados: The maximum squared correlation, sum capacity, and total asymptotic efficiency of minimum total-squared-correlation binary signature sets. 348-355
• 
  Haibin Kan, Hong Shen: A counterexample for the open problem on the minimal delays of orthogonal designs with maximal rates. 355-359
• 
  Jen-Chun Chang: Distance-increasing mappings from binary vectors to permutations. 359-363
• 
  Alexander Sokolovsky, Shraga I. Bross: Attainable error exponents for the Poisson broadcast channel with degraded message sets. 364-374
• 
  Holger Boche, Slawomir Stanczak: Log-convexity of the minimum total power in CDMA systems with certain quality-of-service guaranteed. 374-381
• 
  Wenye Yang, Jerry D. Gibson, Tao He: Coefficient rate and lossy source coding. 381-386
• 
  Xiao-Yu Hu, Evangelos Eleftheriou, Dieter-Michael Arnold: Regular and irregular progressive edge-growth tanner graphs. 386-398
• 
  Todd K. Moon, Jacob H. Gunther: On the equivalence of two Welch-Berlekamp key equations and their error evaluators. 399-401
• 
  Philippe Gaborit, Carmen-Simona Nedeloaia, Alfred Wassermann: On the weight enumerators of duadic and quadratic residue codes. 402-407
• 
  Marten van Dijk, Sebastian Egner, Marcus Greferath, Alfred Wassermann: On two doubly even self-dual binary codes of length 160 and minimum weight 24. 408-411
• 
  Marc Andre Armand: List decoding of generalized Reed-Solomon codes over commutative rings. 411-419
• 
  Les Reid, Cameron Wickham: An elementary construction of codes from the groups of units of residue rings of polynomials. 419-420
• 
  Yonina C. Eldar, Albert M. Chan: Correction to "On the Asymptotic Performance of the Decorrelator" and "An Optimal Whitening Approach to Linear Multiuser Detection". 421-
• 
  Compression and Coding Algorithms. 422-

Volume 51, Number 2, February 2005

• 
  Amos Lapidoth: On the asymptotic capacity of stationary Gaussian fading channels. 437-446
• 
  Aaron B. Wagner, Venkat Anantharam: Zero-rate reliability of the exponential-server timing channel. 447-465
• 
  Ioannis Kontoyiannis, Peter Harremoës, Oliver Johnson: Entropy and the law of small numbers. 466-472
• 
  Erwin Lutwak, Deane Yang, Gaoyong Zhang: Crame/spl acute/r-Rao and moment-entropy inequalities for Renyi entropy and generalized Fisher information. 473-478
• 
  Antonia Maria Tulino, Linbo Li, Sergio Verdú: Spectral efficiency of multicarrier CDMA. 479-505
• 
  Masoud Sharif, Babak Hassibi: On the capacity of MIMO broadcast channels with partial side information. 506-522
• 
  Ada S. Y. Poon, Robert W. Brodersen, David N. C. Tse: Degrees of freedom in multiple-antenna channels: a signal space approach. 523-536
• 
  Srihari Adireddy, Lang Tong: Exploiting decentralized channel state information for random access. 537-561
• 
  Claude Carlet, Pascale Charpin: Cubic Boolean functions with highest resiliency. 562-571
• 
  Heng Tang, Jun Xu, Shu Lin, Khaled A. S. Abdel-Ghaffar: Codes on finite geometries. 572-596
• 
  Anxiao Jiang, Jehoshua Bruck: Multicluster interleaving on paths and cycles. 597-611
• 
  Ingmar Land, Simon Huettinger, Peter A. Hoeher, Johannes B. Huber: Bounds on information combining. 612-619
• 
  Susan G. Barwick, Wen-Ai Jackson, Keith M. Martin: Updating the parameters of a threshold scheme by minimal broadcast. 620-633
• 
  Hans R. Künsch, Erik Agrell, Fred A. Hamprecht: Optimal lattices for sampling. 634-647
• 
  Wen Chen, Bin Han, Rong-Qing Jia: On simple oversampled A/D conversion in shift-invariant spaces. 648-657
• 
  Servane Gey, Elodie Nédélec: Model selection for CART regression trees. 658-670
• 
  Hanying Feng, Michelle Effros: On the rate loss of multiple description source codes. 671-683
• 
  Nicholas Pippenger: The average amount of information lost in multiplication. 684-687
• 
  Enrique Figueroa-Lopez, Christian Houdré: On the asymptotic redundancy of lossless block coding with two codeword lengths. 688-692
• 
  Biao Chen, Peter K. Willett: On the optimality of the likelihood-ratio test for local sensor decision rules in the presence of nonideal channels. 693-699
• 
  Toshiyuki Tanaka, Masato Okada: Approximate belief propagation, density evolution, and statistical neurodynamics for CDMA multiuser detection. 700-706
• 
  Michael J. Neely, Eytan Modiano: Convexity in queues with general inputs. 706-714
• 
  Hiren Maharaj: Explicit constructions of algebraic-geometric codes. 714-722
• 
  Dan Raphaeli: The burst error correcting capabilities of a simple array code. 722-728
• 
  Marc Andre Armand: Improved list decoding of generalized Reed-Solomon and alternant codes over Galois rings. 728-733
• 
  Jacques Wolfmann: Are 2-weight projective cyclic codes irreducible? 733-737
• 
  Turaj Zakizadeh Shabestary, Per Hedelin: Vector quantization by companding a union of Z-lattices. 738-746
• 
  Te Sun Han: Folklore in source coding: information-spectrum approach. 747-753
• 
  Hiroki Suyari, Makoto Tsukada: Law of error in Tsallis statistics. 753-757

Volume 51, Number 3, March 2005

• 
  Michael Gastpar, Martin Vetterli: On the capacity of large Gaussian relay networks. 765-779
• 
  Jun Chen, Toby Berger: The capacity of finite-State Markov Channels With feedback. 780-798
• 
  Shaohua Yang, Aleksandar Kavcic, Sekhar Tatikonda: Feedback capacity of finite-state machine channels. 799-810
• 
  Shraga I. Bross, Amos Lapidoth: An improved achievable region for the discrete memoryless two-user multiple-access channel with noiseless feedback. 811-833
• 
  Feng Xue, Liang-Liang Xie, Panganamala R. Kumar: The transport capacity of wireless networks over fading channels. 834-847
• 
  Syed Ali Jafar, Andrea J. Goldsmith: Isotropic fading vector broadcast Channels: The scalar upper bound and loss in degrees of freedom. 848-857
• 
  Olivier Lévêque, Ì. Emre Telatar: Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks. 858-865
• 
  Rza Nuriyev, Achilleas Anastasopoulos: Capacity and coding for the block-independent noncoherent AWGN channel. 866-883
• 
  Anelia Somekh-Baruch, Neri Merhav: On the capacity game of private fingerprinting systems under collusion attacks. 884-899
• 
  I-Chung Lee, Cheng-Shang Chang, Ching-Ming Lien: On the throughput of multicasting with incremental forward error correction. 900-918
• 
  Simon Litsyn, Alexander Yudin: Discrete and continuous maxima in multicarrier communication. 919-928
• 
  Alon Orlitsky, Krishnamurthy Viswanathan, Junan Zhang: Stopping set distribution of LDPC code ensembles. 929-953
• 
  Jon Feldman, Martin J. Wainwright, David R. Karger: Using linear programming to Decode Binary linear codes. 954-972
• 
  Aleksandar Kavcic, Xiao Ma, Nedeljko Varnica: Matched information rate codes for Partial response channels. 973-989
• 
  Takeshi Hashimoto: Bounds on a probability for the heavy tailed distribution and the probability of deficient decoding in sequential decoding. 990-1002
• 
  Adam Krzyzak, Dominik Schäfer: Nonparametric regression estimation by normalized radial basis function networks. 1003-1010
• 
  Jun-ichi Takeuchi, Shun-ichi Amari: /spl alpha/-parallel prior and its properties. 1011-1023
• 
  Junshan Zhang, Takis Konstantopoulos: Multiple-access interference processes are self-similar in multimedia CDMA cellular networks. 1024-1038
• 
  Peter F. Craigmile, Donald B. Percival: Asymptotic decorrelation of between-Scale Wavelet coefficients. 1039-1048
• 
  Chun-Liang Tu, Wen-Liang Hwang, Jinn Ho: Analysis of singularities from modulus maxima of complex wavelets. 1049-1062
• 
  Pierre Chainais, Rudolf H. Riedi, Patrice Abry: On non-scale-invariant infinitely divisible cascades. 1063-1083
• 
  Andreas Klappenecker, Martin Rötteler: On the monomiality of nice error bases. 1084-1089
• 
  Yuan Feng, Runyao Duan, Mingsheng Ying: Catalyst-assisted probabilistic entanglement transformation. 1090-1101
• 
  Genyuan Wang, Xiang-Gen Xia: On optimal multilayer cyclotomic space-time code designs. 1102-1135
• 
  Frederik Vanhaverbeke, Marc Moeneclaey: Optimal signature sets for oversaturated quasi-scalable direct-sequence spread-spectrum systems. 1136-1139
• 
  Wensong Chu, Charles J. Colbourn: Optimal frequency-hopping sequences via cyclotomy. 1139-1141
• 
  Ying Li, Wen Bin Chu: More Golay sequences. 1141-1145
• 
  Ana Salagean: On the computation of the linear complexity and the k-error linear complexity of binary sequences with period a power of two. 1145-1150
• 
  Wilfried Meidl: On the stability of 2/sup n/-periodic binary sequences. 1151-1155
• 
  Sang-Hyo Kim, Jong-Seon No, Habong Chung, Tor Helleseth: New cyclic relative difference sets constructed from d-homogeneous functions with difference-balanced property. 1155-1163
• 
  Ernst M. Gabidulin, Vitaly V. Shorin: Unimodular perfect sequences of length p/sup s/. 1163-1166
• 
  Marco Ajmone Marsan, Emilio Leonardi, Marco Mellia, Fabio Neri: On the stability of isolated and interconnected input-queueing switches under multiclass traffic. 1167-1174
• 
  Torleiv Kløve, Paul Oprisan, Bella Bose: Diversity combining for the Z-channel. 1174-1178
• 
  Wen-Qing Xu, Solomon W. Golomb: Optimal 2-D interleaving with latin rectangles. 1179-1182
• 
  Yuri L. Borissov, An Braeken, Svetla Nikova, Bart Preneel: On the covering radii of binary Reed-Muller codes in the set of resilient Boolean functions. 1182-1189
• 
  K. Elssel, Karl-Heinz Zimmermann: Two new nonlinear binary codes. 1189-1190
• 
  Xin-Wen Wu, Margreta Kuijper, Parampalli Udaya: A root-finding algorithm for list decoding of Reed-Muller codes. 1190-1196
• 
  Sergei V. Fedorenko: A simple algorithm for decoding Reed-Solomon codes and its relation to the Welch-Berlekamp algorithm. 1196-1198
• 
  Haibin Kan, Hong Shen: A relation between the Characteristic Generators of a linear code and its dual. 1199-1202
• 
  Torleiv Kløve, Paul Oprisan, Bella Bose: The probability of undetected error for a class of asymmetric error detecting codes. 1202-1205
• 
  Rossitza Dodunekova, Olivier Rabaste, Jose Leon Vega Paez: Error detection with a class of irreducible binary cyclic codes and their dual codes. 1206-1209
• 
  Frans M. J. Willems, Marten van Dijk: Capacity and codes for embedding information in gray-scale signals. 1209-1214
• 
  Ching-Nung Yang, Guo-Jau Chen: A comment on "Systematic single asymmetric error-correcting Codes". 1214-1217
• 
  J. Binia: New bounds on the capacity of certain infinite-dimensional additive non-Gaussian channels. 1218-1221
• 
  Luo Yuan, Chaichana Mitrpant, A. J. Han Vinck, Kefei Chen: Some new characters on the wire-tap channel of type II. 1222-1229
• 
  Hesham El Gamal: On the scaling laws of dense wireless sensor networks: the data gathering channel. 1229-1234
• 
  John A. Gubner: Theorems and fallacies in the theory of long-range-dependent Processes. 1234-1239
• 
  Kostas Zografos, Saralees Nadarajah: Survival exponential entropies. 1239-1246

Volume 51, Number 4, April 2005

• 
  Dongning Guo, Shlomo Shamai, Sergio Verdú: Mutual information and minimum mean-square error in Gaussian channels. 1261-1282
• 
  Guy Lebanon: Axiomatic geometry of conditional models. 1283-1294
• 
  Tracey Ho, Muriel Médard, Ralf Koetter: An information-theoretic view of network management. 1295-1312
• 
  Ilan Sutskover, Shlomo Shamai, Jacob Ziv: Extremes of information combining. 1313-1325
• 
  Lifang Li, Nihar Jindal, Andrea J. Goldsmith: Outage capacities and optimal power allocation for fading multiple-access channels. 1326-1347
• 
  Liang-Liang Xie, Panganamala R. Kumar: An achievable rate for the multiple-level relay channel. 1348-1358
• 
  Pierre T. Kabamba, Semyon M. Meerkov, Choon Yik Tang: Optimal, suboptimal, and adaptive threshold policies for power efficiency of wireless networks. 1359-1376
• 
  Rohit Puri, S. Sandeep Pradhan, Kannan Ramchandran: n-channel symmetric multiple descriptions-part II: An achievable rate-distortion region. 1377-1392
• 
  Herve Jegou, Christine Guillemot: Robust multiplexed codes for compression of heterogeneous data. 1393-1407
• 
  Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein: Error-correction capability of binary linear codes. 1408-1423
• 
  Hyun Kwang Kim, Dong Yeol Oh: A classification of posets admitting the MacWilliams identity. 1424-1431
• 
  Jean-Claude Belfiore, Ghaya Rekaya, Emanuele Viterbo: The golden code: a 2/spl times/2 full-rate space-time code with nonvanishing determinants. 1432-1436
• 
  Amichai Sanderovich, Michael Peleg, Shlomo Shamai: LDPC coded MIMO multiple access with iterative joint decoding. 1437-1450
• 
  Hoi Fung Chau: Unconditionally secure key distribution in higher dimensions by depolarization. 1451-1468
• 
  Sang-Hyo Kim, Ji-Woong Jang, Jong-Seon No, Habong Chung: New constructions of quaternary low correlation zone sequences. 1469-1477
• 
  Babak Seyfe, Ahmad R. Sharafat: Signed-rank nonparametric multiuser detection in non-Gaussian channels. 1478-1486
• 
  Arak Sutivong, Mung Chiang, Thomas M. Cover, Young-Han Kim: Channel capacity and state estimation for state-dependent Gaussian channels. 1486-1495
• 
  Gusztáv Morvai, Benjamin Weiss: Order estimation of Markov chains. 1496-1497
• 
  Kiminori Iriyama: Probability of error for the fixed-length lossy coding of general sources. 1498-1507
• 
  Amir Dembo, Tsachy Weissman: Universal denoising for the finite-input general-output channel. 1507-1517
• 
  Kiminori Iriyama: Error exponents for hypothesis testing of the general source. 1517-1522
• 
  Rudi Cilibrasi, Paul M. B. Vitányi: Clustering by compression. 1523-1545
• 
  Hiroki Koga, Hirosuke Yamamoto: Asymptotic properties on codeword lengths of an optimal FV code for general sources. 1546-1555
• 
  Panagiotis Rizomiliotis, Nicholas Kalouptsidis: Results on the nonlinear span of binary sequences. 1555-1563
• 
  Peter B. Borwein, R. A. Ferguson: Polyphase sequences with low autocorrelation. 1564-1567
• 
  Joel A. Tropp: Recovery of short, complex linear combinations via /spl lscr//sub 1/ minimization. 1568-1570
• 
  Nihar Jindal, Wonjong Rhee, Sriram Vishwanath, Syed Ali Jafar, Andrea J. Goldsmith: Sum power iterative water-filling for multi-antenna Gaussian broadcast channels. 1570-1580
• 
  Ching-Nung Yang: Design of efficient second-order spectral- codes. 1580-1584
• 
  Cunsheng Ding, Jianxing Yin: Algebraic constructions of constant composition codes. 1585-1589
• 
  Gretchen L. Matthews, T. W. Michel: One-point codes using places of higher degree. 1590-1593
• 
  Nenad Miladinovic, Marc P. C. Fossorier: Improved bit-flipping decoding of low-density parity-check codes. 1594-1606
• 
  M. Csros, M. Ruszinko: Single-user tracing and disjointly superimposed codes. 1606-1611
• 
  L. Birge: A new lower bound for multiple hypothesis testing. 1611-1615
• 
  Dilip V. Sarwate: Comments on "Lower bounds on the Hamming auto- and cross correlations of frequency-hopping sequences" by D. Peng and P. Fan. 1615-
• 
  Error Control Coding. 1616-1617

Volume 51, Number 5, May 2005

• 
  Alexander Barg, Gilles Zémor: Concatenated codes: serial and parallel. 1625-1634
• 
  Yongyi Mao, Frank R. Kschischang: On factor graphs and the Fourier transform. 1635-1649
• 
  Alberto Tarable, Guido Montorsi, Sergio Benedetto: Analysis and design of interleavers for iterative multiuser receivers in coded CDMA systems. 1650-1666
• 
  Mérouane Debbah, Ralf R. Müller: MIMO channel modeling and the principle of maximum entropy. 1667-1690
• 
  Pranav Dayal, Mahesh K. Varanasi: Maximal diversity algebraic space-time codes with low peak-to-mean power ratio. 1691-1708
• 
  Hsiao-feng Lu, P. Vijay Kumar: A unified construction of space-time codes with optimal rate-diversity tradeoff. 1709-1730
• 
  W. Paul Malcolm, Robert J. Elliott, Matthew R. James: Risk-sensitive filtering and smoothing for continuous-time Markov Processes. 1731-1738
• 
  Daniel Marco, David L. Neuhoff: The validity of the additive noise model for uniform scalar quantizers. 1739-1755
• 
  Nick G. Duffield, Carsten Lund, Mikkel Thorup: Learn more, sample less: control of volume and variance in network measurement. 1756-1775
• 
  Trieu-Kien Truong, Yaotsu Chang, Chong-Dao Lee: The weight distributions of some binary quadratic residue codes. 1776-1782
• 
  Nihar Jindal, Andrea J. Goldsmith: Dirty-paper coding versus TDMA for MIMO Broadcast channels. 1783-1794
• 
  Wenyan He, Costas N. Georghiades: Computing the capacity of a MIMO fading channel under PSK signaling. 1794-1803
• 
  Naresh Sharma, Lawrence H. Ozarow: A study of opportunism for multiple-antenna systems. 1804-1814
• 
  Abbas El Gamal, Sina Zahedi: Capacity of a class of relay channels with orthogonal components. 1815-1817
• 
  Aviv Rosenzweig, Yossef Steinberg, Shlomo Shamai: On channels with partial channel state information at the transmitter. 1817-1830
• 
  Onur Kaya, Sennur Ulukus: Ergodic sum capacity maximization for CDMA: Optimum resource allocation. 1831-1836
• 
  Erik Ordentlich, Marcelo J. Weinberger: A distribution dependent refinement of Pinsker's inequality. 1836-1840
• 
  Panagiotis Rizomiliotis, Nicholas Kolokotronis, Nicholas Kalouptsidis: On the quadratic span of binary sequences. 1840-1848
• 
  Enjian Bai, Xiaojuan Liu, Guozhen Xiao: Linear complexity of new generalized cyclotomic sequences of order two of length pq. 1849-1853
• 
  Hao Chen: Fast algorithms for determining the linear complexity of sequences over GF(p/sup m/) with period 2/sup t/n. 1854-1856
• 
  Daniel E. Asraf, Mats G. Gustafsson: Detection of multiple transient signals with unknown arrival times. 1856-1860
• 
  Petre Stoica, Jianhua Liu, Jian Li, Mandyam A. Prasad: The heuristic, GLRT, and MAP detectors for double differential Modulation are identical. 1860-1865
• 
  Yuheng Huang, James A. Ritcey: Optimal constellation labeling for iteratively decoded bit-interleaved space-time coded Modulation. 1865-1871
• 
  Uri Erez, Gadi Miller: The ML decoding performance of LDPC ensembles over Z/sub q/. 1871-1879
• 
  Irina E. Bocharova, Marc Handlery, Rolf Johannesson, Boris D. Kudryashov: BEAST decoding of block codes obtained via convolutional codes. 1880-1891
• 
  Marie-Pierre Béal, Maxime Crochemore, Gabriele Fici: Presentations of constrained systems with unconstrained positions. 1891-1900
• 
  Pengfei Xia, Shengli Zhou, Georgios B. Giannakis: Achieving the Welch bound with difference sets. 1900-1907

Volume 51, Number 6, June 2005

• 
  Michael J. Neely, Eytan Modiano: Capacity and delay tradeoffs for ad hoc mobile networks. 1917-1937
• 
  Gökhan Mergen, Lang Tong: Stability and capacity of regular wireless networks. 1938-1953
• 
  Prasanna Chaporkar, Saswati Sarkar: Wireless multicast: theory and approaches. 1954-1972
• 
  Sidharth Jaggi, Peter Sanders, Philip A. Chou, Michelle Effros, Sebastian Egner, Kamal Jain, Ludo M. G. M. Tolhuizen: Polynomial time algorithms for multicast network code construction. 1973-1982
• 
  Dongning Guo, Sergio Verdú: Randomly spread CDMA: asymptotics via statistical physics. 1983-2010
• 
  Lorens A. Imhof, Rudolf Mathar: Capacity regions and optimal power allocation for CDMA cellular radio. 2011-2019
• 
  Anders Høst-Madsen, Junshan Zhang: Capacity bounds and power allocation for wireless relay channels. 2020-2040
• 
  Patrick Mitran, Hideki Ochiai, Vahid Tarokh: Space-time diversity enhancements using collaborative communications. 2041-2057
• 
  Venugopal V. Veeravalli, Yingbin Liang, Akbar M. Sayeed: Correlated MIMO wireless channels: capacity, optimal signaling, and asymptotics. 2058-2072
• 
  Terence H. Chan, Steve Hranilovic, Frank R. Kschischang: Capacity-achieving probability measure for conditionally Gaussian channels with bounded inputs. 2073-2088
• 
  Claude Carlet, Cunsheng Ding, Jin Yuan: Linear codes from perfect nonlinear mappings and their secret sharing schemes. 2089-2102
• 
  Louay Bazzi, Sanjoy K. Mitter: Endcoding complexity versus minimum distance. 2103-2112
• 
  Drue Coles: Vector bundles and codes on the Hermitian curve. 2113-2120
• 
  Moshe Schwartz, Tuvi Etzion: Two-dimensional cluster-correcting codes. 2121-2132
• 
  Mihir Bellare, Gregory Neven: Transitive signatures: new schemes and proofs. 2133-2151
• 
  Nicolò Cesa-Bianchi, Gábor Lugosi, Gilles Stoltz: Minimizing regret with label efficient prediction. 2152-2162
• 
  Gérard Biau, Florentina Bunea, Marten H. Wegkamp: Functional classification in Hilbert spaces. 2163-2172
• 
  Peter Berlin, Daniela Tuninetti: LDPC codes for fading Gaussian broadcast channels. 2173-2182
• 
  Bo Xia, William E. Ryan: Importance sampling for tanner trees. 2183-2189
• 
  Frédéric Lehmann, Gian Mario Maggio: Nonlinear analysis of the iterative decoding of parallel concatenated convolutional codes. 2190-2198
• 
  Chong Jie Lim: Consta-Abelian polyadic codes. 2198-2206
• 
  Lanju Xu: Improvement on parameters of Goppa geometry codes from maximal curves using the Vla/spl breve/dut-Xing method. 2207-2210
• 
  Zhi-Quan Luo: Universal decentralized estimation in a bandwidth constrained sensor network. 2210-2219
• 
  Ateet Kapur, Mahesh K. Varanasi, Clifford T. Mullis: On the limitation of generalized Welch-bound equality signals. 2220-2224
• 
  Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai, Wen-Guey Tzeng: Extracting randomness from multiple independent sources. 2224-2227
• 
  Gal Ben-David, David Malah: Bounds on the performance of vector-quantizers under channel errors. 2227-2235
• 
  Linear Estimation. 2236-2240

Volume 51, Number 7, July 2005

• 
  Venkatesan Guruswami, Alexander Vardy: Maximum-likelihood decoding of Reed-Solomon codes is NP-hard. 2249-2256
• 
  Michael Alekhnovich: Linear diophantine equations over polynomials and soft decoding of Reed-Solomon codes. 2257-2265
• 
  Ron M. Roth, Gadiel Seroussi: Symbol-intersecting codes. 2266-2281
• 
  Jonathan S. Yedidia, William T. Freeman, Yair Weiss: Constructing free-energy approximations and generalized belief propagation algorithms. 2282-2312
• 
  Martin J. Wainwright, Tommi Jaakkola, Alan S. Willsky: A new class of upper bounds on the log partition function. 2313-2335
• 
  Jianyi Huang, Sean P. Meyn: Characterization and computation of optimal distributions for channel coding. 2336-2351
• 
  Henry D. Pfister, Igal Sason, Rüdiger L. Urbanke: Capacity-achieving ensembles for the binary erasure channel with bounded complexity. 2352-2379
• 
  Hesham El Gamal, Defne Aktas, Mohamed Oussama Damen: Noncoherent space-time coding: An algebraic perspective. 2380-2390
• 
  Robert König, Ueli M. Maurer, Renato Renner: On the power of quantum memory. 2391-2401
• 
  Ery Arias-Castro, David L. Donoho, Xiaoming Huo: Near-optimal detection of geometric objects by fast multiscale methods. 2402-2425
• 
  Yonina C. Eldar, Shlomo Shamai: A covariance shaping framework for linear multiuser detection. 2426-2446
• 
  Weimin Xiao, Michael L. Honig: Large system transient analysis of adaptive least squares filtering. 2447-2474
• 
  Gang George Yin, Vikram Krishnamurthy: LMS algorithms for tracking slow Markov chains with applications to hidden Markov estimation and adaptive multiuser detection. 2475-2490
• 
  Antonia Maria Tulino, Angel Lozano, Sergio Verdú: Impact of antenna correlation on the capacity of multiantenna channels. 2491-2509
• 
  John Shawe-Taylor, Christopher K. I. Williams, Nello Cristianini, Jaz S. Kandola: On the eigenspectrum of the gram matrix and the generalization error of kernel-PCA. 2510-2522
• 
  Emin Martinian, Gregory W. Wornell, Brian Chen: Authentication with distortion criteria. 2523-2542
• 
  Jovan Dj. Golic: Embedding probabilities for the Alternating Step Generator. 2543-2553
• 
  Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, Amit Sahai, Abhi Shelat: The smallest grammar problem. 2554-2576
• 
  Yasutada Oohama: Rate-distortion theory for Gaussian multiterminal source coding systems with several side informations at the decoder. 2577-2593
• 
  Jianghong Luo, Roy D. Yates, Predrag Spasojevic: Service outage based power and rate allocation for parallel fading channels. 2594-2611
• 
  Jie Luo, Sennur Ulukus, Anthony Ephremides: Standard and quasi-standard stochastic power control algorithms. 2612-2624
• 
  Chi Wan Sung, Kin Kwong Leung: A generalized framework for distributed power control in wireless networks. 2625-2635
• 
  Vidyut Naware, Gökhan Mergen, Lang Tong: Stability and delay of finite-user slotted ALOHA with multipacket reception. 2636-2656
• 
  Bo Xu, Maïté Brandt-Pearce: Multiuser detection for square-law receiver under Gaussian channel noise with applications to fiber-optic communications. 2657-2664
• 
  Arindam Banerjee, Xin Guo, Hui Wang: On the optimality of conditional expectation as a Bregman predictor. 2664-2669
• 
  Yongguo Mei: Information bounds and quickest change detection in decentralized decision systems. 2669-2681
• 
  Diego Hernando, Valentino Crespi, George Cybenko: Efficient computation of the hidden Markov model entropy for a given observation sequence. 2681-2685
• 
  Joaquim Borges, Cristina Fernandez, Kevin T. Phelps: Quaternary Reed-Muller codes. 2686-2691
• 
  San Ling, Patrick Solé: On the algebraic structure of quasi-cyclic codes III: generator theory. 2692-2700
• 
  Makoto Harada, Takuji Nishimura: On the complete coset weight distribution of the extremal self-dual [46, 23, 10] code. 2700-2702
• 
  Hossein Pishro-Nik, Nazanin Rahnavard, Faramarz Fekri: Nonuniform error correction using low-density parity-check codes. 2702-2714
• 
  Tadashi Wadayama: Average coset weight distributions of Gallager's LDPC code ensemble. 2715-2721
• 
  Fred Daneshgaran, Massimiliano Laddomada, Marina Mondin: Iterative joint channel decoding of correlated sources employing serially concatenated convolutional codes. 2721-2731
• 
  Alexander Barg, Dmitry Yu. Nogin: Correction to "Bounds on Packings of Spheres in the Grassmann Manifold". 2732-
• 
  Genyuan Wang, Xiang-Gen Xia: Correction to the Definition of Diversity Product in "On Optimal Multilayer Cyclotomic Space-Time Code Designs". 2732-2733

Volume 51, Number 8, August 2005

• 
  Randall Dougherty, Christopher F. Freiling, Kenneth Zeger: Insufficiency of linear coding in network information flow. 2745-2759
• 
  Jie Luo, Sennur Ulukus, Anthony Ephremides: Optimal sequences and sum capacity of symbol asynchronous CDMA systems. 2760-2769
• 
  Ofer Shayevitz, Meir Feder: Universal decoding for frequency-selective fading channels. 2770-2790
• 
  Anne Canteaut, Marion Videau: Symmetric Boolean functions. 2791-2811
• 
  Wim van Dam, Richard D. Gill, Peter Grünwald: The statistical strength of nonlocality proofs. 2812-2835
• 
  Ismail Demirkan, Jack K. Wolf: Block codes for the hard-square model. 2836-2848
• 
  László Babai, Amir Shpilka, Daniel Stefankovic: Locally testable cyclic codes. 2849-2858
• 
  Alexander Schrijver: New code upper bounds from the Terwilliger algebra and semidefinite programming. 2859-2866
• 
  Yossef Steinberg: Coding for the degraded broadcast channel with random parameters, with causal and noncausal side information. 2867-2877
• 
  Aditya Ramamoorthy, Jun Shi, Richard D. Wesel: On the capacity of network coding for random networks. 2878-2885
• 
  Sharon Aviran, Paul H. Siegel, Jack K. Wolf: An improvement to the bit stuffing algorithm. 2885-2891
• 
  Hans Georg Schaathun, Tor Helleseth: The second support weight distribution of the Kasami codes. 2892-2894
• 
  Seho Myung, Kyeongcheol Yang, Jaeyoel Kim: Quasi-cyclic LDPC codes for fast encoding. 2894-2901
• 
  Dae San Kim: Dual MacWilliams pair. 2901-2905
• 
  Xiaohu Tang, Parampalli Udaya, Pingzhi Fan: A new family of nonbinary sequences with three-level correlation property and large linear span. 2906-2914
• 
  Hao Chen, San Ling, Chaoping Xing: Quantum codes from concatenated algebraic-geometric codes. 2915-2920
• 
  Yonina C. Eldar: Robust deconvolution of deterministic and random signals. 2921-2929
• 
  Aaron B. Reid, Alex J. Grant, Paul D. Alexander: List Detection for the K-Symmetric Multiple-Access Channel. 2930-2936
• 
  Zhiqiang Liu: Maximum diversity in single-carrier frequency-domain equalization. 2937-2940
• 
  Aslan Tchamkerten, Ì. Emre Telatar: On the universality of Burnashev's error exponent. 2940-2944
• 
  Ertem Tuncel: On error exponents in hypothesis testing. 2945-2950
• 
  Bing Hwa Cheng, Lieven Vandenberghe, Kung Yao: Semidefinite programming bounds on the probability of error of binary communication systems with inexactly known intersymbol interference. 2951-2954
• 
  Qi Cheng, Pramod K. Varshney, Kishan G. Mehrotra, Chilukuri K. Mohan: Bandwidth management in distributed sequential detection. 2954-2961
• 
  Zhi-hong Zuo, Qing-xin Zhu, Ming-tian Zhou: On the time complexity of computer viruses. 2962-2966
• 
  David James Love, Robert W. Heath Jr.: Limited feedback unitary precoding for spatial multiplexing systems. 2967-2976
• 
  Tharmalingam Ratnarajah, Rémi Vaillancourt: Quadratic forms on complex random matrices and multiple-antenna systems. 2976-2984
• 
  T. Kiran, Bikash Sundar Rajan: STBC-schemes with nonvanishing determinant for certain number of transmit antennas. 2984-2992
• 
  Yair Koren, Irad Yavneh, Alon Spira: A multigrid approach to the scalar quantization problem. 2993-2998
• 
  Alina Maor, Neri Merhav: On joint information embedding and lossy compression. 2998-3008
• 
  Taher Abualrub, Robert H. Oehmke: Correction to "On the Generators of BBZ₄ Cyclic Codes of Length$2^e$". 3009-

Volume 51, Number 9, September 2005

• 
  Moshe Zakai: On Mutual Information, Likelihood Ratios, and Estimation Error for the Additive Gaussian Channel. 3017-3024
• 
  Amos Lapidoth: On the High-SNR Capacity of Noncoherent Networks. 3025-3036
• 
  Gerhard Kramer, Michael Gastpar, Piyush Gupta: Cooperative Strategies and Capacity Theorems for Relay Network. 3037-3063
• 
  Qing Wang, Sanjeev R. Kulkarni, Sergio Verdú: Divergence Estimation of Continuous Distributions Based on Data-Dependent Partitions. 3064-3074
• 
  Majid Fozunbal, Steven W. McLaughlin, Ronald W. Schafer: Capacity Analysis for Continuous-Alphabet Channels With Side Information, Part I: A General Framework. 3075-3085
• 
  Majid Fozunbal, Steven W. McLaughlin, Ronald W. Schafer: Capacity Analysis for Continuous Alphabet Channels With Side Information, Part II: MIMO Channels. 3086-3101
• 
  Vignesh Sethuraman, Bruce Hajek: Capacity Per Unit Energy of Fading Channels With a Peak Constraint. 3102-3120
• 
  Matthew R. McKay, Iain B. Collings: General Capacity Bounds for Spatially Correlated Rician MIMO Channels. 3121-3145
• 
  Laura Cottatellucci, Ralf R. Müller: A Systematic Approach to Multistage Detectors in Multipath Fading Channels. 3146-3158
• 
  Matthias Christandl, Andreas Winter: Uncertainty, Monogamy, and Locking of Quantum Correlations. 3159-3165
• 
  Alina Maor, Neri Merhav: On Joint Information Embedding and Lossy Compression in the Presence of a Stationary Memoryless Attack Channel. 3166-3175
• 
  Joon Ho Cho, Wen Gao: Continuous-Time Equivalents of Welch Bound Equality Sequences. 3176-3185
• 
  Tuvi Etzion, Kenneth G. Paterson: Zero/Positive Capacities of Two-Dimensional Runlength-Constrained Arrays. 3186-3199
• 
  Van H. Vu, Lei Wu: Improving the Gilbert-Varshamov Bound for q-Ary Codes. 3200-3208
• 
  Deepak Sridhara, Thomas E. Fuja: LDPC Codes Over Rings for PSK Modulation. 3209-3220
• 
  Andrea Montanari: Tight Bounds for LDPC and LDGM Codes Under MAP Decoding. 3221-3246
• 
  Yu-Cheng He, David Haccoun: An Analysis of the Orthogonality Structures of Convolutional Codes for Iterative Decoding. 3247-3261
• 
  Panu Chaichanavong: An Analysis on Optimal Rates of BDB Encoders for RLL and MTR Systems. 3262-3283
• 
  Yingbin Liang, Venugopal V. Veeravalli: Gaussian Orthogonal Relay Channels: Optimal Resource Allocation and Capacity. 3284-3289
• 
  M. Mattas, Patric R. J. Östergård: A New Bound for the Zero-Error Capacity Region of the Two-User Binary Adder Channel. 3289-3291
• 
  Frances F. Yao, Yiqun Lisa Yin: Design and Analysis of Password-Based Key Derivation Functions. 3292-3297
• 
  Kishan Chand Gupta, Palash Sarkar: Toward a General Correlation Theorem. 3297-3302
• 
  Young-Sik Kim, Jung-Soo Chung, Jong-Seon No, Habong Chung: On the Autocorrelation Distributions of Sidel'nikov Sequences. 3303-3307
• 
  Vadim Olshevsky, Lev Sakhnovich: Matched Filtering for Generalized Stationary Processes. 3308-3313
• 
  Mark Kliger, Joseph M. Francos: Strong Consistency of the Over- and Underdetermined LSE of 2-D Exponentials in White Noise. 3314-3321
• 
  Prakash Ishwar, Pierre Moulin: On the Existence and Characterization of the Maxent Distribution Under General Moment Inequality Constraints. 3322-3333
• 
  Shi-Chun Tsai, Wen-Guey Tzeng, Hsin-Lung Wu: On the Jensen-Shannon Divergence and Variational Distance. 3333-3336
• 
  Nicolas Gresset, Joseph Boutros, Loïc Brunel: Multidimensional Mappings for Iteratively Decoded BICM on Multiple-Antenna Channels. 3337-3346
• 
  Sundararajan Sankaranarayanan, Bane V. Vasic: Iterative Decoding of Linear Block Codes: A Parity-Check Orthogonalization Approach. 3347-3353
• 
  Fredrik Brannstrom, Lars K. Rasmussen, Alex J. Grant: Convergence Analysis and Optimal Scheduling for Multiple Concatenated Codes. 3354-3364
• 
  Shu-Tao Xia, Fang-Wei Fu, Yong Jiang, San Ling: The Probability of Undetected Error for Binary Constant-Weight Codes. 3364-3373
• 
  Athanasios P. Liavas: On the Sensitivity of a Suboptimal Precoding Scheme for Frequency-Selective Block-Based Channels With Respect to Channel Inaccuracies. 3374-3381
• 
  Neri Merhav, Marcelo J. Weinberger: Addendum to "On Universal Simulation of Information Sources Using Training Data. 3381-3383

Volume 51, Number 10, October 2005

• 
  Venkatesan Guruswami, Piotr Indyk: Linear-time encodable/decodable codes with near-optimal rate. 3393-3400
• 
  Uri Erez, Simon Litsyn, Ram Zamir: Lattices which are good for (almost) everything. 3401-3416
• 
  Uri Erez, Stephan ten Brink: A close-to-capacity dirty paper coding scheme. 3417-3432
• 
  Zsolt Kukorelly, Kenneth Zeger: Sufficient conditions for existence of binary fix-free codes. 3433-3444
• 
  O. Henkel: Sphere-packing bounds in the Grassmann and Stiefel manifolds. 3445-3456
• 
  S. Sandeep Pradhan, Kannan Ramchandran: Generalized coset codes for distributed binning. 3457-3474
• 
  Wiroonsak Santipach, Michael L. Honig: Signature optimization for CDMA with limited feedback. 3475-3492
• 
  Sau-Hsuan Wu, Urbashi Mitra, C. C. Jay Kuo: Performance of linear reduced-rank multistage receivers for DS-CDMA in frequency-selective fading channels. 3493-3517
• 
  J. Nicholas Laneman, Emin Martinian, Gregory W. Wornell, John G. Apostolopoulos: Source-channel diversity for parallel channels. 3518-3539
• 
  Michael Katz, Shlomo Shamai: Transmitting to colocated users in wireless ad hoc and sensor networks. 3540-3563
• 
  Jinjun Xiao, Zhi-Quan Luo: Decentralized estimation in an inhomogeneous sensing environment. 3564-3575
• 
  Michael J. Neely, Charles E. Rohrs, Eytan Modiano: Equivalent models for queueing analysis of deterministic service time tree networks. 3576-3584
• 
  Martin Haenggi: On distances in uniformly random networks. 3584-3586
• 
  Wojciech Bulatek, Mariusz Lemanczyk, Emmanuel Lesigne: On the filtering problem for stationary random Z²-fields. 3586-3593
• 
  Rosa M. Fernández-Alcalá, Jesús Navarro-Moreno, Juan Carlos Ruiz-Molina: A unified approach to linear estimation problems for nonstationary processes. 3594-3601
• 
  J. J. Fuchs: Recovery of exact sparse representations in the presence of bounded noise. 3601-3608
• 
  Nikos C. Sagias, George K. Karagiannidis: Gaussian class multivariate Weibull distributions: theory and applications in fading channels. 3608-3619
• 
  Qian Ma, Cihan Tepedelenlioglu: Antenna selection for unitary space-time modulation. 3620-3631
• 
  Stephane Tinguely, Mohammad Rezaeian, Alex J. Grant: The collision channel with recovery. 3631-3638
• 
  S. Furuichi: On uniqueness Theorems for Tsallis entropy and Tsallis relative entropy. 3638-3645
• 
  Jun Muramatsu, Tomohiko Uyematsu, Tadashi Wadayama: Low-density parity-check matrices for coding of correlated sources. 3645-3654
• 
  Nina Brandstätter, Arne Winterhof: Some notes on the two-prime generator of order 2. 3654-3657
• 
  Masoud Ardakani, Frank R. Kschischang: Properties of optimum binary message-passing decoders. 3658-3665
• 
  Jürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco: A family of highly symmetric codes. 3665-3668
• 
  Cunsheng Ding, Jin Yuan: A family of optimal constant-composition codes. 3668-3671
• 
  Cunsheng Ding, Jianxing Yin: Combinatorial constructions of optimal constant-composition codes. 3671-3674
• 
  Chaoping Xing, Jie Ling: A construction of binary constant-weight codes from algebraic curves over finite fields. 3674-3678
• 
  Stefka Bouyuklieva, Radka Russeva, Nikolay Yankov: On the structure of binary self-dual codes having an automorphism of order a square of an odd prime. 3678-3686
• 
  Michael J. Neely, Eytan Modiano: Erratum to "Capacity and Delay Tradeoffs for Ad Hoc Mobile Networks". 3687

Volume 51, Number 11, November 2005

• 
  Martin J. Wainwright, Tommi Jaakkola, Alan S. Willsky: MAP estimation via agreement on trees: message-passing and linear programming. 3697-3717
• 
  Tsachy Weissman, Erik Ordentlich: The empirical distribution of rate-constrained source codes. 3718-3733
• 
  I. Hen, Neri Merhav: On the error exponent of trellis source coding. 3734-3741
• 
  Mitsuharu Arimura, Hirosuke Yamamoto: Asymptotic redundancy of the MTF scheme for stationary ergodic sources. 3742-3752
• 
  Da-ke He, En-Hui Yang: The universality of grammar-based codes for sources with countably infinite alphabets. 3753-3765
• 
  Dominik Endres, Peter Földiák: Bayesian bin distribution inference and mutual information. 3766-3779
• 
  Jan Poland, Marcus Hutter: Asymptotics of discrete MDL for online prediction. 3780-3795
• 
  Nicolas Bissantz, Hajo Holzmann, Axel Munk: Testing parametric assumptions on band- or time-limited signals under noise. 3796-3805
• 
  Clayton Scott, Robert D. Nowak: A Neyman-Pearson approach to statistical learning. 3806-3819
• 
  Uri Erez, Shlomo Shamai, Ram Zamir: Capacity and lattice strategies for canceling known interference. 3820-3833
• 
  Michael Lentmaier, Dmitri V. Truhachev, Kamil Sh. Zigangirov, Daniel J. Costello Jr.: An analysis of the block error probability performance of iterative decoding. 3834-3855
• 
  Hajime Matsui, S. Sakata, M. Kurihara, Seiichi Mita: Systolic array architecture implementing Berlekamp-Massey-Sakata algorithm for decoding codes on a class of algebraic curves. 3856-3871
• 
  Andrew W. Eckford, Frank R. Kschischang, Subbarayan Pasupathy: Analysis of low-density parity-check codes for the Gilbert-Elliott channel. 3872-3889
• 
  Zhenyu Liu, Dimitrios A. Pados: LDPC codes from generalized polygons. 3890-3898
• 
  Niranjan Ratnakar, Ralf Koetter: Exponential error bounds for algebraic soft-decision decoding of Reed-Solomon codes. 3899-3917
• 
  Amir J. Salomon, Ofer Amrani: Augmented product codes and lattices: Reed-Muller codes and Barnes-Wall lattices. 3918-3930
• 
  Kevin T. Phelps, Josep Rifà, Mercè Villanueva: Rank and kernel of binary Hadamard codes. 3931-3937
• 
  Tuvi Etzion, Beniamin Mounits: Quasi-perfect codes with small distance. 3938-3946
• 
  Suhas N. Diggavi, Matthias Grossglauser, David N. C. Tse: Even One-Dimensional Mobility Increases the Capacity of Wireless Networks. 3947-3954
• 
  Syed Ali Jafar: Too much mobility limits the capacity of wireless ad hoc networks. 3954-3965
• 
  Gérard Biau, László Györfi: On the asymptotic properties of a nonparametric L/sub 1/-test statistic of homogeneity. 3965-3973
• 
  Saravanan Vijayakumaran, Tan F. Wong, Sandeep R. Aedudodla: On the asymptotic performance of threshold-based acquisition systems in multipath fading channels. 3973-3986
• 
  Olivier Lévêque, Emmanuel Preissmann: Scaling laws for one-dimensional ad Hoc Wireless networks. 3987-3991
• 
  Y. Cemal, Yossef Steinberg: The multiple-access channel with partial state information at the encoders. 3992-4003
• 
  Tsachy Weissman, Neri Merhav: On causal source codes with side information. 4003-4013
• 
  András Antos, László Györfi, András György: Individual convergence rates in empirical vector quantizer design. 4013-4022
• 
  András Antos: Improved minimax bounds on the test and training distortion of empirically designed vector quantizers. 4022-4032
• 
  Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron: Testing Reed-Muller codes. 4032-4039
• 
  Tali Kaufman, Dana Ron: A characterization of low-weight words that span generalized reed-muller codes. 4039-4043
• 
  Henning Stichtenoth, Chaoping Xing: Excellent nonlinear codes from algebraic function fields. 4044-4046

Volume 51, Number 12, December 2005

• 
  Razvan Cristescu, Baltasar Beferull-Lozano, Martin Vetterli: Networked Slepian-Wolf: theory, algorithms, and scaling laws. 4057-4073
• 
  Guillermo del Angel, Terrence L. Fine: Information capacity and power control for slotted Aloha random-access systems. 4074-4090
• 
  S. P. Weber, Xiangying Yang, Jeffrey G. Andrews, Gustavo de Veciana: Transmission capacity of wireless ad hoc networks with outage constraints. 4091-4102
• 
  M. Johansson, Mikael Sternad: Resource allocation under uncertainty using the maximum entropy principle. 4103-4117
• 
  Zhiyu Yang, Lang Tong: Cooperative sensor networks with misinformed nodes. 4118-4133
• 
  Angel Lozano, Antonia Maria Tulino, Sergio Verdú: High-SNR power offset in multiantenna communication. 4134-4151
• 
  Kambiz Azarian, Hesham El Gamal, Philip Schniter: On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels. 4152-4172
• 
  Siwaruk Siwamogsatham, Michael P. Fitz: High-rate concatenated space-time block code M-TCM designs. 4173-4183
•