IEEE Transactions on Information Theory, Volume 53

Volume 53, Number 1, January 2007

• Andrew W. Eckford, Frank R. Kschischang, Subbarayan Pasupathy:
  On Designing Good LDPC Codes for Markov Channels. 5-21
  
• Kapil Bhattad, Krishna R. Narayanan:
  An MSE-Based Transfer Chart for Analyzing Iterative Decoding Schemes Using a Gaussian Approximation. 22-38
  
• Olgica Milenkovic, Emina Soljanin, Philip Whiting:
  Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles. 39-55
  
• C.-C. Wang, Sanjeev R. Kulkarni, H. Vincent Poor:
  Finite-Dimensional Bounds on BBZ_m and Binary LDPC Codes With Belief Propagation Decoders. 56-81
  
• Jon Feldman, Tal Malkin, Rocco A. Servedio, Clifford Stein, Martin J. Wainwright:
  LP Decoding Corrects a Constant Fraction of Errors. 82-89
  
• Junsheng Han, Paul H. Siegel:
  Improved Upper Bounds on Stopping Redundancy. 90-104
  
• Wenyi Jin, Marc P. C. Fossorier:
  Reliability-Based Soft-Decision Decoding With Multiple Biases. 105-120
  
• Jun Xu, Lei Chen, Ivana Djurdjevic, Shu Lin, Khaled A. S. Abdel-Ghaffar:
  Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking. 121-134
  
• Y. M. Chee, S. Ling:
  Constructions for q-Ary Constant-Weight Codes. 135-146
  
• H. Q. Dinh:
  Complete Distances of All Negacyclic Codes of Length 2^s Over BBZ_2^a. 147-161
  
• Claude Carlet, Sihem Mesnager:
  Improving the Upper Bounds on the Covering Radii of Binary Reed-Muller Codes. 162-173
  
• Watcharapan Suwansantisuk, Moe Z. Win:
  Multipath Aided Rapid Acquisition: Optimal Search Strategies. 174-193
  
• Dana Porrat, David N. C. Tse, Serban Nacu:
  Channel Uncertainty in Ultra-Wideband Communication Systems. 194-208
  
• Idin Motedayen-Aval, A. Krishnamoorthy, Achilleas Anastasopoulos:
  Optimal Joint Detection/Estimation in Fading Channels With Polynomial Complexity. 209-223
  
• Erik Agrell, Johan Lassing, Erik G. Ström, Tony Ottosson:
  Gray Coding for Multilevel Constellations in Gaussian Noise. 224-235
  
• Wenyi Zhang, J. Nicholas Laneman:
  How Good Is PSK for Peak-Limited Fading Channels in the Low-SNR Regime?. 236-251
  
• C.-K. Wen, K.-K. Wong:
  Asymptotic Analysis of Spatially Correlated MIMO Multiple-Access Channels With Arbitrary Signaling Inputs for Joint and Separate Decoding. 252-268
  
• R. Sundaresan:
  Guessing Under Source Uncertainty. 269-287
  
• John C. Kieffer:
  epsilon-Capacity of Binary Symmetric Averaged Channels. 288-303
  
• Jian Cao, Edmund M. Yeh:
  Asymptotically Optimal Multiple-Access Communication Via Distributed Rate Splitting. 304-319
  
• F. Mat:
  Two Constructions on Limits of Entropy Functions. 320-330
  
• S. Sandeep Pradhan:
  On the Role of Feedforward in Gaussian Sources: Point-to-Point Source Coding and Multiple Description Source Coding. 331-349
  
• Chandra Nair, Abbas El Gamal:
  An Outer Bound to the Capacity Region ofthe Broadcast Channel. 350-355
  
• Alan Clark, Peter J. Smith, Desmond P. Taylor:
  Instantaneous Capacity of OFDM on Rayleigh-Fading Channels. 355-361
  
• Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov:
  Trellis Complexity of Short Linear Codes. 361-368
  
• Simon Malinowski, Herve Jegou, Christine Guillemot:
  Synchronization Recovery and State Model Reduction for Soft Decoding of Variable Length Codes. 368-377
  
• Yingquan Wu, Christoforos N. Hadjicostis:
  Soft-Decision Decoding of Linear Block Codes Using Preprocessing and Diversification. 378-393
  
• Hon-Fah Chong, Mehul Motani, Hari Krishna Garg:
  Generalized Backward Decoding Strategies for the Relay Channel. 394-401
  
• Marc P. C. Fossorier, Kazukuni Kobara, Hideki Imai:
  Modeling Bit Flipping Decoding Based on Nonorthogonal Check Sums With Application to Iterative Decoding Attack of McEliece Cryptosystem. 402-411
  
• W. J. Martin, Terry I. Visentin:
  A Dual Plotkin Bound for (T, M, S) -Nets. 411-415
  
• Amir J. Salomon, Ofer Amrani:
  Product Construction of Codes for Rayleigh-Fading Channels. 416-428
  
• H. Liao, X.-G. Xia:
  A Sharpened Dynamic Range of a Generalized Chinese Remainder Theorem for Multiple Integers. 428-433
  
• Xiaohu Tang, Parampalli Udaya:
  A Note on the Optimal Quadriphase Sequences Families. 433-436
  
• Noga Alon, Vera Asodi:
  Tracing Many Users With Almost No Rate Penalty. 437-439
  
• Dakshi Agrawal, T. McGiffen, Thomas J. Richardson, Rüdiger L. Urbanke, D. Cox:
  Correction to "Multiple-Antenna Signal Constellations for Fading Channels". 440
  
• James L. Massey:
  Book review. 441-442
  

Volume 53, Number 2, February 2007

• Daniel Pérez Palomar, Sergio Verdú:
  Representation of Mutual Information Via Input Estimates. 453-470
  
• Michael Gastpar:
  On Capacity Under Receive and Spatial Spectrum-Sharing Constraints. 471-487
  
• Kambiz Azarian, Hesham El Gamal:
  The Throughput-Reliability Tradeoff in Block-Fading MIMO Channels. 488-501
  
• Shi Jin, Xiqi Gao, Xiaohu You:
  On the Ergodic Capacity of Rank-1 Ricean-Fading MIMO Channels. 502-517
  
• Gerhard Kramer, Serap A. Savari:
  Communicating Probability Distributions. 518-525
  
• Rudolf Ahlswede, Vladimir Blinovsky:
  Classical Capacity of Classical-Quantum Arbitrarily Varying Channels. 526-533
  
• Hiroshi Nagaoka, Masahito Hayashi:
  An Information-Spectrum Approach to Classical and Quantum Hypothesis Testing for Simple Hypotheses. 534-549
  
• Gil Wiechman, Igal Sason:
  Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications. 550-579
  
• Igal Sason, Gil Wiechman:
  On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications. 580-598
  
• Hossein Pishro-Nik, Faramarz Fekri:
  Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques. 599-614
  
• Chunlong Bai, Bartosz Mielczarek, Witold A. Krzymien, Ivan J. Fair:
  Improved Analysis of List Decoding and Its Application to Convolutional Codes and Turbo Codes. 615-627
  
• Teng Li, Oliver M. Collins:
  A Successive Decoding Strategy for Channels With Memory. 628-646
  
• Sheng Yang, Jean-Claude Belfiore:
  Optimal Space-Time Codes for the MIMO Amplify-and-Forward Cooperative Channel. 647-663
  
• Nicolas Macris:
  Griffith-Kelly-Sherman Correlation Inequalities: A Useful Tool in the Theory of Error Correcting Codes. 664-683
  
• Xiaofu Wu, Haige Xiang, Cong Ling:
  New Gallager Bounds in Block-Fading Channels. 684-694
  
• Rajat Prakash, Venugopal V. Veeravalli:
  Centralized Wireless Data Networks With User Arrivals and Departures. 695-713
  
• Sergio D. Servetto:
  Lattice Quantization With Side Information: Codes, Asymptotics, and Applications in Sensor Networks. 714-731
  
• Alejandro Ribeiro, Nikos D. Sidiropoulos, Georgios B. Giannakis, Yingqun Yu:
  Achieving Wireline Random Access Throughput in Wireless Networking Via User Cooperation. 732-758
  
• Mridul Nandi, Douglas R. Stinson:
  Multicollision Attacks on Some Generalized Sequential Hash Functions. 759-767
  
• Solomon W. Golomb, Pey-Feng Lee:
  Irreducible Polynomials Which Divide Trinomials Over GF, (2). 768-774
  
• Kai Cai, Pingyi Fan:
  An Algebraic Approach to Link Failures Based on Network Coding. 775-779
  
• Slawomir Stanczak, Holger Boche:
  On the Convexity of Feasible QoS Regions. 779-783
  
• Li Xie, Valery A. Ugrinovskii, Ian R. Petersen:
  A Posteriori Probability Distances Between Finite-Alphabet Hidden Markov Models. 783-793
  
• Pulkit Grover, Ajit Kumar Chaturvedi:
  Upper Bounds on the Rate of LDPC Codes for a Class of Finite-State Markov Channels. 794-804
  
• Hongxia Jin, Mario Blaum:
  Combinatorial Properties for Traceability Codes Using Error Correcting Codes. 804-808
  
• Kai-Uwe Schmidt:
  Complementary Sets, Generalized Reed-Muller Codes, and Power Control for OFDM. 808-814
  
• Ji-Woong Jang, Jong-Seon No, Habong Chung, Xiaohu Tang:
  New Sets of Optimal p-ary Low-Correlation Zone Sequences. 815-821
  
• Maria Bras-Amorós:
  A Note on Numerical Semigroups. 821-823
  
• Henk D. L. Hollmann, Ludo M. G. M. Tolhuizen:
  On Parity-Check Collections for Iterative Erasure Decoding That Correct all Correctable Erasure Patterns of a Given Size. 823-828
  
• Yingquan Wu, Christoforos N. Hadjicostis:
  Soft-Decision Decoding Using Ordered Recodings on the Most Reliable Basis. 829-836
  
• Ming-Yang Chen, Chiang-Yu Chen, Hua-Chieh Li, Soo-Chang Pei, Hsuan-Jung Su:
  Generally Dimensional and Constellation Expansion Free Space-Time Block Codes for QAM With Full Diversity. 836-843
  
• Marko J. Moisio:
  The Moments of a Kloosterman Sum and the Weight Distribution of a Zetterberg-Type Binary Cyclic Code. 843-847
  
• Cem Güneri, Ferruh Özbudak:
  Cyclic Codes and Reducible Additive Equations. 848-853
  
• Santosh S. Venkatesh, Demetri Psaltis:
  Correction to "Linear and Logarithmic Capacities in Associative Neural Networks". 854
  

Volume 53, Number 3, March 2007

• G. David Forney Jr., Markus Grassl, Saikat Guha:
  Convolutional and Tail-Biting Quantum Error-Correcting Codes. 865-880
  
• Andrea J. Goldsmith, Muriel Médard:
  Capacity of Time-Varying Channels With Causal Channel Side Information. 881-899
  
• Yingbin Liang, Venugopal V. Veeravalli:
  Cooperative Relay Broadcast Channels. 900-928
  
• Shaohua Yang, Aleksandar Kavcic, Sekhar Tatikonda:
  On the Feedback Capacity of Power-Constrained Gaussian Noise Channels With Memory. 929-954
  
• Mohammadali Khosravifard, Hossein Saidi, Morteza Esmaeili, T. Aaron Gulliver:
  The Minimum Average Code for Finite Memoryless Monotone Sources. 955-975
  
• Lizhong Zheng, David N. C. Tse, Muriel Médard:
  Channel Coherence in the Low-SNR Regime. 976-997
  
• Anand Ganti, Eytan Modiano, John N. Tsitsiklis:
  Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity. 998-1008
  
• Massimo Franceschetti, Olivier Dousse, David N. C. Tse, Patrick Thiran:
  Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory. 1009-1018
  
• Chunsheng Ma:
  Stationary Random Fields in Space and Time With Rational Spectral Densities. 1019-1029
  
• Frédéric Vrins, Dinh-Tuan Pham, Michel Verleysen:
  Mixing and Non-Mixing Local Minima of the Entropy Contrast for Blind Source Separation. 1030-1042
  
• Constantine Caramanis, Shie Mannor:
  An Inequality for Nearly Log-Concave Distributions With Applications to Learning. 1043-1057
  
• Guosen Yue, Li Ping, Xiaodong Wang:
  Generalized Low-Density Parity-Check Codes Based on Hadamard Constraints. 1058-1079
  
• Jin Lu, José M. F. Moura:
  TS-LDPC Codes: Turbo-Structured Codes With Large Girth. 1080-1094
  
• Emmanuela Orsini, Massimiliano Sala:
  General Error Locator Polynomials for Binary Cyclic Codes With t<=2 and n<63. 1095-1107
  
• James P. Mammen, Devavrat Shah:
  Throughput and Delay in Random Wireless Networks With Restricted Mobility. 1108-1116
  
• Laura Cottatellucci, Ralf R. Müller:
  CDMA Systems With Correlated Spatial Diversity: A Generalized Resource Pooling Result. 1116-1136
  
• Seongwook Song, Andrew C. Singer:
  Blind OFDM Channel Estimation Using FIR Constraints: Reduced Complexity and Identifiability. 1136-1147
  
• Guangming Pan, Meihui Guo, Ying-Chang Liang:
  Asymptotic Performance of Reduced-Rank Linear Receivers With Principal Component Filter. 1148-1151
  
• Fatma Kharrat-Kammoun, Sandrine Fontenelle, Joseph Boutros:
  Accurate Approximation of QAM Error Probability on Quasi-Static MIMO Channels and Its Application to Adaptive Modulation. 1151-1160
  
• Yingqun Yu, Georgios B. Giannakis, Nihar Jindal:
  Information-Bearing Noncoherently Modulated Pilots for MIMO Training. 1160-1168
  
• Pedro M. Crespo, Jesús Gutiérrez-Gutiérrez:
  On the Elementwise Convergence of Continuous Functions of Hermitian Banded Toeplitz Matrices. 1168-1176
  
• Daniel Marco, David L. Neuhoff:
  Low-Resolution Scalar Quantization for Gaussian Sources and Absolute Error. 1177-1179
  
• Jacob Binia:
  On Divergence-Power Inequalities. 1179-1182
  
• Salah A. Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli:
  On Quantum and Classical BCH Codes. 1183-1188
  
• Irina Naydenova, Torleiv Kløve:
  Generalized Bose-Lin Codes, a Class of Codes Detecting Asymmetric Errors. 1188-1193
  
• Eric Z. Chen:
  New Quasi-Cyclic Codes From Simplex Codes. 1193-1196
  
• Moshe Twitto, Igal Sason:
  On the Error Exponents of Improved Tangential Sphere Bounds. 1196-1210
  
• Hiren Maharaj:
  A Note on Further Improvements of the TVZ-Bound. 1210-1214
  
• Ali Abedi, Amir K. Khandani:
  Invariance Properties of Binary Linear Codes Over a Memoryless Channel With Discrete Input. 1215-1218
  
• Lasse Kiviluoto, Patric R. J. Östergård:
  New Uniquely Decodable Codes for the T-User Binary Adder Channel With 3<=T<=5. 1219-1220
  
• Young-Joon Kim, Hong-Yeop Song:
  Cross Correlation of Sidel'nikov Sequences and Their Constant Multiples. 1220-1224
  
• Xiaohu Tang, Parampalli Udaya, Pingzhi Fan:
  Generalized Binary Udaya-Siddiqi Sequences. 1225-1230
  
• Xiwang Cao:
  Some New Identities on Kloosterman Sums. 1230-1234
  
• James A. Muir:
  A Simple Left-to-Right Algorithm for Minimal Weight Signed Radix-r Representations. 1234-1241
  

Volume 53, Number 4, April 2007

• Tsachy Weissman, Erik Ordentlich, Marcelo J. Weinberger, Anelia Somekh-Baruch, Neri Merhav:
  Universal Filtering Via Prediction. 1253-1264
  
• Stephanie Pereira, Tsachy Weissman:
  Denoising and Filtering Under the Probability of Excess Loss Criterion. 1265-1281
  
• Stephen D. Howard, A. Robert Calderbank, William Moran:
  A Simple Signal Processing Architecture for Instantaneous Radar Polarimetry. 1282-1289
  
• Xinzhou Wu, R. Srikant:
  MIMO Channels in the Low-SNR Regime: Communication Rate, Error Exponent, and Signal Peakiness. 1290-1309
  
• Xinzhou Wu, R. Srikant:
  Asymptotic Behavior of Error Exponents in the Wideband Regime. 1310-1325
  
• Pierre Moulin, Ying Wang:
  Capacity and Random-Coding Exponents for Channel Coding With Side Information. 1326-1347
  
• Hon-Fah Chong, Mehul Motani, Hari Krishna Garg:
  Capacity Theorems for the "Z" Channel. 1348-1365
  
• Giuseppe Caire, Ralf R. Müller, Raymond Knopp:
  Hard Fairness Versus Proportional Fairness in Wireless Communications: The Single-Cell Case. 1366-1385
  
• Alan Pak Tao Lau, Frank R. Kschischang:
  Feedback Quantization Strategies for Multiuser Diversity Systems. 1386-1400
  
• Amir Salman Avestimehr, David N. C. Tse:
  Outage Capacity of the Fading Relay Channel in the Low-SNR Regime. 1401-1415
  
• Joseph B. Soriaga, Henry D. Pfister, Paul H. Siegel:
  Determining and Approaching Achievable Rates of Binary Intersymbol Interference Channels Using Multistage Decoding. 1416-1429
  
• Lara Dolecek, Venkat Anantharam:
  Using Reed-Muller RM(1, m) Codes Over Channels With Synchronization and Substitution Errors. 1430-1443
  
• Norifumi Kamiya:
  High-Rate Quasi-Cyclic Low-Density Parity-Check Codes Derived From Finite Affine Planes. 1444-1459
  
• Christine A. Kelley, Deepak Sridhara, Joachim Rosenthal:
  Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights. 1460-1478
  
• Jinghu Chen, R. M. Tanner, Juntan Zhang, Marc P. C. Fossorier:
  Construction of Irregular LDPC Codes by Quasi-Cyclic Extension. 1479-1483
  
• S. Freundlich, David Burshtein, Simon Litsyn:
  Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity. 1484-1494
  
• Moshe Twitto, Igal Sason, Shlomo Shamai:
  Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes. 1495-1510
  
• Badri N. Vellambi, Faramarz Fekri:
  Results on the Improved Decoding Algorithm for Low-Density Parity-Check Codes Over the Binary Erasure Channel. 1510-1520
  
• Nazanin Rahnavard, Badri N. Vellambi, Faramarz Fekri:
  Rateless Codes With Unequal Error Protection Property. 1521-1532
  
• Denis S. Krotov:
  On Z_2^k-Dual Binary Codes. 1532-1537
  
• Søren Forchhammer, T. V. Laursen:
  Entropy of Bit-Stuffing-Induced Measures for Two-Dimensional Checkerboard Constraints. 1537-1546
  
• Jessica J. Fridrich, Petr Lisonek:
  Grid Colorings in Steganography. 1547-1549
  
• Lei Zhao, Wei Mo, Yao Ma, Zhengdao Wang:
  Diversity and Multiplexing Tradeoff in General Fading Channels. 1549-1557
  
• Sunil Srinivasa, Syed Ali Jafar:
  The Optimality of Transmit Beamforming: A Unified View. 1558-1564
  
• Wen Jiang, Geoffrey Ye Li, Xingxing Yu:
  Truncation for Low-Complexity MIMO Signal Detection. 1564-1571
  
• Shivratna Giri Srinivasan, Mahesh K. Varanasi:
  Constellation Design for the Noncoherent MIMO Rayleigh-Fading Channel at General SNR. 1572-1584
  
• Jochen Giese, Mikael Skoglund:
  Single- and Multiple-Antenna Constellations for Communication Over Unknown Frequency-Selective Fading Channels. 1584-1594
  
• Volker Pauli, Lutz H.-J. Lampe:
  On the Complexity of Sphere Decoding for Differential Detection. 1595-1603
  
• Erwin Lutwak, Deane Yang, Gaoyong Zhang:
  Moment-Entropy Inequalities for a Random Vector. 1603-1607
  

Volume 53, Number 5, May 2007

• Ilan Sutskover, Shlomo Shamai, Jacob Ziv:
  Constrained Information Combining: Theory and Applications for LDPC Coded Systems. 1617-1643
  
• Juntan Zhang, Yige Wang, Marc P. C. Fossorier, Jonathan S. Yedidia:
  Iterative Decoding With Replicas. 1644-1663
  
• Neri Merhav, Meir Feder:
  Minimax Universal Decoding With an Erasure Option. 1664-1675
  
• H.-F. Lu, M. C. Chiu:
  Constructions of Asymptotically Optimal Space-Frequency Codes for MIMO-OFDM Systems. 1676-1688
  
• Yi Hong, Emanuele Viterbo, Jean-Claude Belfiore:
  Golden Space-Time Trellis Coded Modulation. 1689-1705
  
• Qing Zhang, Gang George Yin, John B. Moore:
  Two-Time-Scale Approximation for Wonham Filters. 1706-1715
  
• C. Yao, Po-Ning Chen, Tsang-Yi Wang, Yunghsiang S. Han, Pramod K. Varshney:
  Performance Analysis and Code Design for Minimum Hamming Distance Fusion in Wireless Sensor Networks. 1716-1734
  
• M. Kohler, A. Krzyak:
  On the Rate of Convergence of Local Averaging Plug-In Classification Rules Under a Margin Condition. 1735-1742
  
• Selçuk Kavut, Subhamoy Maitra, Melek D. Yücel:
  Search for Boolean Functions With Excellent Profiles in the Rotation Symmetric Class. 1743-1751
  
• Sondre Rønjom, Tor Helleseth:
  A New Attack on the Filter Generator. 1752-1758
  
• B. L. Luke, Phillip E. Pace:
  N-Sequence RSNS Ambiguity Analysis. 1759-1766
  
• Lingjia Liu, Parimal Parag, J. Tang, W.-Y. Chen, Jean-François Chamberland:
  Resource Allocation and Quality of Service Evaluation for Wireless Communication Systems Using Fluid Models. 1767-1777
  
• P.-K. Huang, C.-S. Chang, J. Cheng, D.-S. Lee:
  Recursive Constructions of Parallel FIFO and LIFO Queues With Switched Delay Lines. 1778-1798
  
• Stefano Lonardi, Wojciech Szpankowski, Mark Daniel Ward:
  Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments. 1799-1813
  
• Ashish Khisti, Uri Erez, Amos Lapidoth, Gregory W. Wornell:
  Carbon Copying Onto Dirty Paper. 1814-1827
  
• Anelia Somekh-Baruch, Neri Merhav:
  Achievable Error Exponents for the Private Fingerprinting Game. 1827-1838
  
• Tie Liu, Pramod Viswanath:
  An Extremal Inequality Motivated by Multiterminal Information-Theoretic Problems. 1839-1851
  
• Sumit Bhardwaj, Ruth J. Williams, Anthony S. Acampora:
  On the Performance of a Two-User MIMO Downlink System in Heavy Traffic. 1851-1859
  
• Jacob Ziv, Neri Merhav:
  On Context-Tree Prediction of Individual Sequences. 1860-1866
  
• L. Gyrfi, G. Ottucsk:
  Sequential Prediction of Unbounded Stationary Time Series. 1866-1872
  
• L. Gyrfi, M. Kohler:
  Nonparametric Estimation of Conditional Distributions. 1872-1879
  
• J. Mielniczuk, Piotr Wojdyllo:
  Decorrelation of Wavelet Coefficients for Long-Range Dependent Processes. 1879-1883
  
• Jay Cheng, Tien-Ke Huang, Claudio Weidmann:
  New Bounds on the Expected Length of Optimal One-to-One Codes. 1884-1895
  
• Manuel Cebrián, Manuel Alfonseca, Alfonso Ortega:
  The Normalized Compression Distance Is Resistant to Noise. 1895-1900
  
• N. Elron, Yonina C. Eldar:
  Optimal Encoding of Classical Information in a Quantum Medium. 1900-1907
  
• Oscar Moreno, Reza Omrani, P. Vijay Kumar, H.-f. Lu:
  A Generalized Bose-Chowla Family of Optical Orthogonal Codes and Distinct Difference Sets. 1907-1910
  
• Frédérique E. Oggier, Babak Hassibi:
  Algebraic Cayley Differential Space-Time Codes. 1911-1919
  
• Cícero Carvalho, Carlos Munuera, Ercilio da Silva, Fernando Torres:
  Near Orders and Codes. 1919-1924
  
• Kevin T. Phelps, Mercè Villanueva:
  Intersection of Hadamard Codes. 1924-1928
  
• Massimo Giulietti, Fabio Pasticci:
  Quasi-Perfect Linear Codes With Minimum Distance 4. 1928-1935
  
• H. Yoshikawa:
  Theoretical Analysis of Bit-Error Probability for Max-Log-MAP Decoding. 1935-1939
  

Volume 53, Number 6, June 2007

• Randall Dougherty, Christopher F. Freiling, Kenneth Zeger:
  Networks, Matroids, and Non-Shannon Information Inequalities. 1949-1969
  
• Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman:
  Interaction in Quantum Communication. 1970-1982
  
• Siddharth Ray, Muriel Médard, Lizhong Zheng:
  On Noncoherent MIMO Channels in the Wideband Regime: Capacity and Reliability. 1983-2009
  
• Simeon Furrer, Dirk Dahlhaus:
  Multiple-Antenna Signaling Over Fading Channels With Estimated Channel State Information: Performance Analysis. 2010-2027
  
• Simeon Furrer, Dirk Dahlhaus:
  Multiple-Antenna Signaling Over Fading Channels With Estimated Channel State Information: Capacity Analysis. 2028-2043
  
• Shuchin Aeron, Venkatesh Saligrama:
  Wireless Ad Hoc Networks: Strategies and Scaling Laws for the Fixed SNR Regime. 2044-2059
  
• W. S. Wong:
  New Protocol Sequences for Random-Access Channels Without Feedback. 2060-2071
  
• Andrew W. Eckford, Frank R. Kschischang, Subbarayan Pasupathy:
  A Partial Ordering of General Finite-State Markov Channels Under LDPC Decoding. 2072-2087
  
• Henry D. Pfister, Igal Sason:
  Accumulate-Repeat-Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity. 2088-2115
  
• Oscar Y. Takeshita:
  Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective. 2116-2132
  
• Hua Wang, Pramod Viswanath:
  Vector Gaussian Multiple Description With Individual and Central Receivers. 2133-2153
  
• Ramji Venkataramanan, S. Sandeep Pradhan:
  Source Coding With Feed-Forward: Rate-Distortion Theorems and Error Exponents for a General Source. 2154-2179
  
• Kenji Yamanishi, Yuko Maruyama:
  Dynamic Model Selection With its Applications to Novelty Detection. 2180-2189
  
• Andrzej K. Brodzik:
  Characterization of Zak Space Support of a Discrete Chirp. 2190-2203
  
• Antonio Napolitano:
  Estimation of Second-Order Cross-Moments of Generalized Almost-Cyclostationary Processes. 2204-2228
  
• Cunsheng Ding, Tor Helleseth, Torleiv Kløve, X. Wang:
  A Generic Construction of Cartesian Authentication Codes. 2229-2235
  
• Tor Helleseth, Alexander Kholosha, Geir Jarle Ness:
  Characterization of m-Sequences of Lengths 2^2k-1 and 2^k-1 With Three-Valued Cross Correlation. 2236-2245
  
• Xin Zhang, Jun Chen, Stephen B. Wicker, Toby Berger:
  Successive Coding in Multiuser Information Theory. 2246-2254
  
• Neri Merhav, Shlomo Shamai:
  Information Rates Subject to State Masking. 2254-2261
  
• Tomohiro Ogawa, Hiroshi Nagaoka:
  Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing. 2261-2266
  
• Patrick Solé, Virgilio Sison:
  Quaternary Convolutional Codes From Linear Block Codes Over Galois Rings. 2267-2270
  
• Patrick Solé, Virgilio Sison:
  Bounds on the Minimum Homogeneous Distance of the p^r-ary Image of Linear Block Codes Over the Galois Ring GR(p^r, m). 2270-2273
  
• Cunsheng Ding, Harald Niederreiter:
  Cyclotomic Linear Codes of Order 3. 2274-2277
  
• K. Murali Krishnan, Priti Shankar:
  Computing the Stopping Distance of a Tanner Graph Is NP-Hard. 2278-2280
  
• Luke McAven, Reihaneh Safavi-Naini:
  Classification of the Deletion Correcting Capabilities of Reed-Solomon Codes of Dimension 2 Over Prime Fields. 2280-2294
  
• Yuri L. Borissov, Moon Ho Lee:
  Bounds on Key Appearance Equivocation for Substitution Ciphers. 2294-2296
  
• Yun Kyoung Han, Jin-Ho Chung, Kyeongcheol Yang:
  On the k-Error Linear Complexity of p^m -Periodic Binary Sequences. 2297-2304
  
• Anke Feiten, Rudolf Mathar, Stephen V. Hanly:
  Eigenvalue-Based Optimum-Power Allocation for Gaussian Vector Channels. 2304-2309
  

Volume 53, Number 7, July 2007

• Mokshay M. Madiman, Andrew R. Barron:
  Generalized Entropy Power Inequalities and Monotonicity Properties of Information. 2317-2329
  
• Mattias Nilsson, W. Bastiaan Kleijn:
  On the Estimation of Differential Entropy From Data Located on Embedded Manifolds. 2330-2341
  
• Ulrich Faigle, Alexander Schönhuth:
  Asymptotic Mean Stationarity of Sources With Finite Evolution Dimension. 2342-2348
  
• Kaushik Chakraborty, Prakash Narayan:
  The Poisson Fading Channel. 2349-2364
  
• Nicolas Macris:
  Sharp Bounds on Generalized EXIT Functions. 2365-2375
  
• Roxana Smarandache, Pascal O. Vontobel:
  Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes. 2376-2393
  
• Igal Sason, Idan Goldenberg:
  Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes. 2394-2428
  
• Lan Lan, Lingqi Zeng, Ying Yu Tai, Lei Chen, Shu Lin, Khaled A. S. Abdel-Ghaffar:
  Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach. 2429-2458
  
• Xiang-dong Hou:
  On the Number of Inequivalent Binary Self-Orthogonal Codes. 2459-2479
  
• Sundeep B, Andrew Thangaraj:
  Self-Orthogonality of q-Ary Images of q^m-Ary Codes and Quantum Code Construction. 2480-2489
  
• Chadi Abou-Rjeily, Jean-Claude Belfiore:
  On Space-Time Coding With Pulse Position and Amplitude Modulations for Time-Hopping Ultra-Wideband Systems. 2490-2509
  
• Doron Blatt, Alfred O. Hero:
  On Tests for Global Maximum of the Log-Likelihood Function. 2510-2525
  
• Miroslaw Pawlak, Ulrich Stadtmüller:
  Signal Sampling and Recovery Under Dependent Errors. 2526-2541
  
• Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang:
  Lattice-Based Threshold Changeability for Standard Shamir Secret-Sharing Schemes. 2542-2559
  
• Maria Bras-Amorós, Michael E. O'Sullivan:
  On Semigroups Generated by Two Consecutive Integers and Improved Hermitian Codes. 2560-2566
  
• Dieter Britz, Thomas Britz, Keisuke Shiromoto, Henrik Kragh Sørensen:
  The Higher Weight Enumerators of the Doubly-Even, Self-Dual [48, 24, 12] Code. 2567-2571
  
• Ashwin Ganesan, Pascal O. Vontobel:
  On the Existence of Universally Decodable Matrices. 2572-2575
  
• Guang Gong, Solomon W. Golomb, Hong-Yeop Song:
  A Note on Low-Correlation Zone Signal Sets. 2575-2581
  
• Geir Jarle Ness, Tor Helleseth:
  A New Family of Ternary Almost Perfect Nonlinear Mappings. 2581-2586
  
• Xiangyong Zeng, John Q. Liu, Lei Hu:
  Generalized Kasami Sequences: The Large Set. 2587-2598
  
• Honggang Hu, Lei Hu, Dengguo Feng:
  On a Class of Pseudorandom Sequences From Elliptic Curves Over Finite Fields. 2598-2605
  
• Cunsheng Ding, Marko J. Moisio, Jin Yuan:
  Algebraic Constructions of Optimal Frequency-Hopping Sequences. 2606-2610
  
• Honggang Hu, Dengguo Feng:
  On Quadratic Bent Functions in Polynomial Forms. 2610-2615
  
• Ashutosh Sabharwal, Urbashi Mitra:
  Bounds and Protocols for a Rate-Constrained Relay Channel. 2616-2624
  
• Oren Somekh, Benjamin M. Zaidel, Shlomo Shamai:
  Spectral Efficiency of Joint Multiple Cell-Site Processors for Randomly Spread DS-CDMA Systems. 2625-2637
  
• Syed Ali Jafar, Maralle J. Fakhereddin:
  Degrees of Freedom for the MIMO Interference Channel. 2637-2642
  
• Guangyue Han, Brian H. Marcus:
  Derivatives of Entropy Rate in Special Families of Hidden Markov Chains. 2642-2652
  
• Stefan M. Moser:
  The Fading Number of Memoryless Multiple-Input Multiple-Output Fading Channels. 2652-2666
  

Volume 53, Number 8, August 2007

• Sarah Spence Adams, Nathaniel Karst, Jonathan Pollack:
  The Minimum Decoding Delay of Maximum Rate Complex Orthogonal Space-Time Block Codes. 2677-2684
  
• Yeow Meng Chee, Alan C. H. Ling, San Ling, Hao Shen:
  The PBD-Closure of Constant-Composition Codes. 2685-2692
  
• Eleni Drinea, Michael Mitzenmacher:
  Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels. 2693-2714
  
• Jochen Giese, Mikael Skoglund:
  Space-Time Constellation Design for Partial CSI at the Receiver. 2715-2731
  
• Masakazu Jimbo, Miwako Mishima, Susan Janiszewski, Amin Y. Teymorian, Vladimir D. Tonchev:
  On Conflict-Avoiding Codes of Length n=4m for Three Active Users. 2732-2742
  
• Thanh Tùng Kim, Mikael Skoglund:
  Diversity-Multiplexing Tradeoff in MIMO Channels With Partial CSIT. 2743-2759
  
• Ron M. Roth, Gadiel Seroussi:
  Bounds for Binary Codes With Narrow Distance Distributions. 2760-2768
  
• Yogesh Sankarasubramaniam, Steven W. McLaughlin:
  Fixed-Rate Maximum-Runlength-Limited Codes From Variable-Rate Bit Stuffing. 2769-2790
  
• Peter Dukes, Violet R. Syrotiuk, Charles J. Colbourn:
  Ternary Schedules for Energy-Limited Sensor Networks. 2791-2798
  
• S. P. Weber, Jeffrey G. Andrews, Xiangying Yang, Gustavo de Veciana:
  Transmission Capacity of Wireless Ad Hoc Networks With Successive Interference Cancellation. 2799-2814
  
• Libo Zhong, Fady Alajaji, Glen Takahara:
  A Binary Communication Channel With Memory Based on a Finite Queue. 2815-2840
  
• Tryphon T. Georgiou:
  The Maximum Entropy Principle in the Absence of a Time-Arrow: Fractional-Pole Models. 2841-2851
  
• Clayton Scott:
  Performance Measures for Neyman-Pearson Classification. 2852-2863
  
• Ahmad Bekir, Solomon W. Golomb:
  There Are No Further Counterexamples to S. Piccard's Theorem. 2864-2867
  
• Giuseppe Caire, Krishna R. Narayanan:
  On the Distortion SNR Exponent of Hybrid Digital-Analog Space-Time Coding. 2867-2878
  
• Marc P. C. Fossorier, James B. Nation, W. Wesley Peterson:
  A Note on the Optimality of Variant-I Permutation Modulation Codes. 2878-2879
  
• Wolfgang Haas:
  Lower Bounds for Binary Codes of Covering Radius One. 2880-2881
  
• Jørn Justesen:
  Upper Bounds on the Number of Errors Corrected by the Koetter-Vardy Algorithm. 2881-2885
  
• Sunghwan Kim, Jong-Seon No, Habong Chung, Dong-Joon Shin:
  Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than 12. 2885-2891
  
• Can Emre Koksal:
  An Analysis of Blocking Switches Using Error Control Codes. 2892-2897
  
• Huiyong Liao, Xiang-Gen Xia:
  Some Designs of Full Rate Space-Time Codes With Nonvanishing Determinant. 2898-2908
  
• Longjiang Qu, Chao Li, Keqin Feng:
  A Note on Symmetric Boolean Functions With Maximum Algebraic Immunity in Odd Number of Variables. 2908-2910
  
• Mehdi Ansari Sadrabadi, Mohammad Ali Maddah-Ali, Amir K. Khandani:
  On the Capacity of Time-Varying Channels With Periodic Feedback. 2910-2915
  
• Brooke Shrader, Anthony Ephremides:
  Random Access Broadcast: Stability and Throughput Analysis. 2915-2921
  
• Hung-Min Sun, Mu-En Wu, Wei-Chi Ting, M. Jason Hinek:
  Dual RSA and Its Security Analysis. 2922-2933
  
• Andrew Thangaraj, Souvik Dihidar, A. Robert Calderbank, Steven W. McLaughlin, Jean-Marc Merolla:
  Applications of LDPC Codes to the Wiretap Channel. 2933-2945
  
• Chao Tian, Suhas N. Diggavi:
  On Multistage Successive Refinement for Wyner-Ziv Source Coding With Degraded Side Informations. 2946-2960
  
• Tian Tian, Wen-Feng Qi:
  Injectivity of Compressing Maps on Primitive Sequences Over BBZ/(p^e). 2960-2966
  
• Tian Tian, Wen-Feng Qi:
  Period and Complementarity Properties of FCSR Memory Sequences. 2966-2970
  
• Poorvi L. Vora:
  An Information-Theoretic Approach to Inference Attacks on Random Data Perturbation and a Related Privacy Measure. 2971-2977
  
• Zhihang Yi, Il-Min Kim:
  Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks. 2977-2985
  
• Xuan Yong Zhu, Wen Feng Qi:
  Further Result of Compressing Maps on Primitive Sequences Modulo Odd Prime Powers. 2985-2990
  

Volume 53, Number 9, September 2007

• Asaf Cohen, Neri Merhav, Tsachy Weissman:
  Scanning and Sequential Decision Making for Multidimensional Data-Part I: The Noiseless Case. 3001-3020
  
• Antonio Assalini, Silvano Pupolin:
  A Unified SNR-Dependent Analysis of Space-Time Codes in Fading Channels. 3021-3034
  
• Keqin Feng, Jinquan Luo:
  Value Distributions of Exponential Sums From Perfect Nonlinear Functions and Their Applications. 3035-3041
  
• Carmen Martínez, Ramón Beivide, Ernst M. Gabidulin:
  Perfect Codes for Metrics Induced by Circulant Graphs. 3042-3052
  
• Frédérique E. Oggier:
  Cyclic Algebras for Noncoherent Differential Space-Time Coding. 3053-3065
  
• Jun Shi, Richard D. Wesel:
  A Study on Universal Codes With Finite Block Lengths. 3066-3074
  
• George N. Karystinos, Dimitrios A. Pados:
  Rank-2-Optimal Adaptive Design of Binary Spreading Codes. 3075-3080
  
• Zihuai Lin, Tor Aulin:
  On Joint Source and Channel Coding Using Trellis Coded CPM: Analytical Bounds on the Channel Distortion. 3081-3094
  
• Michael J. Neely:
  Optimal Energy and Delay Tradeoffs for Multiuser Wireless Downlinks. 3095-3113
  
• Sheng Yang, Jean-Claude Belfiore:
  Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme. 3114-3126
  
• Alexander Maximov, Thomas Johansson:
  A Linear Distinguishing Attack on Scream. 3127-3144
  
• Zvika Ben-Haim, Yonina C. Eldar:
  Blind Minimax Estimation. 3145-3157
  
• Ezio Biglieri, Marco Lops:
  Multiuser Detection in a Dynamic Environment- Part I: User Identification and Data Detection. 3158-3170
  
• Rebecca Willett, Robert D. Nowak:
  Multiscale Poisson Intensity and Density Estimation. 3171-3187
  
• Mark D. Plumbley:
  On Polar Polytopes and the Recovery of Sparse Representations. 3188-3195
  
• Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
  Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes. 3196-3201
  
• John B. Anderson, Tomas Eriksson, Norbert Goertz:
  On the BCJR Algorithm for Rate-Distortion Source Coding. 3201-3207
  
• Massimo Franceschetti:
  A Note on Lévéque and Telatar's Upper Bound on the Capacity of Wireless Ad Hoc Networks. 3207-3211
  
• Ghurumuruhan Ganesan, Geoffrey Ye Li, Frederick W. Vook:
  Stability Region of Multicarrier Channel Aware Aloha. 3212-3218
  
• Dumitru Mihai Ionescu, Zhiyuan Yan:
  Fading-Resilient Super-Orthogonal Space-Time Signal Sets: Can Good Constellations Survive in Fading? 3219-3225
  
• Hiroki Koga:
  Source Coding Using Families of Universal Hash Functions. 3226-3233
  
• Ping Luo, Guoxing Zhan, Qing He, Zhongzhi Shi, Kevin Lü:
  On Defining Partition Entropy by Inequalities. 3233-3239
  
• Kenji Nakagawa:
  Application of Tauberian Theorem to the Exponential Decay of the Tail Probability of a Random Variable. 3239-3249
  
• Yukiyasu Tsunoo, Teruo Saito, Hiroyasu Kubo, Tomoyasu Suzaki:
  A Distinguishing Attack on a Fast Software-Implemented RC4-Like Stream Cipher. 3250-3255
  
• Jinjun Xiao, Zhi-Quan Luo:
  Multiterminal Source-Channel Communication Over an Orthogonal Multiple-Access Channel. 3255-3264
  
• Zhiyu Yang, Lang Tong:
  On the Error Exponent and the Use of LDPC Codes for Cooperative Sensor Networks With Misinformed Nodes. 3265-3274
  
• Weiguo Yang, Zhongxing Ye:
  The Asymptotic Equipartition Property for Nonhomogeneous Markov Chains Indexed by a Homogeneous Tree. 3275-3280
  
• Zhengmin Zhang:
  Estimating Mutual Information Via Kolmogorov Distance. 3280-3282
  
• Zhijun Zhao, Richard E. Blahut:
  On the Asymptotic Consistency of Minimum Divergence and Least-Squares Principles. 3283-3287
  
• Andrzej K. Brodzik:
  Erratum to "Characterization of Zak Space Support of a Discrete Chirp" [Jun 07 2190-2203]. 3288
  

Volume 53, Number 10, October 2007

• Gerhard Kramer, Randall Berry, Abbas El Gamal, Hesham El Gamal, Massimo Franceschetti, Michael Gastpar, J. Nicholas Laneman:
  Introduction to the Special Issue on Models, Theory, and Codes for Relaying and Cooperation in Communication Networks [Guest Editorial]. 3297-3301
  
• Shashi Borade, Lizhong Zheng, Robert R. Gallager:
  Amplify-and-Forward in Wireless Relay Networks: Rate, Diversity, and Network Size. 3302-3318
  
• Veniamin I. Morgenshtern, Helmut Bölcskei:
  Crystallization in Large Wireless Networks. 3319-3349
  
• Syed Ali Jafar, Krishna Srikanth Gomadam, Chiachi Huang:
  Duality and Rate Optimization for Multiple Access and Broadcast Channels With Amplify-and-Forward Relays. 3350-3370
  
• Melda Yuksel, Elza Erkip:
  Multiple-Antenna Cooperative Wireless Systems: A Diversity-Multiplexing Tradeoff Perspective. 3371-3393
  
• Avi Steiner, Amichai Sanderovich, Shlomo Shamai:
  Broadcast Cooperation Strategies for Two Colocated Users. 3394-3412
  
• Abbas El Gamal, Navid Hassanpour, James P. Mammen:
  Relay Networks With Delays. 3413-3431
  
• Yingbin Liang, Venugopal V. Veeravalli, H. Vincent Poor:
  Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution. 3432-3453
  
• Deniz Gündüz, Elza Erkip:
  Source and Channel Coding for Cooperative Relaying. 3454-3475
  
• Lawrence Ong, Mehul Motani:
  Coding Strategies for Multiple-Access Channels With Feedback and Correlated Sources. 3476-3497
  
• Bobak Nazer, Michael Gastpar:
  Computation Over Multiple-Access Channels. 3498-3516
  
• Yingbin Liang, Gerhard Kramer:
  Rate Regions for Relay Broadcast Channels. 3517-3535
  
• Ivana Maric, Roy D. Yates, Gerhard Kramer:
  Capacity of Interference Channels With Partial Transmitter Cooperation. 3536-3548
  
• Ayfer Özgür, Olivier Lévêque, David N. C. Tse:
  Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks. 3549-3572
  
• Ayfer Özgür, Olivier Lévêque, Emmanuel Preissmann:
  Scaling Laws for One- and Two-Dimensional Random Wireless Networks in the Low-Attenuation Regime. 3573-3585
  
• Liang-Liang Xie, Panganamala R. Kumar:
  Multisource, Multidestination, Multirelay Wireless Networks. 3586-3595
  
• Omer Gurewitz, Alexandre de Baynast, Edward W. Knightly:
  Cooperative Strategies and Achievable Rate for Tree Networks With Optimal Spatial Reuse. 3596-3614
  
• Seung Jun Baek, Gustavo de Veciana:
  Spatial Model for Energy Burden Balancing and Data Fusion in Sensor Networks Detecting Bursty Events. 3615-3628
  
• Waheed Uz Zaman Bajwa, Jarvis Haupt, Akbar M. Sayeed, Robert Nowak:
  Joint Source-Channel Communication for Distributed Estimation in Sensor Networks. 3629-3653
  
• Nan Liu, Sennur Ulukus:
  Scaling Laws for Dense Gaussian Sensor Networks and the Order Optimality of Separation. 3654-3676
  
• Ahmed K. Sadek, K. J. Ray Liu, Anthony Ephremides:
  Cognitive Multiple Access Via Cooperation: Protocol Design and Performance Analysis. 3677-3696
  
• Yalin Evren Sagduyu, Anthony Ephremides:
  On Joint MAC and Network Coding in Wireless Ad Hoc Networks. 3697-3713
  
• Lei Xiao, Thomas E. Fuja, Jörg Kliewer, Daniel J. Costello Jr.:
  A Network Coding Approach to Cooperative Diversity. 3714-3722
  
• Lei Xiao, Thomas E. Fuja, Jörg Kliewer, D. Costello Razaghi, Wei Yu:
  Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels. 3723-3739
  
• Srinath Puducheri, Jörg Kliewer, Thomas E. Fuja:
  The Design and Performance of Distributed LT Codes. 3740-3754
  
• Mohamed Oussama Damen, Roger Hammons:
  Delay-Tolerant Distributed-TAST Codes for Cooperative Diversity. 3755-3773
  
• Edward C. van der Meulen, Peter Vanroose:
  The Capacity of a Relay Channel, Both With and Without Delay. 3774-3776
  
• Ramy Tannious, Aria Nosratinia:
  Relay Channel With Private Messages. 3777-3785
  
• George Atia, Masoud Sharif, Venkatesh Saligrama:
  On Optimal Outage in Relay Channels With General Fading Distributions. 3786-3797
  
• Tarik Tabet, Sanket Dusad, Raymond Knopp:
  Diversity-Multiplexing-Delay Tradeoff in Half-Duplex ARQ Relay Channels. 3797-3805
  
• Feng Xue, Sumeet Sandhu:
  Cooperation in a Half-Duplex Gaussian Diamond Relay Channel. 3806-3814
  
• Lalitha Sankar, Gerhard Kramer, Narayan B. Mandayam:
  Offset Encoding for Multiple-Access Relay Channels. 3814-3821
  
• Chris T. K. Ng, Nihar Jindal, Andrea J. Goldsmith, Urbashi Mitra:
  Capacity Gain From Two-Transmitter and Two-Receiver Cooperation. 3822-3827
  
• Edmund M. Yeh, Randall A. Berry:
  Throughput Optimal Control of Cooperative Relay Networks. 3827-3833
  
• Lingjia Liu, Parimal Parag, Jean-François Chamberland:
  Quality of Service Analysis for Wireless User-Cooperation Networks. 3833-3842
  

Volume 53, Number 11, November 2007

• Petros Elia, B. A. Sethuraman, P. Vijay Kumar:
  Perfect Space-Time Codes for Any Number of Antennas. 3853-3868
  
• Amin Mobasher, Mahmoud Taherzadeh, Renata Sotirov, Amir K. Khandani:
  A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming. 3869-3886
  
• Aris L. Moustakas, Steven H. Simon:
  On the Outage Capacity of Correlated Multiple-Path MIMO Channels. 3887-3903
  
• Tal Philosof, Ram Zamir:
  The Cost of Uncorrelation and Noncooperation in MIMO Channels. 3904-3920
  
• Chaoping Xing:
  Diagonal Lattice Space-Time Codes From Number Fields and Asymptotic Bounds. 3921-3926
  
• Mihir Bellare, Alexandra Boldyreva, K. Kurosawa, Jessica Staddon:
  Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security. 3927-3943
  
• Orr Dunkelman, Nathan Keller:
  A New Criterion for Nonlinearity of Block Ciphers. 3944-3957
  
• Jovan Dj. Golic:
  Exact Probabilistic Analysis of Memoryless Combiners. 3958-3972
  
• Mulan Liu, Liangliang Xiao, Zhifang Zhang:
  Multiplicative Linear Secret Sharing Schemes Based on Connectivity of Graphs. 3973-3978
  
• Zoran Cvetkovic, Ingrid Daubechies, Benjamin F. Logan:
  Single-Bit Oversampled A/D Conversion With Exponential Accuracy in the Bit Rate. 3979-3989
  
• Sorina Dumitrescu, Xiaolin Wu:
  Lagrangian Optimization of Two-Description Scalar Quantizers. 3990-4012
  
• Christine A. Kelley, Deepak Sridhara:
  Pseudocodewords of Tanner Graphs. 4013-4038
  
• Urs Niesen, Christina Fragouli, Daniela Tuninetti:
  On Capacity of Line Networks. 4039-4058
  
• Eirik Rosnes, Øyvind Ytrehus:
  Turbo Decoding on the Binary Erasure Channel: Finite-Length Analysis and Turbo Stopping Sets. 4059-4075
  
• Eran Sharon, Simon Litsyn, Jacob Goldberger:
  Efficient Serial Message-Passing Schedules for LDPC Decoding. 4076-4091
  
• Jay Cheng:
  Constructions of Fault-Tolerant Optical 2-to-1 FIFO Multiplexers. 4092-4105
  
• Yindi Jing, Hamid Jafarkhani:
  Using Orthogonal and Quasi-Orthogonal Designs in Wireless Relay Networks. 4106-4118
  
• Yue Shang, Xiang-Gen Xia:
  Limited-Shift-Full-Rank Matrices With Applications in Asynchronous Cooperative Communications. 4119-4126
  
• Steven Weber, Jeffrey G. Andrews, Nihar Jindal:
  The Effect of Fading, Channel Inversion, and Threshold Scheduling on Ad Hoc Networks. 4127-4149
  
• Shuangqing Wei:
  Diversity-Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks. 4150-4172
  
• Ying-Chang Liang, Guangming Pan, Z. D. Bai:
  Asymptotic Performance of MMSE Receivers for Large Systems Using Random Matrix Theory. 4173-4190
  
• Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win:
  Asymptotic Performance of a Censoring Sensor Network. 4191-4209
  
• Evgueni A. Haroutunian:
  On Bounds for E-Capacity of DMC. 4210-4220
  
• Chih-Peng Li, Wei-Chieh Huang:
  A Constructive Representation for the Fourier Dual of the Zadoff-Chu Sequences. 4221-4224
  
• Ohad Barak, David Burshtein:
  Lower Bounds on the Error Rate of LDPC Code Ensembles. 4225-4236
  
• Holger Boche, Volker Pohl:
  Spectral Factorization for Polynomial Spectral Densities - Impact of Dimension. 4236-4241
  
• Maria Bras-Amorós, Michael E. O'Sullivan:
  The Order Bound on the Minimum Distance of the One-Point Codes Associated to the Garcia-Stichtenoth Tower. 4241-4245
  
• Cunsheng Ding, Tao Feng:
  A Generic Construction of Complex Codebooks Meeting the Welch Bound. 4245-4250
  
• Masoud Ebrahimi, Mohammad Ali Maddah-Ali, Amir K. Khandani:
  Throughput Scaling Laws for Wireless Networks With Fading Channels. 4250-4254
  
• Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto:
  Improved Upper Bounds on Binary Identifying Codes. 4255-4260
  
• Solomon W. Golomb, Guang Gong:
  The Status of Costas Arrays. 4260-4265
  
• Praveen Kumar Gopala, Young-Han Nam, Hesham El Gamal:
  On the Error Exponents of ARQ Channels With Deadlines. 4265-4273
  
• Joakim Jalden, Björn E. Ottersten:
  On the Maximal Diversity Order of Spatial Multiplexing With Transmit Antenna Selection. 4273-4276
  
• Jørn Justesen, Tom Høholdt, Johann Hjaltason:
  Iterative List Decoding of Some LDPC Codes. 4276-4284
  
• Yong Li, Jaekyun Moon:
  Error Probability Bounds for Bit-Interleaved Space-Time Trellis Coding Over Block-Fading Channels. 4285-4292
  
• Konstantinos Limniotis, Nicholas Kolokotronis, Nicholas Kalouptsidis:
  On the Nonlinear Complexity and Lempel-Ziv Complexity of Finite Length Sequences. 4293-4302
  
• Conchita Martínez-Pérez, Wolfgang Willems:
  Self-Dual Doubly Even 2-Quasi-Cyclic Transitive Codes Are Asymptotically Good. 4302-4308
  
• Geir Jarle Ness, Tor Helleseth:
  A New Family of Four-Valued Cross Correlation Between m-Sequences of Different Lengths. 4308-4313
  
• Khoa D. Nguyen, Albert Guillen i Fabregas, Lars K. Rasmussen:
  A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels. 4314-4322
  
• Terasan Niyomsataya, Ali Miri, Monica Nevins:
  Unitary Space-Time Constellation Designs From Group Codes. 4322-4329
  
• Jennifer Price, Tara Javidi:
  Leveraging Downlink for Efficient Uplink Allocation in a Single-Hop Wireless Network. 4330-4339
  
• Søren Riis:
  Reversible and Irreversible Information Networks. 4339-4349
  
• Aviv Rosenzweig:
  The Capacity of Gaussian Multi-User Channels With State and Feedback. 4349-4355
  
• Shahab Sanayei, Aria Nosratinia:
  Capacity of MIMO Channels With Antenna Selection. 4356-4362
  
• Shahab Sanayei, Aria Nosratinia:
  Opportunistic Downlink Transmission With Limited Feedback. 4363-4372
  
• Shlomo Shamai, Ì. Emre Telatar, Sergio Verdú:
  Fountain Capacity. 4372-4376
  
• Yukiyasu Tsunoo, Teruo Saito, Hiroyasu Kubo, Tomoyasu Suzaki:
  Cryptanalysis of Mir-1: A T-Function-Based Stream Cipher. 4377-4383
  
• Michael Vielhaber:
  Continued Fraction Expansion as Isometry - The Law of the Iterated Logarithm for Linear, Jump, and 2-Adic Complexity. 4383-4391
  

Volume 53, Number 12, December 2007

• Jacob Ziv:
  Classification With Finite Memory Revisited. 4413-4421
  
• Joris M. Mooij, Hilbert J. Kappen:
  Sufficient Conditions for Convergence of the Sum-Product Algorithm. 4422-4437
  
• Xiaodong Lin, Jennifer Pittman, Bertrand Clarke:
  Information Conversion, Effective Samples, and Parameter Size. 4438-4456
  
• Yangfan Zhong, Fady Alajaji, L. Lorne Campbell:
  Joint Source-Channel Coding Error Exponent for Discrete Communication Systems With Markovian Memory. 4457-4472
  
• Oren Somekh, Benjamin M. Zaidel, Shlomo Shamai:
  Sum Rate Characterization of Joint Multiple Cell-Site Processing. 4473-4497
  
• Jun Chen, Venugopal V. Veeravalli:
  Capacity Results for Block-Stationary Gaussian Fading Channels With a Peak Power Constraint. 4498-4520
  
• Y. Cemal, Yossef Steinberg:
  Coding Problems for Channels With Partial State Information at the Transmitter. 4521-4536
  
• Arvind Sridharan, Dmitri V. Truhachev, Michael Lentmaier, Daniel J. Costello Jr., Kamil Sh. Zigangirov:
  Distance Bounds for an Ensemble of LDPC Convolutional Codes. 4537-4555
  
• Mei Chen, Teng Li, Oliver M. Collins:
  A Computationally Efficient Multilevel Coding Scheme for ISI Channels. 4556-4566
  
• Mahmoud Taherzadeh, Amin Mobasher, Amir K. Khandani:
  Communication Over MIMO Broadcast Channels Using Lattice-Basis Reduction. 4567-4582
  
• S. Sandeep Pradhan, Suhan Choi, Kannan Ramchandran:
  A Graph-Based Framework for Transmission of Correlated Sources Over Multiple-Access Channels. 4583-4604
  
• Cong Ling, Xiaofu Wu, Kwok H. Li, Alex ChiChung Kot:
  Gallager Bounds for Noncoherent Decoders in Fading Channels. 4605-4614
  
• Patrick Amihood, Elias Masry, Laurence B. Milstein, John G. Proakis:
  Performance Analysis of High Data Rate MIMO Systems in Frequency-Selective Fading Channels. 4615-4627
  
• Yingqun Yu, Georgios B. Giannakis:
  High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm. 4628-4639
  
• Sujay Sanghavi, Bruce Hajek, Laurent Massoulié:
  Gossiping With Multiple Messages. 4640-4654
  
• Joel A. Tropp, Anna C. Gilbert:
  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit. 4655-4666
  
• Dionissios T. Hristopulos, Samuel Elogne:
  Analytic Properties and Covariance Functions for a New Class of Generalized Gibbs Random Fields. 4667-4679
  
• Caroline Chaux, Jean-Christophe Pesquet, Laurent Duval:
  Noise Covariance Properties in Dual-Tree Wavelet Decompositions. 4680-4700
  
• Ramesh Annavajjala, Pamela C. Cosman, Laurence B. Milstein:
  Performance Analysis of Linear Modulation Schemes With Generalized Diversity Combining on Rayleigh Fading Channels With Noisy Channel Estimates. 4701-4727
  
• Marc P. C. Fossorier, Miodrag J. Mihaljevic, Hideki Imai:
  Modeling Block Decoding Approaches for the Fast Correlation Attack. 4728-4737
  
• Bernhard G. Bodmann, David W. Kribs, Vern I. Paulsen:
  Decoherence-Insensitive Quantum Communication by Optimal C^ast-Encoding. 4738-4749
  
• Murat Alanyali:
  Blocking Bounds for Random Channel Selection on Tree Topologies. 4750-4755
  
• Hassan Aly, Wilfried Meidl:
  On the Linear Complexity and k-Error Linear Complexity Over BBF_p of the d-ary Sidel'nikov Sequence. 4755-4761
  
• Bruno Clerckx, Claude Oestges:
  Finite-SNR Performance Analysis of Space-Time Coding in Correlated Ricean MIMO Channels. 4761-4777
  
• Andreas Faldum:
  On the Trustworthiness of Error-Correcting Codes. 4777-4784
  
• Philippe Langevin, Gregor Leander, Gary McGuire:
  A Counterexample to a Conjecture of Niho. 4785-4786
  
• Juyul Lee, Nihar Jindal:
  High SNR Analysis for MIMO Broadcast Channels: Dirty Paper Coding Versus Linear Precoding. 4787-4792
  
• Yuriy S. Shmaliy:
  On the Multivariate Conditional Probability Density of a Vector Perturbed by Gaussian Noise. 4792-4797
  
• Zhanjie Song, Wenchang Sun, Xingwei Zhou, Hengxin Hou:
  An Average Sampling Theorem for Bandlimited Stochastic Processes. 4798-4800
  
• Mahmoud Taherzadeh, Amin Mobasher, Amir K. Khandani:
  LLL Reduction Achieves the Receive Diversity in MIMO Decoding. 4801-4805
  
• William Thistleton, John A. Marsh, Kenric Nelson, Constantino Tsallis:
  Generalized Box-Müller Method for Generating q-Gaussian Random Deviates. 4805-4810
  
• Ertem Tuncel:
  Kraft Inequality and Zero-Error Source Coding With Decoder Side Information. 4810-4816
  
• Gerhard Wunder, Thomas Michel:
  Optimal Resource Allocation for Parallel Gaussian Broadcast Channels: Minimum Rate Constraints and Sum Power Minimization. 4817-4822
  
• Chaoping Xing, Sze Ling Yeo:
  New Linear Codes and Algebraic Function Fields Over Finite Fields. 4822-4825
  
• Lei Ying, R. Srikant, Geir E. Dullerud:
  Distributed Symmetric Function Computation in Noisy Wireless Sensor Networks. 4826-4833
  
• Mingrui Zhu, Keith M. Chugg:
  Bounds on the Expansion Properties of Tanner Graphs. 4834-4841
  

Last update Fri May 24 20:55:44 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page