IEEE Transactions on Information Theory, Volume 52

Volume 52, Number 1, January 2006

• David L. Donoho, Michael Elad, Vladimir N. Temlyakov:
  Stable recovery of sparse overcomplete representations in the presence of noise. 6-18
  
• Erik Ordentlich, Tsachy Weissman:
  On the optimality of symbol-by-symbol filtering and denoising. 19-40
  
• Amke Caliebe:
  Properties of the maximum a posteriori path estimator in hidden Markov models. 41-51
  
• Joel B. Predd, Sanjeev R. Kulkarni, Harold Vincent Poor:
  Consistency in models for distributed learning under communication constraints. 52-63
  
• Navin Kashyap, Paul H. Siegel, Alexander Vardy:
  Coding for the optical channel: the ghost-pulse constraint. 64-77
  
• Alexander Barg, Gilles Zémor:
  Distance properties of expander codes. 78-90
  
• Albert Guillen i Fabregas, Giuseppe Caire:
  Coded modulation in the block-fading channel: coding theorems and code construction. 91-114
  
• Xinjia Chen, Kemin Zhou, Jorge L. Aravena:
  A new family of unitary space-time codes with a fast parallel sphere decoder algorithm. 115-140
  
• Daniel Pérez Palomar, Sergio Verdú:
  Gradient of mutual information in linear vector Gaussian channels. 141-154
  
• João Barros, Sergio D. Servetto:
  Network information flow with correlated sources. 155-170
  
• Gadiel Seroussi:
  On universal types. 171-189
  
• Neri Merhav:
  On joint coding for watermarking and encryption. 190-205
  
• Jin Yuan, Cunsheng Ding:
  Secret sharing schemes from three classes of linear codes. 206-212
  
• Neri Merhav, Erik Ordentlich:
  On causal and semicausal codes for joint information embedding and source coding. 213-226
  
• Jiangxin Chen, Paul H. Siegel:
  On the symmetric information rate of two-dimensional finite-state ISI channels. 227-236
  
• Frantisek Matús:
  Piecewise linear conditional information inequality. 236-238
  
• M. P. Friedlander, M. R. Gupta:
  On minimizing distortion and relative entropy. 238-245
  
• Patrick Mitran, Aleksandar Kavcic:
  Error exponents for finite-hypothesis channel identification. 245-255
  
• Rémi Gribonval, Pierre Vandergheynst:
  On the exponential convergence of matching pursuits in quasi-incoherent dictionaries. 255-261
  
• Alfonso Martinez, Albert Guillen i Fabregas, Giuseppe Caire:
  Error probability analysis of bit-interleaved coded modulation. 262-271
  
• Ping Li, Debashis Paul, Ravi Narasimhan, John M. Cioffi:
  On the distribution of SINR for the MMSE MIMO receiver and performance analysis. 271-286
  
• Thomas R. Halford, Keith M. Chugg:
  An algorithm for counting short cycles in bipartite graphs. 287-292
  
• Hossein Pishro-Nik, Faramarz Fekri:
  Performance of low-density parity-check codes with linear minimum distance. 292-300
  
• Ara Patapoutian:
  Timing metrics for constrained codes. 300-307
  
• Vladimir Stankovic, Samuel Cheng, Zixiang Xiong:
  On dualities in multiterminal coding problems. 307-315
  
• Kevin T. Phelps, Josep Rifà, Mercè Villanueva:
  On the additive (/spl Zopf//sub 4/-linear and non-/spl Zopf//sub 4/-linear) Hadamard codes: rank and kernel. 316-319
  
• E. Bayer-Fluckiger, Frédérique E. Oggier, Emanuele Viterbo:
  Algebraic lattice constellations: bounds on performance. 319-327
  
• Yuansheng Tang, San Ling, Fang-Wei Fu:
  On the reliability-order-based decoding algorithms for binary linear block codes. 328-336
  
• Patric R. J. Östergård, Esa Antero Seuranen:
  Unidirectional covering codes. 336-340
  
• J. M. Muñoz Porras, J. A. Domínguez Pérez, José Ignacio Iglesias Curto, G. Serrano Sotelo:
  Convolutional Goppa codes. 340-344
  
• Michael B. Baer:
  A general framework for codes involving redundancy minimization. 344-349
  

Volume 52, Number 2, February 2006

• Wei Yu:
  Uplink-downlink duality via minimax duality. 361-374
  
• Todd E. Hunter, Shahab Sanayei, Aria Nosratinia:
  Outage analysis of coded cooperation. 375-391
  
• Xiangping Qin, Randall A. Berry:
  Distributed approaches for exploiting multiuser diversity in wireless networks. 392-413
  
• Jie Luo, Anthony Ephremides:
  Power levels and packet lengths in random multiple access with multiple-packet reception capability. 414-420
  
• François Baccelli, Bartlomiej Blaszczyszyn, Paul Mühlethaler:
  An Aloha protocol for multihop mobile wireless networks. 421-436
  
• Amos Lapidoth, Stefan M. Moser:
  The fading number of single-input multiple-output fading channels with memory. 437-453
  
• Tie Liu, Pierre Moulin, Ralf Koetter:
  On error exponents of modulo lattice additive noise channels. 454-471
  
• Stéphane Boucheron, Elisabeth Gassiat:
  Error exponents for AR order testing. 472-488
  
• Emmanuel J. Candès, Justin K. Romberg, Terence Tao:
  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. 489-509
  
• Kai-Sheng Song:
  A globally convergent and consistent method for estimating the shape parameter of a generalized Gaussian distribution. 510-527
  
• Jovan Dj. Golic:
  Vectorial Boolean functions and induced algebraic equations. 528-537
  
• Navin Kashyap, David L. Neuhoff:
  Periodic prefix-synchronized codes: A generating function approach. 538-548
  
• Amir Bennatan, David Burshtein:
  Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels. 549-583
  
• Heide Gluesing-Luerssen, Joachim Rosenthal, Roxana Smarandache:
  Strongly-MDS convolutional codes. 584-598
  
• Iiro S. Honkala, Mark G. Karpovsky, Lev B. Levitin:
  On robust and dynamic identifying codes. 599-612
  
• Hans Dobbertin, Patrick Felke, Tor Helleseth, Petri Rosendahl:
  Niho type cross-correlation functions via dickson polynomials and Kloosterman sums. 613-627
  
• Erdal Arikan:
  Channel combining and splitting for cutoff rate improvement. 628-639
  
• Benjamin Farber, Kenneth Zeger:
  Quantizers with uniform decoders and channel-optimized encoders. 640-661
  
• Tamás Linder, Ram Zamir:
  Causal coding of stationary sources and individual sequences with high resolution. 662-680
  
• Luis Alfonso Lastras-Montaño, Vittorio Castelli:
  Near sufficiency of random coding for two descriptions. 681-695
  
• Conchita Martínez-Pérez, Wolfgang Willems:
  Is the class of cyclic codes asymptotically good? 696-700
  
• V. Pavlushkov, Rolf Johannesson, Victor V. Zyablov:
  Unequal error protection for convolutional codes. 700-708
  
• Stephanie Perkins, A. L. Sakhnovich, Derek H. Smith:
  On an upper bound for mixed error-correcting codes. 708-712
  
• Jin Yuan, Claude Carlet, Cunsheng Ding:
  The weight distribution of a class of linear codes from perfect nonlinear functions. 712-717
  
• M. E. O'Sullivan:
  Algebraic construction of sparse matrices with large girth. 718-727
  
• Jeongseok Ha, Jaehong Kim, Demijan Klinc, Steven W. McLaughlin:
  Rate-compatible punctured low-density parity-check codes with short block lengths. 728-738
  
• N. G. Leander:
  Monomial bent functions. 738-743
  
• Yves Edel, Gohar M. M. Kyureghyan, Alexander Pott:
  A new APN function which is not equivalent to a power mapping. 744-747
  
• Andris Ambainis, Daniel Gottesman:
  The minimum distance problem for two-way entanglement purification. 748-753
  
• Wei Yu:
  Sum-capacity computation for the Gaussian vector broadcast channel via dual decomposition. 754-759
  
• Yeon Kyoon Jeong, Joon Ho Cho, James S. Lehnert:
  An asymptotic analysis of band-limited DS/SSMA communication systems. 759-766
  

Volume 52, Number 3, March 2006

• Jillian Cannons, Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
  Network routing capacity. 777-788
  
• Amir F. Dana, Radhika Gowaikar, R. Palanki, Babak Hassibi, Michelle Effros:
  Capacity of wireless erasure networks. 789-804
  
• Lifeng Lai, Ke Liu, Hesham El Gamal:
  The three-node wireless network: achievable rates and Cooperation strategies. 805-828
  
• Christina Fragouli, Emina Soljanin:
  Information flow decomposition for network coding. 829-848
  
• Thierry E. Klein, Harish Viswanathan:
  Centralized power control and routing policies for multihop wireless networks. 849-866
  
• Neri Merhav, Jacob Ziv:
  On the Wyner-Ziv problem for individual sequences. 867-873
  
• Ingrid Daubechies, Ronald A. DeVore, C. Sinan Güntürk, Vinay A. Vaishampayan:
  A/D conversion with imperfect quantizers. 874-885
  
• Yossef Steinberg, Neri Merhav:
  On hierarchical joint source-channel coding with degraded side information. 886-903
  
• Philip A. Whiting, Edmund M. Yeh:
  Broadcasting over uncertain channels with decoding delay constraints. 904-921
  
• Moshe Schwartz, Alexander Vardy:
  On the stopping distance and the stopping redundancy of codes. 922-932
  
• Arul D. Murugan, Hesham El Gamal, Mohamed Oussama Damen, Giuseppe Caire:
  A unified framework for tree search decoding: rediscovering the sequential decoder. 933-953
  
• Ilya Dumer:
  Soft-decision decoding of Reed-Muller codes: a simplified algorithm. 954-963
  
• D. J. Katz:
  p-Adic estimates of hamming weights in abelian codes over galois rings. 964-985
  
• Keqin Feng, San Ling, Chaoping Xing:
  Asymptotic bounds on quantum codes from algebraic geometry codes. 986-991
  
• Simon Litsyn, Gerhard Wunder:
  Generalized bounds on the crest-factor distribution of OFDM signals with applications to code design. 992-1006
  
• Imre Csiszár, Zsolt Talata:
  Context tree estimation for not necessarily finite memory processes, via BIC and MDL. 1007-1016
  
• Jan Eriksson, Visa Koivunen:
  Complex random vectors and ICA models: identifiability, uniqueness, and separability. 1017-1029
  
• Joel A. Tropp:
  Just relax: convex programming methods for identifying sparse signals in noise. 1030-1051
  
• Tryphon T. Georgiou:
  Relative entropy and the multivariable multidimensional moment problem. 1052-1066
  
• Gerald Matz, Franz Hlawatsch:
  Nonstationary spectral analysis based on time-frequency operator symbols and underspread approximations. 1067-1086
  
• Ada S. Y. Poon, David N. C. Tse, Robert W. Brodersen:
  Impact of scattering on the capacity, diversity, and propagation range of multiple-antenna channels. 1087-1100
  
• June Chul Roh, Bhaskar D. Rao:
  Transmit beamforming in multiple-antenna systems with finite rate feedback: a VQ-based approach. 1101-1112
  
• Matthew J. M. Peacock, Iain B. Collings, Michael L. Honig:
  Asymptotic spectral efficiency of multiuser multisignature CDMA in frequency-selective channels. 1113-1129
  
• Alexander Russell, Hong Wang:
  How to fool an unbounded adversary with a short key. 1130-1140
  
• Lilya Budaghyan, Claude Carlet, Alexander Pott:
  New classes of almost bent and almost perfect nonlinear polynomials. 1141-1152
  
• Jovan Dj. Golic, Renato Menicocci:
  Statistical distinguishers for irregularly decimated linear recurring sequences. 1153-1159
  
• J. Binia:
  Divergence and minimum mean-square error in continuous-time additive white Gaussian noise channels. 1160-1163
  
• Hanying Feng, Qian Zhao:
  On the rate loss of multiresolution source codes in the Wyner-Ziv setting. 1164-1171
  
• Aslan Tchamkerten, Ì. Emre Telatar:
  On the use of training sequences for channel estimation. 1171-1176
  
• Ranjan K. Mallik:
  Optimized diversity combining with imperfect channel estimation. 1176-1184
  
• Yahya Z. Mohasseb, Michael P. Fitz, Urbashi Mitra:
  An improved bound on the performance of maximum-likelihood multiuser detection receivers in Rayleigh fading. 1184-1196
  
• Daniel J. Ryan, I. Vaughan L. Clarkson, Iain B. Collings:
  Blind detection of PAM and QAM in fading channels. 1197-1206
  
• Georgy Shevlyakov, Kiseon Kim:
  Robust minimax detection of a weak signal in noise with a bounded variance and density value at the center of symmetry. 1206-1211
  
• Sofia C. Olhede:
  On probability density functions for complex variables. 1212-1217
  
• Robert W. Heath Jr., Thomas Strohmer, Arogyaswami Paulraj:
  On quasi-orthogonal signatures for CDMA systems. 1217-1226
  
• Suhas N. Diggavi, Matthias Grossglauser:
  On information transmission over a finite buffer channel. 1226-1237
  
• Axel Huebner, Ralph Jordan:
  On higher order permutors for serially concatenated convolutional codes. 1238-1248
  
• Oscar Y. Takeshita:
  On maximum contention-free interleavers and permutation polynomials over integer rings. 1249-1253
  
• Jonghoon Ryu, Oscar Y. Takeshita:
  On quadratic inverses for quadratic permutation polynomials over integer rings. 1254-1260
  
• Ilya Dumer, Kirill Shabunov:
  Soft-decision decoding of Reed-Muller codes: recursive lists. 1260-1266
  
• Masaaki Harada, Akihiro Munemasa:
  Some restrictions on weight enumerators of singly even self-dual codes. 1266-1269
  
• Neri Merhav:
  On the shannon cipher system with a capacity-limited key-distribution channel. 1269-1273
  
• A. Kashyap:
  Comments on "On the optimality of the likelihood-ratio test for local sensor decision rules in the presence of nonideal channels". 1274-1275
  
• Wei Zhang:
  Comments on "Maximum diversity in single-carrier frequency-domain Equalization". 1275-1277
  
• Sergei V. Fedorenko:
  Correction to "A Simple Algorithm for Decoding Reed-Solomon Codes and Its Relation to the Welch-Berlekamp Algorithm". 1278
  
• Jan Poland:
  Erratum to "Asymptotics of Discrete MDL for Online Prediction". 1279
  

Volume 52, Number 4, April 2006

• David L. Donoho:
  Compressed sensing. 1289-1306
  
• Tong Zhang:
  Information-theoretic upper and lower bounds for statistical estimation. 1307-1321
  
• Alexander Goldenshluger, Vladimir Spokoiny:
  Recovering convex edges of an image from noisy tomographic data. 1322-1334
  
• Clayton Scott, Robert D. Nowak:
  Minimax-optimal classification with dyadic decision trees. 1335-1353
  
• Youngchul Sung, Lang Tong, H. Vincent Poor:
  Neyman-pearson detection of gauss-Markov signals in noise: closed-form error exponentand properties. 1354-1365
  
• Ljupco Kocarev, Frédéric Lehmann, Gian Mario Maggio, Bartolo Scanavino, Zarko Tasev, Alexander Vardy:
  Nonlinear dynamics of iterative decoding systems: analysis and applications. 1366-1384
  
• Volker Pauli, Lutz H.-J. Lampe, Robert Schober:
  "Turbo DPSK" using soft multiple-symbol differential sphere decoding. 1385-1398
  
• Ahmed A. Belal, Amr Elmasry:
  Verification of minimum-redundancy prefix codes. 1399-1404
  
• Ruoheng Liu, Predrag Spasojevic, Emina Soljanin:
  Reliable channel regions for good binary codes transmitted over parallel channels. 1405-1424
  
• Tze-Lei Poo, Panu Chaichanavong, Brian H. Marcus:
  Tradeoff functions for constrained systems with unconstrained positions. 1425-1449
  
• Yangfan Zhong, Fady Alajaji, L. Lorne Campbell:
  On the joint source-channel coding error exponent for discrete memoryless systems. 1450-1468
  
• Ertem Tuncel:
  Slepian-Wolf coding over broadcast channels. 1469-1482
  
• Alina Maor, Neri Merhav:
  Two-way successively refined joint source-channel coding. 1483-1494
  
• Vladimir Stankovic, Angelos D. Liveris, Zixiang Xiong, Costas N. Georghiades:
  On code design for the Slepian-Wolf problem and lossless multiterminal networks. 1495-1507
  
• Cedric Adjih, Leonidas Georgiadis, Philippe Jacquet, Wojciech Szpankowski:
  Multicast tree structure and the power law. 1508-1521
  
• Anders Høst-Madsen:
  Capacity bounds for Cooperative diversity. 1522-1544
  
• Abbas El Gamal, M. Mohseni, Sina Zahedi:
  Bounds on capacity and minimum energy-per-bit for AWGN relay channels. 1545-1561
  
• M. Hayashi:
  General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel. 1562-1575
  
• Raúl H. Etkin, David N. C. Tse:
  Degrees of freedom in some underspread MIMO fading channels. 1576-1608
  
• D. I. Ostry:
  Synthesis of accurate fractional Gaussian noise by filtering. 1609-1623
  
• Nam Yul Yu, Guang Gong:
  A new binary sequence family with low correlation and large size. 1624-1636
  
• Geir Jarle Ness, Tor Helleseth:
  Cross correlation of m-sequences of different lengths. 1637-1648
  
• Mark Goresky, Andrew Klapper:
  Pseudonoise sequences based on algebraic feedback shift registers. 1649-1662
  
• Heekwan Lee, Solomon W. Golomb:
  A new construction of 64-QAM golay complementary sequences. 1663-1670
  
• An Braeken, Yuri L. Borissov, Svetla Nikova, Bart Preneel:
  Classification of cubic (n-4)-resilient Boolean functions. 1670-1676
  
• Mingyan Li, Radha Poovendran:
  Disenrollment with perfect forward secrecy in threshold schemes. 1676-1682
  
• Jen-Chun Chang:
  Distance-increasing mappings from binary vectors to permutations that increase hamming distances by at least two. 1683-1689
  
• Daniel Marco, David L. Neuhoff:
  Low-resolution scalar quantization for Gaussian sources and squared error. 1689-1697
  
• Michael Fleming, Michelle Effros:
  On rate-distortion with mixed types of side information. 1698-1705
  
• Ying-On Yan, T. Berger:
  Zero-error instantaneous coding of correlated sources with length constraints is NP-complete. 1705-1708
  
• Dror Baron, Richard G. Baraniuk:
  Faster sequential universal coding via block partitioning. 1708-1710
  
• Raymond W. K. Leung, Guosen Yue, Li Ping, Xiaodong Wang:
  Concatenated zigzag hadamard codes. 1711-1723
  
• V. Yorgov:
  On the automorphism Group of a putative code. 1724-1726
  
• Pascale Charpin, Tor Helleseth, Victor A. Zinoviev:
  The coset distribution of triple-error-correcting binary primitive BCH codes. 1727-1732
  
• Joseph Boutros, Gilles Zémor:
  On quasi-cyclic interleavers for parallel turbo codes. 1732-1739
  
• Sunghwan Kim, Jong-Seon No, Habong Chung, Dong-Joon Shin:
  On the girth of tanner (3, 5) quasi-cyclic LDPC codes. 1739-1744
  
• Patrick Mitran, Natasha Devroye, Vahid Tarokh:
  On compound channels with side information at the transmitter. 1745-1755
  
• Wenyi Zhang, J. Nicholas Laneman:
  An induced additive-noise model for memoryless Rayleigh-fading channels. 1756-1764
  
• Dongning Guo:
  Performance of multicarrier CDMA in frequency-selective fading via statistical physics. 1765-1774
  
• Chi Wan Sung, Kenneth W. Shum, Kin Kwong Leung:
  Stability of distributed power and signature sequence control for CDMA Systems-a game-theoretic framework. 1775-1780
  
• Robert S. Caprari:
  Geometric symmetry in the quadratic fisher discriminant operating on image pixels. 1780-1788
  
• Jesús Navarro-Moreno, Juan Carlos Ruiz-Molina, Rosa M. Fernández-Alcalá:
  Approximate series representations of linear operations on second-order stochastic processes: application to Simulation. 1789-1794
  
• Vignesh Sethuraman, Bruce E. Hajek:
  Comments on "Bit-interleaved coded modulation". 1795-1797
  
• Oscar Moreno, Francis N. Castro, Harold F. Mattson:
  Correction to "Divisibility Properties for Covering Radius of Certain Cyclic Codes". 1798-1799
  

Volume 52, Number 5, May 2006

• Natasha Devroye, Patrick Mitran, Vahid Tarokh:
  Achievable rates in cognitive radio channels. 1813-1827
  
• Tie Liu, Pramod Viswanath:
  Opportunistic orthogonal writing on dirty paper. 1828-1846
  
• Lang Lin, Roy D. Yates, Predrag Spasojevic:
  Adaptive transmission with finite code rates. 1847-1860
  
• Lihua Song, Richard W. Yeung, Ning Cai:
  A separation theorem for single-source network coding. 1861-1871
  
• Amir Bennatan, David Burshtein, Giuseppe Caire, Shlomo Shamai:
  Superposition coding for side-information channels. 1872-1889
  
• T. T. Lee, T. Y. Lo, Jianfang Wang:
  An information-lossless decomposition theory of relational information systems. 1890-1903
  
• M. Hayashi:
  General formulas for fixed-length quantum entanglement concentration. 1904-1921
  
• Ioannis Kontoyiannis, Ram Zamir:
  Mismatched codebooks and the role of entropy coding in lossy data compression. 1922-1938
  
• Gil I. Shamir:
  On the MDL principle for i.i.d. sources with large alphabets. 1939-1955
  
• Jan Østergaard, Jesper Jensen, Richard Heusdens:
  n-channel entropy-constrained multiple-description lattice vector quantization. 1956-1973
  
• Vittorio Castelli, Luis Alfonso Lastras-Montaño:
  Bounds on expansion in LZ'77-like coding. 1974-1989
  
• John J. Benedetto, Alexander M. Powell, Özgür Yilmaz:
  Sigma-delta (/spl Sigma//spl Delta/) quantization and finite frames. 1990-2005
  
• Wakaha Ogata, Kaoru Kurosawa, Swee-Huay Heng:
  The security of the FDH variant of Chaum's undeniable signature scheme. 2006-2017
  
• Tor Helleseth, Alexander Kholosha:
  Monomial and quadratic bent functions over the finite fields of odd characteristic. 2018-2032
  
• Omid Etesami, Amin Shokrollahi:
  Raptor codes on binary memoryless symmetric channels. 2033-2051
  
• Yuan Zhang, Jianguo Lei, Shao Pu Zhang:
  A new family of almost difference sets and some necessary conditions. 2052-2061
  
• Md. Zafar Ali Khan, B. Sundar Rajan:
  Single-symbol maximum likelihood decodable linear STBCs. 2062-2091
  
• Yael Ben-Haim, Simon Litsyn:
  Upper bounds on the rate of LDPC codes as a function of minimum distance. 2092-2100
  
• Kristine Lally:
  Algebraic lower bounds on the free distance of convolutional codes. 2101-2110
  
• Christine Bachoc:
  Linear programming bounds for codes in grassmannian spaces. 2111-2125
  
• Aslan Tchamkerten, Ì. Emre Telatar:
  Variable length coding over an unknown channel. 2126-2145
  
• C. D. Richmond:
  Mean-squared error and threshold SNR prediction of maximum-likelihood signal parameter estimation with estimated colored noise covariances. 2146-2164
  
• Sergio Verdú, Dongning Guo:
  A simple proof of the entropy-power inequality. 2165-2166
  
• Han Wu Chen, Kenjiro Yanagi:
  The convex-concave characteristics of Gaussian channel capacity functions. 2167-2172
  
• Noga Alon, Eyal Lubetzky:
  The Shannon capacity of a graph and the independence numbers of its powers. 2172-2176
  
• Erik Ordentlich:
  Maximizing the entropy of a sum of independent bounded random variables. 2176-2181
  
• Chaichana Mitrpant, A. J. Han Vinck, Luo Yuan:
  An achievable region for the Gaussian wiretap channel with side information. 2181-2190
  
• Amir D. Dabbagh, David James Love:
  Feedback rate-capacity loss tradeoff for limited feedback MIMO systems. 2190-2202
  
• Taesang Yoo, Andrea J. Goldsmith:
  Capacity and power allocation for fading MIMO channels with channel estimation error. 2203-2214
  
• Raffaele Mascella, Luca G. Tallini, Sulaiman Al-Bassam, Bella Bose:
  On efficient balanced codes over the mth roots of unity. 2214-2217
  
• Henning Stichtenoth:
  Transitive and self-dual codes attaining the Tsfasman-Vla/spl breve/dut$80-Zink bound. 2218-2224
  
• Jürgen Freudenberger, Sergo Shavgulidze:
  A repeat request strategy based on sliding window decoding of unit-memory convolutional codes. 2224-2230
  
• Pina Marziliano, Martin Vetterli, Thierry Blu:
  Sampling and exact reconstruction of bandlimited signals with additive shot noise. 2230-2233
  
• Jinsoo Bae, Hyoungmoon Kwon, So Ryoung Park, Jumi Lee, Iickho Song:
  Explicit correlation coefficients among random variables, ranks, and magnitude ranks. 2233-2240
  
• Geir Jarle Ness, Tor Helleseth, Alexander Kholosha:
  On the correlation distribution of the Coulter-Matthews decimation. 2241-2247
  
• Jonathan Jedwab, K. Yoshida:
  The peak sidelobe level of families of binary sequences. 2247-2254
  
• Jingjing Gao, Yanxun Chang:
  New upper bounds for impulse radio sequences. 2255-2260
  
• Honggang Hu, Dengguo Feng, Wenling Wu:
  Incomplete exponential sums over galois rings with applications to some binary sequences derived from Z/sub 2//sup l/. 2260-2265
  
• Julien Bringer, Hervé Chabanne, Quoc Dung Do:
  A fuzzy sketch with trapdoor. 2266-2269
  
• Z. Saber, Mohammad Faisal Uddin, Amr M. Youssef:
  On the existence of (9, 3, 5, 240) resilient functions. 2269-2270
  
• Na Li, Wen-Feng Qi:
  Symmetric Boolean functions depending on an odd number of variables with maximum algebraic immunity. 2271-2273
  

Volume 52, Number 6, June 2006

• Ning Cai, Mung Chiang, Michelle Effros, Ralf Koetter, Muriel Médard, Balaji Prabhakar, Rayadurgam Srikant, Donald F. Towsley, Raymond W. Yeung:
  Introduction to the special issue on networking and information theory. 2285-2288
  
• Feng Xue, Panganamala R. Kumar:
  On the theta-coverage and connectivity of large random networks. 2289-2299
  
• Florin Ciucu, Almut Burchard, Jörg Liebeherr:
  Scaling properties of statistical end-to-end bounds in the network calculus. 2300-2312
  
• Liang-Liang Xie, Panganamala R. Kumar:
  On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networks. 2313-2328
  
• Michael Katz, Shlomo Shamai:
  Relaying protocols for two colocated users. 2329-2344
  
• Nicholas J. A. Harvey, Robert D. Kleinberg, April Rasala Lehman:
  On the capacity of information networks. 2345-2364
  
• Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
  Unachievability of network coding capacity. 2365-2372
  
• Xijin Yan, Jun Yang, Zhen Zhang:
  An outer bound for multisource multisink network coding with minimum cost consideration. 2373-2385
  
• Michael Langberg, Alexander Sprintson, Jehoshua Bruck:
  The encoding complexity of network coding. 2386-2397
  
• Yunnan Wu, Kamal Jain, Sun-Yuan Kung:
  A unification of network coding and tree-packing (routing) theorems. 2398-2409
  
• Chandra Chekuri, Christina Fragouli, Emina Soljanin:
  On average throughput and alphabet size in network coding. 2410-2424
  
• Niranjan Ratnakar, Gerhard Kramer:
  The multicast capacity of deterministic relay networks with no interference. 2425-2432
  
• Xue-Bin Liang:
  Matrix games in the multicast networks: maximum information flows with network switching. 2433-2466
  
• Zongpeng Li, Baochun Li, Lap Chi Lau:
  On achieving maximum multicast throughput in undirected networks. 2467-2485
  
• Supratim Deb, Muriel Médard, Clifford Choute:
  Algebraic gossip: a network coding approach to optimal multiple rumor mongering. 2486-2507
  
• Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah:
  Randomized gossip algorithms. 2508-2530
  
• Birsen Sirkeci Mergen, Anna Scaglione, Gökhan Mergen:
  Asymptotic analysis of multistage cooperative broadcast in wireless networks. 2531-2550
  
• Amin Shokrollahi:
  Raptor codes. 2551-2567
  
• Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah:
  Optimal throughput-delay scaling in wireless networks: part I: the fluid model. 2568-2592
  
• Jie Luo, Anthony Ephremides:
  On the throughput, capacity, and stability regions of random multiple access. 2593-2607
  
• Desmond S. Lun, Niranjan Ratnakar, Muriel Médard, Ralf Koetter, David R. Karger, Tracey Ho, Ebad Ahmed, Fang Zhao:
  Minimum-cost multicast over coded packet networks. 2608-2623
  
• Marcin Sikora, J. Nicholas Laneman, Martin Haenggi, Daniel J. Costello Jr., Thomas E. Fuja:
  Bandwidth- and power-efficient routing in linear wireless networks. 2624-2633
  
• Gang Liang, Nina Taft, Bin Yu:
  A fast lightweight approach to origin-destination IP traffic estimation using partial measurements. 2634-2648
  
• Dragan Petrovic, Kannan Ramchandran, Jan M. Rabaey:
  Overcoming untuned radios in wireless networks with network coding. 2649-2657
  
• Peng-Jun Wan, Chih-Wei Yi:
  Coverage by randomly deployed wireless sensor networks. 2658-2669
  
• Saikat Ray, Wei Lai, Ioannis Ch. Paschalidis:
  Statistical location detection with sensor networks. 2670-2683
  
• Leonidas Georgiadis, Leandros Tassiulas:
  Optimal overload response in sensor networks. 2684-2696
  
• Rajesh Sundaresan, Sergio Verdú:
  Capacity of queues via point-process channels. 2697-2709
  
• Omer Gurewitz, Israel Cidon, Moshe Sidi:
  One-way delay estimation using network-wide measurements. 2710-2724
  
• An-Swol Hu, Sergio D. Servetto:
  On the scalability of cooperative time synchronization in pulse-connected networks. 2725-2748
  
• Steven A. Borbash, Anthony Ephremides:
  The feasibility of matchings in a wireless network. 2749-2755
  
• Olivier Dousse, Massimo Franceschetti, Patrick Thiran:
  On the throughput scaling of wireless relay networks. 2756-2761
  
• Ashish Khisti, Uri Erez, Gregory W. Wornell:
  Fundamental limits and scaling behavior of cooperative multicasting in wireless networks. 2762-2770
  
• Sahand Haji Ali Ahmad, Aleksandar Jovicic, Pramod Viswanath:
  On outer bounds to the capacity region of wireless networks. 2770-2776
  
• Xiaojun Lin, Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff:
  Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility. 2777-2784
  
• Aditya Ramamoorthy, Kamal Jain, Philip A. Chou, Michelle Effros:
  Separating distributed source coding from network coding. 2785-2795
  
• Angela I. Barbero, Øyvind Ytrehus:
  Cycle-logical treatment for "Cyclopathic" networks. 2795-2804
  
• Kamal Jain, Vijay V. Vazirani, Gideon Yuval:
  On the capacity of multiple unicast sessions in undirected graphs. 2805-2809
  
• Alexandros G. Dimakis, Vinod M. Prabhakaran, Kannan Ramchandran:
  Decentralized erasure codes for distributed networked storage. 2809-2816
  
• Razvan Cristescu, Baltasar Beferull-Lozano:
  Lossy network correlated data gathering with high-resolution coding. 2817-2824
  
• Yitzhak Birk, Tomer Kol:
  Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients. 2825-2830
  
• Massimo Franceschetti, Ronald W. J. Meester:
  Critical node lifetimes in random networks via the Chen-Stein method. 2831-2837
  
• Cheng-Shang Chang, Yi-Ting Chen, Duan-Shin Lee:
  Constructions of optical FIFO queues. 2838-2843
  

Volume 52, Number 7, July 2006

• Radhika Gowaikar, Bertrand M. Hochwald, Babak Hassibi:
  Communication Over a Wireless Network With Random Connections. 2857-2871
  
• Peijuan Liu, Randall A. Berry, Michael L. Honig:
  A Fluid Analysis of a Utility-Based Wireless Scheduling Policy. 2872-2889
  
• Amir F. Dana, Babak Hassibi:
  On the Power Efficiency of Sensory and Ad Hoc Wireless Networks. 2890-2914
  
• Michael J. Neely:
  Energy Optimal Control for Time-Varying Wireless Networks. 2915-2934
  
• Stavros Toumpis, Leandros Tassiulas:
  Optimal Deployment of Large Wireless Sensor Networks. 2935-2953
  
• Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang:
  Limit Results on Pattern Entropy. 2954-2964
  
• Aaron S. Cohen, Stark C. Draper, Emin Martinian, Gregory W. Wornell:
  Stealing Bits From a Quantized Source. 2965-2985
  
• S. Sandeep Pradhan, Kannan Ramchandran:
  On Functional Duality in Multiuser Source and Channel Coding Problems With One-Sided Collaboration. 2986-3002
  
• Amos Lapidoth, Natalia Miliou:
  Duality Bounds on the Cutoff Rate With Applications to Ricean Fading. 3003-3018
  
• Paul-Peter Sotiriadis:
  Information Capacity of Nanowire Crossbar Switching Networks. 3019-3032
  
• Angel Lozano, Antonia Maria Tulino, Sergio Verdú:
  Optimum Power Allocation for Parallel Gaussian Channels With Arbitrary Input Distributions. 3033-3051
  
• Muriel Médard, R. Srikant:
  Capacity of Nearly Decomposable Markovian Fading Channels Under Asymmetric Receiver-Sender Side Information. 3052-3062
  
• Y.-H. Kim:
  Feedback Capacity of the First-Order Moving Average Gaussian Channel. 3063-3079
  
• R. Duan, Y. Feng, M. Ying:
  Partial Recovery of Quantum Entanglement. 3080-3104
  
• Claude Carlet, Deepak Kumar Dalai, Kishan Chand Gupta, Subhamoy Maitra:
  Algebraic Immunity for Cryptographically Significant Boolean Functions: Analysis and Construction. 3105-3121
  
• P. Xu:
  Voronoi Cells, Probabilistic Bounds, and Hypothesis Testing in Mixed Integer Linear Models. 3122-3138
  
• Yuanqing Li, Shun-ichi Amari, Andrzej Cichocki, Cuntai Guan:
  Probability Estimation for Recoverability Analysis of Blind Source Separation Based on Sparse Representation. 3139-3152
  
• Yue Shang, Xiang-Gen Xia:
  Shift-Full-Rank Matrices and Applications in Space-Time Trellis Codes for Relay Networks With Asynchronous Cooperative Diversity. 3153-3167
  
• Juntan Zhang, Marc P. C. Fossorier:
  Mean Field and Mixed Mean Field Iterative Decoding of Low-Density Parity-Check Codes. 3168-3185
  
• Erez Louidor, Ron M. Roth:
  Lowest Density MDS Codes Over Extension Alphabets. 3186-3197
  
• H.-F. Lu:
  On Constructions of Algebraic Space-Time Codes With AM-PSK Constellations Satisfying Rate-Diversity Tradeoff. 3198-3209
  
• L. M. J. Bazzi, Sanjoy K. Mitter:
  Some Randomized Code Constructions From Group Actions. 3210-3219
  
• Kai-Uwe Schmidt:
  On Cosets of the Generalized First-Order Reed-Muller Code With Low PMEPR. 3220-3232
  
• Saurabha Tavildar, Pramod Viswanath:
  Approximately Universal Codes Over Slow-Fading Channels. 3233-3258
  
• Syed Ali Jafar, Andrea J. Goldsmith:
  On the Capacity of the Vector MAC With Feedback. 3259-3264
  
• Defne Aktas, Muhammad Naeem Bacha, Jamie S. Evans, Stephen V. Hanly:
  Scaling Results on the Sum Capacity of Cellular Networks With MIMO Links. 3264-3274
  
• Gautam A. Gupta, Stavros Toumpis:
  Power Allocation Over Parallel Gaussian Multiple Access and Broadcast Channels. 3274-3282
  
• Alexe E. Leu, Brian L. Mark:
  Discrete-Time Level-Crossing Analysis of Soft Handoff Performance in Cellular Networks. 3283-3290
  
• Nam Yul Yu, Guang Gong:
  Constructions of Quadratic Bent Functions in Polynomial Forms. 3291-3299
  
• Moubariz Z. Garaev, Florian Luca, Igor Shparlinski, Arne Winterhof:
  On the Lower Bound of the Linear Complexity Over BBF_p of Sidelnikov Sequences. 3299-3304
  
• Simon R. Blackburn:
  Two-Dimensional Runlength Constrained Arrays With Equal Horizontal and Vertical Constraints. 3305-3309
  
• Jun Iichi Fujii, Ritsuo Nakamoto, Kenjiro Yanagi:
  Concavity of the Auxiliary Function Appearing in Quantum Reliability Function. 3310-3313
  
• Kui Cai, Kees A. Schouhamer Immink:
  On the Number of Encoder States of a Type of RLL Codes. 3313-3319
  
• H. F. Lu:
  On the Conjectures of SU(3) and AB Unitary Space-Time Codes. 3319-3324
  
• David Joyner, Amy Ksir:
  Automorphism Groups of Some AG Codes. 3325-3329
  
• Shraga I. Bross, Simon Litsyn:
  Improved Upper Bounds for Codes With Unequal Error Protection. 3329-3333
  
• Yogesh Sankarasubramaniam, Steven W. McLaughlin:
  Capacity Achieving Code Constructions for Two Classes of (d, k)-Constraints. 3333-3343
  
• K. Lee:
  Distance-Increasing Maps of All Lengths by Simple Mapping Algorithms. 3344-3348
  
• Bin Liu, Biao Chen:
  Channel-Optimized Quantizers for Decentralized Detection in Sensor Networks. 3349-3358
  
• Pengfei Xia, Shengli Zhou, Georgios B. Giannakis:
  Correction to "Achieving the Welch Bound With Difference Sets". 3359
  

Volume 52, Number 8, August 2006

• Anant Sahai, Sanjoy K. Mitter:
  The Necessity and Sufficiency of Anytime Capacity for Stabilization of a Linear System Over a Noisy Communication Link - Part I: Scalar Systems. 3369-3395
  
• G. Leung, Andrew R. Barron:
  Information Theory and Mixing Least-Squares Regressions. 3396-3410
  
• Morteza Shahram, Peyman Milanfar:
  Statistical and Information-Theoretic Analysis of Resolution in Imaging. 3411-3437
  
• Eirik Fossgård, Tor Flå:
  An Invariant Bayesian Model Selection Principle for Gaussian Data in a Sparse Representation. 3438-3455
  
• Haixiao Cai, Sanjeev R. Kulkarni, Sergio Verdú:
  Universal Divergence Estimation for Finite-Alphabet Sources. 3456-3475
  
• George M. Gemelos, Styrmir Sigurjonsson, Tsachy Weissman:
  Universal Minimax Discrete Denoising Under Channel Uncertainty. 3476-3497
  
• Dieter-Michael Arnold, Hans-Andrea Loeliger, Pascal O. Vontobel, Aleksandar Kavcic, Wei Zeng:
  Simulation-Based Computation of Information Rates for Channels With Memory. 3498-3508
  
• Tim Holliday, Andrea J. Goldsmith, Peter W. Glynn:
  Capacity of Finite State Channels Based on Lyapunov Exponents of Random Matrices. 3509-3532
  
• Ingrid Daubechies, O. Yilmaz:
  Robust and Practical Analog-to-Digital Conversion With Exponential Precision. 3533-3545
  
• Todd P. Coleman, Anna H. Lee, Muriel Médard, Michelle Effros:
  Low-Complexity Approaches to Slepian-Wolf Near-Lossless Distributed Data Compression. 3546-3561
  
• Hervé Chabanne, Guillaume Fumaroli:
  Noisy Cryptographic Protocols for Low-Cost RFID Tags. 3562-3566
  
• Matthew J. M. Peacock, Iain B. Collings, Michael L. Honig:
  Unified Large-System Analysis of MMSE and Adaptive Least Squares Receivers for a Class of Random Matrix Channels. 3567-3600
  
• Hesham El Gamal, Giuseppe Caire, Mohamed Oussama Damen:
  The MIMO ARQ Channel: Diversity-Multiplexing-Delay Tradeoff. 3601-3621
  
• Aris L. Moustakas, Steven H. Simon, Thomas L. Marzetta:
  Capacity of Differential Versus Nondifferential Unitary Space-Time Modulation for MIMO Channels. 3622-3634
  
• A. Abeyesinghe, Patrick M. Hayden, G. Smith, Andreas J. Winter:
  Optimal Superdense Coding of Entangled States. 3635-3641
  
• Venkatesan Guruswami, Atri Rudra:
  Limits to List Decoding Reed-Solomon Codes. 3642-3649
  
• Ron M. Roth, Vitaly Skachek:
  Improved Nearly-MDS Expander Codes. 3650-3661
  
• Junsheng Han, Paul H. Siegel, Patrick Lee:
  On the Probability of Undetected Error for Overextended Reed-Solomon Codes. 3662-3669
  
• X.-H. Peng, Patrick G. Farrell:
  On Construction of the (24, 12, 8) Golay Codes. 3669-3675
  
• J. Wang, J. Yin:
  Constructions for Perfect 5-Deletion-Correcting Codes of Length 7. 3676-3685
  
• Theo G. Swart, Hendrik C. Ferreira:
  A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings. 3685-3695
  
• Eran Rom, Amnon Ta-Shma:
  Improving the Alphabet-Size in Expander-Based Code Constructions. 3695-3700
  
• E. Betti, M. Sala:
  A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set. 3700-3706
  
• Olgica Milenkovic, Navin Kashyap, David Leyba:
  Shortened Array Codes of Large Girth. 3707-3722
  
• Guangyue Han, Joachim Rosenthal:
  Geometrical and Numerical Design of Structured Unitary Space-Time Constellations. 3722-3735
  
• Peter Sin, Qing Xiang:
  On the Dimensions of Certain LDPC Codes Based on q-Regular Bipartite Graphs. 3735-3737
  
• Hung-Hua Tang, Mao-Chao Lin, Bartolomeu F. Uchôa Filho:
  Minimal Trellis Modules and Equivalent Convolutional Codes. 3738-3746
  
• J. Jiang, K. R. Narayanan:
  Iterative Soft-Input Soft-Output Decoding of Reed-Solomon Codes by Adapting the Parity-Check Matrix. 3746-3756
  
• Mikael Skoglund, Nam Phamdo, Fady Alajaji:
  Hybrid Digital-Analog Source-Channel Coding for Bandwidth Compression/Expansion. 3757-3763
  
• S. Yang, P. Qiu:
  Efficient Integer Coding for Arbitrary Probability Distributions. 3764-3772
  
• Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
  A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes. 3772-3777
  
• Zvi Reznic, Meir Feder, Ram Zamir:
  Distortion Bounds for Broadcasting With Bandwidth Expansion. 3778-3788
  
• Shraga I. Bross:
  A Converse Result for the Discrete Memoryless Relay Channel With Relay-Transmitter Feedback. 3789-3792
  
• Y.-H. Kim:
  A Counterexample to Cover's 2P Conjecture on Gaussian Feedback Capacity. 3792-3793
  
• Hidetoshi Yokoo:
  A Comparison of Methods for Redundancy Reduction in Recurrence Time Coding. 3793-3799
  
• Vasanthan Raghavan, Akbar M. Sayeed:
  Weak Convergence and Rate of Convergence of MIMO Capacity Random Variable. 3799-3809
  
• Wonjong Rhee, Giorgio Taricco:
  On the Ergodic Capacity-Achieving Covariance Matrix of Certain Classes of MIMO Channels. 3810-3817
  
• Appuswamy Rathinakumar, Ajit Kumar Chaturvedi:
  A New Framework for Constructing Mutually Orthogonal Complementary Sets and ZCZ Sequences. 3817-3826
  
• I. Nengah Suparta, A. J. van Zanten:
  Balanced Maximum Counting Sequences. 3827-3830
  
• Hong Xu, Wenfeng Qi:
  Further Results on the Distinctness of Decimations of l-Sequences. 3831-3836
  
• Martin Hell, Thomas Johansson:
  Two New Attacks on the Self-Shrinking Generator. 3837-3843
  
• Benjamin Vigoda, Justin Dauwels, Matthias Frey, Neil Gershenfeld, Tobias Koch, Hans-Andrea Loeliger, Patrick Merkli:
  Synchronization of Pseudorandom Signals by Forward-Only Message Passing With Application to Electronic Circuits. 3843-3852
  
• Nick G. Duffield, Joseph Horowitz, Francesco Lo Presti, Donald F. Towsley:
  Explicit Loss Inference in Multicast Tomography. 3852-3855
  
• P. Le Bars, Claude Le Dantec, Philippe Piret:
  Correction to "Bolt Interleavers for Turbo Codes". 3856
  

Volume 52, Number 9, September 2006

• Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar, Hsiao-feng Lu:
  Explicit Space-Time Codes Achieving the Diversity-Multiplexing Gain Tradeoff. 3869-3884
  
• Frédérique E. Oggier, Ghaya Rekaya, Jean-Claude Belfiore, Emanuele Viterbo:
  Perfect Space-Time Block Codes. 3885-3902
  
• Joseph Abarbanel, Amir Averbuch, Shmuel Rosset, Joseph Zlotnick:
  Unitary Nongroup STBC From Cyclic Algebras. 3903-3912
  
• Vummintala Shashidhar, B. Sundar Rajan, B. A. Sethuraman:
  Information-Lossless Space-Time Block Codes From Crossed-Product Algebras. 3913-3935
  
• Hanan Weingarten, Yossef Steinberg, Shlomo Shamai:
  The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel. 3936-3964
  
• R. Narasimhan:
  Finite-SNR Diversity-Multiplexing Tradeoff for Correlated Rayleigh and Rician MIMO Channels. 3965-3979
  
• Samuli Visuri, Helmut Bölcskei:
  Multiple-Access Strategies for Frequency-Selective MIMO Channels. 3980-3993
  
• George M. Gemelos, Tsachy Weissman:
  On the Entropy Rate of Pattern Processes. 3994-4007
  
• Haixiao Cai, Sanjeev R. Kulkarni, Sergio Verdú:
  An Algorithm for Universal Lossless Compression With Side Information. 4008-4016
  
• Demosthenis Teneketzis:
  On the Structure of Optimal Real-Time Encoders and Decoders in Noisy Communication. 4017-4035
  
• Jarvis Haupt, Robert D. Nowak:
  Signal Reconstruction From Noisy Random Projections. 4036-4048
  
• Soumya Jana, Pierre Moulin:
  Optimality of KLT for High-Rate Transform Coding of Gaussian Vector-Scale Mixtures: Application to Reconstruction, Estimation, and Classification. 4049-4067
  
• C. He, Michael Lentmaier, Daniel J. Costello Jr., Kamil Sh. Zigangirov:
  Joint Permutor Analysis and Design for Multiple Turbo Codes. 4068-4083
  
• Bo Wang, Junshan Zhang, Lizhong Zheng:
  Achievable Rates and Scaling Laws of Power-Constrained Wireless Sensory Relay Networks. 4084-4104
  
• Almut Burchard, Jörg Liebeherr, Stephen D. Patek:
  A Min-Plus Calculus for End-to-End Statistical Service Guarantees. 4105-4114
  
• I. Bettesh, Shlomo Shamai:
  Optimal Power and Rate Control for Minimal Average Delay: The Single-User Case. 4115-4141
  
• Constanza Riera, Matthew G. Parker:
  Generalized Bent Criteria for Boolean Functions (I). 4142-4159
  
• Thierry P. Berger, Anne Canteaut, Pascale Charpin, Yann Laigle-Chapuy:
  On Almost Perfect Nonlinear Functions Over F₂ⁿ. 4160-4170
  
• Martin Rötteler, Pawel Wocjan:
  Equivalence of Decoupling Schemes and Orthogonal Arrays. 4171-4181
  
• Anand K. Dhulipala, Alon Orlitsky:
  Universal Compression of Markov and Related Sources Over Arbitrary Alphabets. 4182-4190
  
• Luis Alfonso Lastras-Montaño, T. Berger:
  On Successive Refinement of the Binary Symmetric Markov Source. 4190-4197
  
• Rudolf Ahlswede, A. Cai:
  An Interpretation of Identification Entropy. 4198-4207
  
• Neri Merhav, Tsachy Weissman:
  Coding for the Feedback Gel'fand-Pinsker Channel and the Feedforward Wyner-Ziv Source. 4207-4211
  
• V. Rathi:
  On the Asymptotic Weight and Stopping Set Distribution of Regular LDPC Ensembles. 4212-4218
  
• Thomas R. Halford, Alex J. Grant, Keith M. Chugg:
  Which Codes Have 4-Cycle-Free Tanner Graphs? 4219-4223
  
• Solomon W. Golomb, R. Mena, Wen-Qing Xu:
  Optimal Interleaving Schemes for Two-Dimensional Arrays. 4223-4229
  
• Cunsheng Ding:
  Complex Codebooks From Combinatorial Designs. 4229-4235
  
• Shu-Tao Xia, Fang-Wei Fu, San Ling:
  A Lower Bound on the Probability of Undetected Error for Binary Constant Weight Codes. 4235-4243
  
• Stefka Bouyuklieva, E. A. O'Brien, Wolfgang Willems:
  The Automorphism Group of a Binary Self-Dual Doubly Even [72, 36, 16] Code is Solvable. 4244-4248
  
• Mohamed Oussama Damen, Hesham El Gamal, Norman C. Beaulieu:
  A New Representation of TAST Codes. 4248-4251
  
• Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu:
  Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography. 4251-4256
  
• Panagiotis Rizomiliotis:
  Constructing Periodic Binary Sequences With Maximum Nonlinear Span. 4257-4261
  
• Frank Fiedler, Jonathan Jedwab:
  How Do More Golay Sequences Arise? 4261-4266
  
• P. Chigansky:
  On Filtering of Markov Chains in Strong Noise. 4267-4272
  
• Holger Boche, Volker Pohl:
  Structural Properties of the Wiener Filter - Stability, Smoothness Properties, and FIR Approximation Behavior. 4272-4282
  
• Mahesh K. Varanasi, Clifford T. Mullis, Ateet Kapur:
  On the Limitation of Linear MMSE Detection. 4282-4286
  
• Christian Schlegel, Zhenning Shi, Marat V. Burnashev:
  Optimal Power/Rate Allocation and Code Selection for Iterative Joint Detection of Coded Random CDMA. 4286-4294
  
• Antonia Maria Tulino, Sergio Verdú:
  Monotonic Decrease of the Non-Gaussianness of the Sum of Independent Random Variables: A Simple Proof. 4295-4297
  
• R. Viswanathan:
  On the Autocorrelation of Complex Envelope of White Noise. 4298-4299
  
• Hideki Ochiai, Patrick Mitran, Vahid Tarokh:
  Variable-Rate Two-Phase Collaborative Communication Protocols for Wireless Networks. 4299-4313
  
• Xiaohu Shang, Biao Chen, M. J. Gans:
  On the Achievable Sum Rate for MIMO Interference Channels. 4313-4320
  
• G. Nakibly, Shraga I. Bross:
  On the Reliability Exponents of Two Discrete-Time Timing Channel Models. 4320-4335
  
• J. Fu, Y.-H. Kim, Y.-S. Park, J. Wang, P. Chen, W. Bai:
  Correction to "Coded Diversity on Block-Fading Channels". 4336
  
• Dan Raphaeli:
  Correction for "Distribution of Noncentral Indefinite Quadratic Forms in Complex Normal Variables". 4336
  

Volume 52, Number 10, October 2006

• C. Ahn, A. C. Doherty, Patrick M. Hayden, Andreas J. Winter:
  On the Distributed Compression of Quantum Information. 4349-4357
  
• Zhixin Liu, Samuel Cheng, Angelos D. Liveris, Zixiang Xiong:
  Slepian-Wolf Coded Nested Lattice Quantization for Wyner-Ziv Coding: High-Rate Performance Analysis and Code Design. 4358-4379
  
• Michael B. Baer:
  Source Coding for Quasiarithmetic Penalties. 4380-4393
  
• F. Liese, I. Vajda:
  On Divergences and Informations in Statistics and Information Theory. 4394-4412
  
• Tracey Ho, Muriel Médard, Ralf Koetter, David R. Karger, Michelle Effros, Jun Shi, Ben Leong:
  A Random Linear Network Coding Approach to Multicast. 4413-4430
  
• Aditya V. Nori, P. Shankar:
  Unifying Views of Tail-Biting Trellis Constructions for Linear Block Codes. 4431-4443
  
• Kenji Yasunaga, Toru Fujiwara:
  Determination of the Local Weight Distribution of Binary Linear Block Codes. 4444-4454
  
• X. Liu:
  Weights Modulo a Prime Power in Divisible Codes and a Related Bound. 4455-4463
  
• Tze-Lei Poo, Brian H. Marcus:
  Time-Varying Maximum Transition Run Constraints. 4464-4480
  
• Mohammad-Reza Sadeghi, Amir H. Banihashemi, Daniel Panario:
  Low-Density Parity-Check Lattices: Construction and Decoding Analysis. 4481-4495
  
• F. Didier:
  A New Upper Bound on the Block Error Probability After Decoding Over the Erasure Channel. 4496-4503
  
• Charuhas Pandit, Sean P. Meyn:
  Robust Measurement-Based Admission Control Using Markov's Theory of Canonical Distributions. 4504-4518
  
• C.-C. Chou, C.-S. Chang, D.-S. Lee, J. Cheng:
  A Necessary and Sufficient Condition for the Construction of 2-to-1 Optical FIFO Multiplexers by a Single Crossbar Switch and Fiber Delay Lines. 4519-4531
  
• Yonina C. Eldar:
  Robust Competitive Estimation With Signal and Noise Covariance Uncertainties. 4532-4547
  
• Yakun Sun, Michael L. Honig:
  Performance of Reduced-Rank Equalization. 4548-4562
  
• Birsen Yazici, Gang Xie:
  Wideband Extended Range-Doppler Imaging and Waveform Design in the Presence of Clutter and Noise. 4563-4580
  
• E. Pasalic:
  Maiorana-McFarland Class: Degree Optimization and Algebraic Properties. 4581-4594
  
• Florian Hess, Nigel P. Smart, Frederik Vercauteren:
  The Eta Pairing Revisited. 4595-4602
  
• W. Chen, J. Meng:
  The Hardness of the Closest Vector Problem With Preprocessing Over ell_infty Norm. 4603-4606
  
• Young-Sik Kim, Ji-Woong Jang, Jong-Seon No, Habong Chung:
  New Design of Low-Correlation Zone Sequence Sets. 4607-4616
  
• Paul M. B. Vitányi:
  Meaningful Information. 4617-4626
  
• Jayanth Nayak, Ertem Tuncel, Kenneth Rose:
  Zero-Error Source-Channel Coding With Side Information. 4626-4629
  
• Aurélien Garivier:
  Consistency of the Unlimited BIC Context Tree Estimator. 4630-4635
  
• Ingo Steinwart, Don R. Hush, Clint Scovel:
  An Explicit Description of the Reproducing Kernel Hilbert Spaces of Gaussian RBF Kernels. 4635-4643
  
• Ping Zhao, Chun Zhao, Peter G. Casazza:
  Perturbation of Regular Sampling in Shift-Invariant Spaces for Frames. 4643-4648
  
• Eleni Drinea, Michael Mitzenmacher:
  On Lower Bounds for the Capacity of Deletion Channels. 4648-4657
  
• Michael Mitzenmacher, Eleni Drinea:
  A Simple Lower Bound for the Capacity of the Deletion Channel. 4657-4660
  
• Minoru Kuribayashi, Hatsukazu Tanaka:
  How to Generate Cyclically Permutable Codes From Cyclic Codes. 4660-4663
  
• S. V. Bulygin:
  Generalized Hermitian Codes Over GF(2^r). 4664-4669
  
• D. M. Gordon:
  Perfect Single Error-Correcting Codes in the Johnson Scheme. 4670-4672
  
• Annalisa De Bonis, Ugo Vaccaro:
  Optimal Algorithms for Two Group Testing Problems, and New Bounds on Generalized Superimposed Codes. 4673-4680
  
• Marc Andre Armand, K. S. Ng:
  Decoding LDPC Codes Over Integer Residue Rings. 4680-4686
  
• Lluis Masanes, Antonio Acin:
  Multipartite Secret Correlations and Bound Information. 4686-4694
  
• Geir Jarle Ness, Tor Helleseth:
  A New Three-Valued Cross Correlation Between m-Sequences of Different Lengths. 4695-4701
  
• Prasanna Chaporkar, Saswati Sarkar:
  Minimizing Delay in Loss-Tolerant MAC Layer Multicast. 4701-4713
  
• Guangyue Han, Joachim Rosenthal:
  Unitary Space-Time Constellation Analysis: An Upper Bound for the Diversity. 4713-4721
  
• Pedro Tejera, Wolfgang Utschick, Gerhard Bauch, Josef A. Nossek:
  Subchannel Allocation in Multiuser Multiple-Input-Multiple-Output Systems. 4721-4733
  
• Remco van der Hofstad, M. Lowe, F. Vermet:
  The Effect of System Load on the Existence of Bit Errors in CDMA With and Without Parallel Interference Cancelation. 4733-4741
  

Volume 52, Number 11, November 2006

• Ciamac Cyrus Moallemi, Benjamin Van Roy:
  Consensus Propagation. 4753-4766
  
• J. Suzuki:
  On Strong Consistency of Model Selection in Classification. 4767-4774
  
• Yiming Ying, Ding-Xuan Zhou:
  Online Regularized Classification Algorithms. 4775-4788
  
• Jiming Yu, Sergio Verdú:
  Schemes for Bidirectional Modeling of Discrete Stationary Sources. 4789-4807
  
• Götz E. Pfander, D. F. Walnut:
  Measurement of Time-Variant Linear Channels. 4808-4820
  
• Avi Steiner, Shlomo Shamai:
  Single-User Broadcasting Protocols Over a Two-Hop Relay Fading Channel. 4821-4838
  
• Changyan Di, Thomas J. Richardson, Rüdiger L. Urbanke:
  Weight Distribution of Low-Density Parity-Check Codes. 4839-4855
  
• Tadashi Wadayama:
  Average Coset Weight Distribution of Combined LDPC Matrix Ensembles. 4856-4866
  
• Tuvi Etzion:
  On the Stopping Redundancy of Reed-Muller Codes. 4867-4879
  
• Marat V. Burnashev, Ilya Dumer:
  Error Exponents for Recursive Decoding of Reed-Muller Codes on a Binary-Symmetric Channel. 4880-4891
  
• Avanti Ketkar, Andreas Klappenecker, Santosh Kumar, Pradeep Kiran Sarvepalli:
  Nonbinary Stabilizer Codes Over Finite Fields. 4892-4914
  
• Gil I. Shamir:
  Universal Lossless Compression With Unknown Alphabets - The Average Case. 4915-4944
  
• Benjamin Farber, Kenneth Zeger:
  Quantization of Multiple Sources Using Nonnegative Integer Bit Allocation. 4945-4964
  
• Sung-il Pae, Michael C. Loui:
  Randomizing Functions: Simulation of a Discrete Probability Distribution Using a Source of Unknown Distribution. 4965-4976
  
• C. Bordenave:
  Spatial Capacity of Multiple-Access Wireless Networks. 4977-4988
  
• Y. Gabbai, Shraga I. Bross:
  Achievable Rates for the Discrete Memoryless Relay Channel With Partial Feedback Configurations. 4989-5007
  
• Mohammad H. Taghavi, G. C. Papen, Paul H. Siegel:
  On the Multiuser Capacity of WDM in a Nonlinear Optical Fiber: Coherent Communication. 5008-5022
  
• Eran Hof, Shraga I. Bross:
  On the Deterministic-Code Capacity of the Two-User Discrete Memoryless Arbitrarily Varying General Broadcast Channel With Degraded Message Sets. 5023-5044
  
• Nihar Jindal:
  MIMO Broadcast Channels With Finite-Rate Feedback. 5045-5060
  
• Rahul Vaze, B. Sundar Rajan:
  On Space-Time Trellis Codes Achieving Optimal Diversity Multiplexing Tradeoff. 5060-5067
  
• Randall Dougherty, Kenneth Zeger:
  Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks. 5067-5077
  
• Sandeep Bhadra, Sanjay Shakkottai, Piyush Gupta:
  Min-Cost Selfish Multicast With Network Coding. 5077-5087
  
• Lei Ying, R. Srikant, Atilla Eryilmaz, Geir E. Dullerud:
  A Large Deviations Analysis of Scheduling in Wireless Networks. 5088-5098
  
• Jean-François Chamberland, Venugopal V. Veeravalli:
  How Dense Should a Sensor Network Be for Detection With Correlated Observations? 5099-5106
  
• Steven A. Borbash, Anthony Ephremides:
  Wireless Link Scheduling With Power Control and SINR Constraints. 5106-5111
  
• Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah:
  Optimal Throughput-Delay Scaling in Wireless Networks - Part II: Constant-Size Packets. 5111-5116
  
• A. Guillen, I. Fabregas:
  Coding in the Block-Erasure Channel. 5116-5121
  
• Vincent D. Blondel, Raphael M. Jungers, Vladimir Protasov:
  On the Complexity of Computing the Capacity of Codes That Avoid Forbidden Difference Patterns. 5122-5127
  
• Keren Censor, Tuvi Etzion:
  The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels. 5128-5140
  
• J. Muramatsu, K. Yoshimura, K. Arai, P. Davis:
  Secret Key Capacity for Optimally Correlated Sources Under Sampling Attack. 5140-5151
  
• Håvard Molland, Tor Helleseth:
  Linear Properties in T-Functions. 5151-5157
  
• Patrick Solé, Dmitrii Zinoviev:
  Low-Correlation, High-Nonlinearity Sequences for Multiple-Code CDMA. 5158-5163
  
• W. Mao, X. Su, X. Xu:
  Comments on "Correlated Jamming on MIMO Gaussian Fading Channels". 5163-5165
  
• Birsen Sirkeci Mergen, Anna Scaglione, Gökhan Mergen:
  Correction to "Asymptotic Analysis of Multistage Cooperative Broadcast in Wireless Networks". 5166
  
• Marc Andre Armand:
  Correction to "List Decoding of Generalized Reed-Solomon Codes Over Commutative Rings". 5167
  
• P. Xu:
  Erratum for "Voronoi Cells, Probabilistic Bounds, and Hypothesis Testing in Mixed Integer Linear Models". 5168