Table of Contents

• In search of a unifying theory for image interpretationDonald Geman. [doi]
• Beyond genomics: Detecting codes and signals in the cellular transcriptome [Plenary speakers]Brendan J. Frey. [doi]
• What's New and Exciting in Algebraic and Combinatorial Coding Theory?Alexander Vardy. [doi]
• Some perspectives on computational and communication complexityAndrew C. Yao. [doi]
• Approximate Lattice Decoding: Primal Versus Dual Basis ReductionCong Ling 0001. 1-5 [doi]
• Decentralized Receiver in a MIMO systemAmichai Sanderovich, Shlomo Shamai, Yossef Steinberg, Michael Peleg. 6-10 [doi]
• Successive Decoding for Finite State Markov Modelled Flat Fading ChannelsTeng Li, Xiaowei Jin, Oliver M. Collins. 11-15 [doi]
• Design and Analysis of Multirate Layered Space-Time ArchitectureMathini Sellathurai, Tharmalingam Ratnarajah. 16-20 [doi]
• Distortion-Delay Tradeoff for a Gaussian Source Transmitted over a Fading ChannelQiang Li 0004, Costas N. Georghiades. 21-25 [doi]
• Gaussian Fading is the Worst FadingTobias Koch, Amos Lapidoth. 26-29 [doi]
• The Queued-Code in Finite-State Markov Fading Channels with Large Delay BoundsSatashu Goel, Rohit Negi. 30-34 [doi]
• The Case for Transmitter TrainingChristopher Steger, Ahmad Khoshnevis, Ashutosh Sabharwal, Behnaam Aazhang. 35-39 [doi]
• Low Complexity Encoding for Network CodesSidharth Jaggi, Yuval Cassuto, Michelle Effros. 40-44 [doi]
• The Capacity Region for Degree-2 K-pairs Three-layer NetworksXijin Yan, Zhen Zhang. 45-49 [doi]
• Optimality of Linear Codes for Broadcast-Mode Multicast NetworksRathinakumar Appuswamy, Massimo Franceschetti, Kenneth Zeger. 50-53 [doi]
• Explicit Inner and Outer Bounds for Multi-source Multi-sink Network CodingXijin Yan, Zhen Zhang, Jun Yang. 54-58 [doi]
• Feedback Capacity of Stationary Gaussian ChannelsYoung Han Kim. 59-63 [doi]
• Capacity of Finite-State Channels with Time-Invariant Deterministic FeedbackHaim H. Permuter, Tsachy Weissman, Andrea Goldsmith. 64-68 [doi]
• Noisy feedback improves communication reliabilityStark C. Draper, Anant Sahai. 69-73 [doi]
• Error Exponents for Variable-length block codes with feedback and cost constraintsBaris Nakiboglu, Robert G. Gallager, Moe Z. Win. 74-78 [doi]
• A Compact Construction for LDPC Codes using Permutation PolynomialsOscar Y. Takeshita. 79-82 [doi]
• Algebraic Constructions of Nonbinary Quasi-Cyclic LDPC CodesShumei Song, Lingqi Zeng, Shu Lin, Khaled A. S. Abdel-Ghaffar. 83-87 [doi]
• Low Density Lattice CodesNaftali Sommer, Meir Feder, Ofir Shalvi. 88-92 [doi]
• Design of non binary LDPC codes using their binary image: algebraic propertiesCharly Poulliat, Marc P. C. Fossorier, David Declercq. 93-97 [doi]
• Erasure EntropySergio Verdú, Tsachy Weissman. 98-102 [doi]
• Analyticity of Entropy Rate in Families of Hidden Markov Chains (II)Guangyue Han, Brian H. Marcus. 103-107 [doi]
• Maximum Entropy on Compact GroupsPeter Harremoës. 108-112 [doi]
• On Information Divergence Measures and a Unified TypicalitySiu-Wai Ho, Raymond W. Yeung. 113-117 [doi]
• There exists no always convergent algorithm for the calculation of spectral factorization, Wiener filter, and Hilbert transformHolger Boche, Volker Pohl. 118-122 [doi]
• Difference Sampling Theorems For a Class of Non-Bandlimited SignalsChen Meng, Jamal Tuqan. 123-127 [doi]
• Is the cyclic prefix necessary?Naresh Sharma, Ashok Armen Tikku. 128-132 [doi]
• Design Criteria for Linear Precoders based on a Bitwise Capacity ArgumentFrederik Simoens, Henk Wymeersch, Marc Moeneclaey. 133-137 [doi]
• List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexityIlya Dumer, Grigory Kabatiansky, Cédric Tavernier. 138-142 [doi]
• Improved Hermite multivariate polynomial interpolationPhilippe Gaborit, Olivier Ruatta. 143-147 [doi]
• Efficient erasure list-decoding of Reed-Muller codesPhilippe Gaborit, Olivier Ruatta. 148-152 [doi]
• Hard Fairness versus Proportional Fairness in Wireless Communications: the Single-Cell CaseGiuseppe Caire, Ralf R. Müller, Raymond Knopp. 153-157 [doi]
• Using Polymatroid Structures to Provide Fairness in Multiuser SystemsMohammad Ali Maddah-Ali, Amin Mobasher, Amir K. Khandani. 158-162 [doi]
• Fair Rate Allocation in Some Gaussian Multiaccess ChannelsKenneth W. Shum, Chi Wan Sung. 163-167 [doi]
• Adaptive Allocation of Pilot and Data Power for Time-Selective Fading Channels with FeedbackManish Agarwal, Michael L. Honig, Baris Ata. 168-172 [doi]
• Optimal Watermark Embedding and Detection Strategies Under Limited Detection ResourcesErez Sabbag, Neri Merhav. 173-177 [doi]
• Algorithms for Computing Joint Compression and Private Watermarking Rate RegionsWei Sun 0015, En-Hui Yang. 178-182 [doi]
• Information Embedding with Distortion Side InformationAshish Khisti, Emin Martinian, Gregory W. Wornell. 183-187 [doi]
• Reversible Information Embedding with Compressed Host at the DecoderYossef Steinberg. 188-191 [doi]
• Network Coding in Wireless Queueing Networks: Tandem Network CaseYalin Evren Sagduyu, Anthony Ephremides. 192-196 [doi]
• Comparison of Network Coding and Non-Network Coding Schemes for Multi-hop Wireless NetworksJia-qi Jin, Tracey Ho, Harish Viswanathan. 197-201 [doi]
• A Unified Channel-Network Coding Treatment for User Cooperation in Wireless Ad-Hoc NetworksXingkai Bao, Jing Li. 202-206 [doi]
• On Network Coding for Interference NetworksSandeep Bhadra, Piyush Gupta, Sanjay Shakkottai. 207-211 [doi]
• Silence Based Communication for Sensor NetworksAnand K. Dhulipala, Christina Fragouli, Alon Orlitsky. 212-216 [doi]
• Fault-Tolerance Analysis of a Wireless Sensor Network with Distributed Classification CodesPo-Ning Chen, Tsang-Yi Wang, Yunghsiang S. Han, Pramod K. Varshney, Chien Yao, Shin-Lin Shieh. 217-221 [doi]
• Cooperative Time-Reversal Communication is Order-Optimal for Data Aggregation in Wireless Sensor NetworksRichard J. Barton, Rong L. Zheng. 222-226 [doi]
• Packet Dropping Algorithms for Energy SavingsWanshi Chen, Urbashi Mitra, Michael J. Neely. 227-231 [doi]
• The final form of Tao's inequality relating conditional expectation and conditional mutual informationRudolf Ahlswede. 232 [doi]
• Six New Non-Shannon Information InequalitiesRandall Dougherty, Christopher F. Freiling, Kenneth Zeger. 233-236 [doi]
• All Inequalities for the Relative EntropyBen Ibinson, Noah Linden, Andreas J. Winter 0002. 237-241 [doi]
• A Nearest-Neighbor Approach to Estimating Divergence between Continuous Random VectorsQing Wang, Sanjeev R. Kulkarni, Sergio Verdú. 242-246 [doi]
• A New Class of Space-Time Codes via Orthogonal Designs, Circulant Basis, and Kronecker ProductDung Ngoc Dao, Chintha Tellambura. 247-251 [doi]
• Effective Coding Gain for Space-Time CodesJimmy Chui, A. Robert Calderbank. 252-256 [doi]
• A Space-Time Block Coded Multiuser MIMO Downlink Transmission SchemeYi Hong 0001, Emanuele Viterbo, Jean-Claude Belfiore. 257-261 [doi]
• Block Coded Modulation for Space-Time SignalingMohammad Janani, Aria Nosratinia. 262-266 [doi]
• On Estimating the Rate-Distortion FunctionMatthew T. Harrison, Ioannis Kontoyiannis. 267-271 [doi]
• Source Description CostHossein Kakavand, Abbas El Gamal. 272-276 [doi]
• The Interpretation of Spectral Entropy Based Upon Rate Distortion FunctionsJaewoo Jung, Jerry D. Gibson. 277-281 [doi]
• Rate Distortion Optimization of H.264 with Main Profile CompatibilityEn-Hui Yang, Xiang Yu 0001. 282-286 [doi]
• Asymptotic improvement of the Gilbert-Varshamov bound for binary linear codesPhilippe Gaborit, Gilles Zémor. 287-291 [doi]
• A bound for codes with given minimum and maximum distancesTor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein. 292-296 [doi]
• A New Upper Bound on the Rate of Non-Binary CodesYael Ben-Haim, Simon Litsyn. 297-301 [doi]
• A Lower Bound on the Probability of Undetected Error for Binary Constant Weight CodesShu-Tao Xia, Fang-Wei Fu, San Ling. 302-306 [doi]
• New Construction of Balanced Quasi-Cyclic Generalized Hadamard MatricesJi-Woong Jang, Jae Dong Yang, Jong-Seon No, Habong Chung. 307-310 [doi]
• Crosscorrelation of q-ary Power Residue Sequences of Period pYoung-Joon Kim, Hong-Yeop Song, Guang Gong, Habong Chung. 311-315 [doi]
• New Sets of Optimal p-ary Low Correlation Zone SequencesJi-Woong Jang, Jung-Soo Chung, Jong-Seon No, Habong Chung. 316-320 [doi]
• 2-ary Low Correlation Zone Sequences Using Unified SequencesJi-Woong Jang, Young-Sik Kim, Jong-Seon No, Habong Chung. 321-325 [doi]
• Upper Bound on Error Exponents with Delay for Lossless Source Coding with Side-InformationCheng Chang, Anant Sahai. 326-330 [doi]
• On the Role of Encoder Side-Information in Source Coding for Multiple DecodersEtienne Perron, Suhas N. Diggavi, I. Emre Telatar. 331-335 [doi]
• Successive Coding Strategy in the m-helper ProblemHamid Behroozi, M. Reza Soleymani. 336-340 [doi]
• A Lower Bound for Variable Rate Slepian-Wolf CodingDa-ke He, Luis Alfonso Lastras-Montaño, En-Hui Yang. 341-345 [doi]
• On Information Embedding When Watermarks and Covertexts Are CorrelatedEn-Hui Yang, Wei Sun 0015. 346-350 [doi]
• Random Binary Fingerprinting Codes for Arbitrarily Sized CoalitionsN. Prasanth Anthapadmanabhan, Alexander Barg. 351-355 [doi]
• Secrecy Capacity of Wireless ChannelsJoão Barros, Miguel R. D. Rodrigues. 356-360 [doi]
• On the Random Coding Exponent for Differential Modulation and DetectionSiddharth K. Srinivasan, Lutz Lampe, Volker Pauli. 361-365 [doi]
• Capacity Bounds for the Einstein Radiation ChannelAlfonso Martinez. 366-370 [doi]
• Information Theoretic Perspectives on SynchronizationAslan Tchamkerten, Ashish Khisti, Gregory W. Wornell. 371-375 [doi]
• Capacity of Beamforming with Limited Training and FeedbackWiroonsak Santipach, Michael L. Honig. 376-380 [doi]
• On the Maximal Rate of (n + 1) × n and (n + 2) × n Complex Orthogonal DesignsSmarajit Das, B. Sundar Rajan. 381-385 [doi]
• Space-time Linear Dispersion Using Coordinate InterleavingJinsong Wu, Steven D. Blostein. 386-390 [doi]
• Linear Precoding for Space-Time Coded MIMO Systems using Partial Channel State InformationJane W. Huang, Edward K. S. Au, Vincent K. N. Lau. 391-395 [doi]
• Versatile Precoder Codebook Design Method for Orthogonal Space-Time Block CodesEunmo Kang, Akbar M. Sayeed. 396-400 [doi]
• Upper Bounds on the Error Exponents of LDPC Code EnsemblesDavid Burshtein, Ohad Barak. 401-405 [doi]
• On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and ApplicationsIgal Sason, Gil Wiechman. 406-410 [doi]
• Upper Bounding the Performance of Arbitrary Finite LDPC Codes on Binary Erasure ChannelsChih-Chun Wang, Sanjeev R. Kulkarni, H. Vincent Poor. 411-415 [doi]
• On the Erasure Correction Capability of LDPC CodesDmitri K. Zigangirov, Kamil Sh. Zigangirov. 416-420 [doi]
• Prediction of Individual Sequences using Universal Deterministic Finite State MachinesAmir Ingber, Meir Feder. 421-425 [doi]
• Universal Context Tree Least Squares PredictionAndrew C. Singer, Suleyman Serdar Kozat. 426-430 [doi]
• Universal Scanning and Sequential Decision Making for Multidimensional DataAsaf Cohen 0001, Neri Merhav, Tsachy Weissman. 431-435 [doi]
• Compression-based Image RegistrationAnton Bardera, Miquel Feixas, Imma Boada, Mateu Sbert. 436-440 [doi]
• A quantum version of Feinstein's Theorem and its application to channel codingNilanjana Datta, Tony C. Dorlas. 441-445 [doi]
• (4, 1)-Quantum Random Access Coding Does Not ExistMasahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita. 446-450 [doi]
• Beyond i.i.d. in Quantum Information TheoryGarry Bowen, Nilanjana Datta. 451-455 [doi]
• Capacity of Quantum Arbitrarily Varying ChannelsRudolf Ahlswede, Vladimir M. Blinovsky. 456-458 [doi]
• Decoding Reed-Solomon Codes Beyond Half the Minimum Distance using Shift-Register SynthesisGeorg Schmidt, Vladimir Sidorenko, Martin Bossert. 459-463 [doi]
• Simple MAP Decoding of Binary Cyclic CodesAndrew Thangaraj. 464-468 [doi]
• Analysis of One Step Majority Logic Decoders Constructed From Faulty GatesShashi Kiran Chilappagari, Milos Ivkovic, Bane Vasic. 469-473 [doi]
• A Novel Method for Combining Algebraic Decoding and Iterative ProcessingXiangyu Tang, Ralf Koetter. 474-478 [doi]
• On Source Encoding with Side-information Under Ambiguous State of NaturePrakash Ishwar, Vinod M. Prabhakaran, Kannan Ramchandran. 479-483 [doi]
• Low-density constructions can achieve the Wyner-Ziv and Gelfand-Pinsker boundsEmin Martinian, Martin J. Wainwright. 484-488 [doi]
• Practical Compress-Forward in User Cooperation: Wyner-Ziv CooperationRuiyuan Hu, Jing Li. 489-493 [doi]
• Information Embedding in Degraded Broadcast ChannelsShivaprasad Kotagiri, J. Nicholas Laneman. 494-498 [doi]
• Estimating the Secrecy-Rate of Physical Unclonable Functions with the Context-Tree Weighting MethodTanya Ignatenko, Geert Jan Schrijen, Boris Skoric, Pim Tuyls, Frans M. J. Willems. 499-503 [doi]
• On the Power of Imperfect BroadcastMatthias Fitzi, Stefan Wolf 0001, Jürg Wullschleger. 504-505 [doi]
• On security of statistical databasesRudolf Ahlswede, Harout K. Aydinian. 506-508 [doi]
• Windowed Erasure CodesChris Studholme, Ian F. Blake. 509-513 [doi]
• Generating parity check equations for bounded-distance iterative erasure decodingHenk D. L. Hollmann, Ludo M. G. M. Tolhuizen. 514-517 [doi]
• Multilevel Coding for Channels with Non-uniform Inputs and Rateless Transmission over the BSCJing Jiang 0010, Krishna R. Narayanan. 518-522 [doi]
• Generalization of Rateless Codes for Unequal Error Protection and Recovery Time: Asymptotic AnalysisNazanin Rahnavard, Faramarz Fekri. 523-527 [doi]
• Rateless Coding and Perfect Rate-Compatible Codes for Gaussian ChannelsUri Erez, Mitchell D. Trott, Gregory W. Wornell. 528-532 [doi]
• Design of Space-Time Multi-Block Codes for MIMO Systems with Linear MMSE ReceiversJing Liu, Timothy N. Davidson, Kon Max Wong. 533-537 [doi]
• An Algebraic Family of Distributed Space-Time Codes for Wireless Relay NetworksFrédérique E. Oggier, Babak Hassibi. 538-541 [doi]
• Distributed Space-Time Codes with Reduced Decoding ComplexityT. Kiran, B. Sundar Rajan. 542-546 [doi]
• Partially-Coherent Distributed Space-Time Codes with Differential Encoder and DecoderT. Kiran, B. Sundar Rajan. 547-551 [doi]
• Instanton analysis of Low-Density Parity-Check codes in the error-floor regimeMikhail G. Stepanov, Michael Chertkov. 552-556 [doi]
• A Simpler Max-Product Maximum Weight Matching Algorithm and the Auction AlgorithmMohsen Bayati, Devavrat Shah, Mayank Sharma. 557-561 [doi]
• Analytic Determination of Scaling ParametersAbdelaziz Amraoui, Andrea Montanari, Rüdiger L. Urbanke. 562-566 [doi]
• EXIT Chart Analysis for Split-LDPC CodesKai Xie, Li Wang 0013, Gil I. Shamir, Joseph J. Boutros. 567-571 [doi]
• Average ML Asymptotic Performances of Different Serial Turbo EnsemblesFabio Fagnani, Roberto Garello, Federica Garin. 572-576 [doi]
• Joint Universal Lossy Coding and Identification of I.I.D. Vector SourcesMaxim Raginsky. 577-581 [doi]
• Shrink and Stretch Sequential Scalar (S4) QuantizersEado Meron, Meir Feder. 582-586 [doi]
• The Average Performance of the Minimax CodeMohammadali Khosravifard, Hossein Saidi, Morteza Esmaeili, T. Aaron Gulliver. 587-591 [doi]
• A Fast Algorithm for Adaptive Prefix CodingMarek Karpinski, Yakov Nekrich. 592-596 [doi]
• On Limited Memory Universal Classification of Individual SequencesJacob Ziv. 597-599 [doi]
• Simultaneous Iterative Water-Filling for Gaussian Frequency-Selective Interference ChannelsGesualdo Scutari, Daniel P. Palomar, Sergio Barbarossa. 600-604 [doi]
• Diversity and Coding Gain of Linear and Decision-Feedback Equalizers for Frequency-Selective SIMO ChannelsDirk T. M. Slock. 605-609 [doi]
• Autonomous Spectrum Balancing (ASB) for Frequency Selective Interference ChannelsJianwei Huang, Raphael Cendrillon, Mung Chiang, Marc Moonen. 610-614 [doi]
• Multilevel Coding for Nonlinear ISI ChannelsMei Chen, Oliver M. Collins. 615-619 [doi]
• Shared Sensing and Communications in Sensor Networks : The Multihop CaseSatish Vedantam, Urbashi Mitra, Ashutosh Sabharwal. 620-624 [doi]
• Asymptotically Optimal Distributed CensoringWee-Peng Tay, John N. Tsitsiklis, Moe Z. Win. 625-629 [doi]
• Dynamic Ad Hoc Network Localization Using Online Least Squares Kernel Subspace MethodsChaopin Zhu, Anthony Kuh. 630-634 [doi]
• Quantized ConsensusAkshay Kashyap, Tamer Basar, Rayadurgam Srikant. 635-639 [doi]
• Bayesian Sequential Detection for the BSC with Unknown Crossover ProbabilityJill K. Nelson, Andrew C. Singer. 640-644 [doi]
• From the Entropy to the Statistical Structure of Spike TrainsYun Gao, Ioannis Kontoyiannis, Elie Bienenstock. 645-649 [doi]
• Jitter Analysis of Timing Codes for Neurons with Descending Action Potential ThresholdsPrapun Suksompong, Toby Berger. 650-654 [doi]
• A Bayesian Constraint on Neural ComputationWilliam B. Levy, Danielle Morel. 655-658 [doi]
• Efficient representation as a design principle for neural coding and computationWilliam Bialek, Robert R. de Ruyter van Steveninck, Naftali Tishby. 659-663 [doi]
• Construction of Protograph LDPC Codes with Linear Minimum DistanceDariush Divsalar, Sam Dolinar, Christopher R. Jones 0001. 664-668 [doi]
• Doubly Generalized LDPC CodesYige Wang, Marc P. C. Fossorier. 669-673 [doi]
• A Combining Method of Structured LDPC Codes from Affine Permutation MatricesSeho Myung, Kyeongcheol Yang, Dong-Seek Park. 674-678 [doi]
• Generalized Construction of Quasi-Cyclic Regular LDPC Codes Based on Permutation MatricesErnst M. Gabidulin, Abdi Moinian, Bahram Honary. 679-683 [doi]
• Cross Layer Design For Multiaccess Communication Over Rayleigh Fading ChannelsVidyut Naware, Lang Tong. 684-688 [doi]
• Low SNR Capacity of Fading Channels with Peak and Average Power ConstraintsVignesh Sethuraman, Bruce E. Hajek. 689-693 [doi]
• Distortion Exponent of Parallel Fading ChannelsDeniz Gündüz, Elza Erkip. 694-698 [doi]
• Capacity Results for Block-Stationary Gaussian Fading ChannelsJun Chen, Venugopal V. Veeravalli. 699-703 [doi]
• Error exponents for recursive decoding of Reed-Muller codesMarat V. Burnashev, Ilya Dumer. 704-708 [doi]
• Improved Upper Bounds on the Reliability Function of the Gaussian ChannelYael Ben-Haim, Simon Litsyn. 709-713 [doi]
• Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block CodesMoshe Twitto, Igal Sason, Shlomo Shamai. 714-718 [doi]
• An Improved Bound on the List Error Probability and List Distance PropertiesIrina E. Bocharova, Boris D. Kudryashov, Maja Loncar, Rolf Johannesson. 719-723 [doi]
• Security of the GPT-Type CryptosystemsMaximilien Gadouleau, Zhiyuan Yan. 724-728 [doi]
• Public Key Cryptosystem based metrics associated with GRS CodesN. Catterall, Ernst M. Gabidulin, Bahram Honary, Vitaly A. Obernikhin. 729-733 [doi]
• Cryptographic Properties and Structure of Boolean Functions with Full Algebraic ImmunityClaude Carlet, Deepak Kumar Dalai, Subhamoy Maitra. 734-738 [doi]
• Authentication Schemes from Highly Nonlinear FunctionsClaude Carlet, Cunsheng Ding, Harald Niederreiter. 739-743 [doi]
• Writing on Fading Paper and Causal Transmitter CSIShashi Borade, Lizhong Zheng. 744-748 [doi]
• Iterative Algorithms for Finding the Stationary Points of the Dirty Tape ProblemMustafa Kesal, Siddhartha Mallik, Ralf Koetter. 749-753 [doi]
• Downlink User Capacity of Cellular Systems: TDMA vs Dirty Paper CodingSurendra Boppana, John M. Shea. 754-758 [doi]
• Broadcasting for Dirty PrintersKamal Elkhaili, Tsutomu Kawabata. 759-762 [doi]
• The Multimessage Unicast Capacity Region for Bidirectional Ring NetworksSerap A. Savari, Gerhard Kramer. 763-767 [doi]
• A Trellis Connectivity Analysis of Random Linear Network Coding with BufferingYunnan Wu. 768-772 [doi]
• On Achievable Information Rates in Single-Source Non-Uniform Demand NetworksChandra Chekuri, Christina Fragouli, Emina Soljanin. 773-777 [doi]
• Energy-Efficient Network Coding for the Noisy Channel NetworkMing Xiao, Tor M. Aulin. 778-782 [doi]
• Optimal Matrix Lattices for MIMO Codes from Division AlgebrasCamilla Hollanti, Jyrki T. Lahtonen, Kalle Ranto, Roope Vehkalahti. 783-787 [doi]
• Minimum-Decoding-Complexity, Maximum-rate Space-Time Block Codes from Clifford AlgebrasSanjay Karmakar, B. Sundar Rajan. 788-792 [doi]
• Non-Unitary-Weight Space-Time Block codes with Minimum Decoding ComplexitySanjay Karmakar, B. Sundar Rajan. 793-797 [doi]
• On Algorithmic Rate-Distortion FunctionNikolai K. Vereshchagin, Paul M. B. Vitányi. 798-802 [doi]
• Achieving the Gaussian Rate-Distortion Function by PredictionRam Zamir, Yuval Kochman, Uri Erez. 803-807 [doi]
• The Degree of Suboptimality of Sending a Lossy Version of the Innovations Process in Gauss-Markov Rate-DistortionKwang Taik Kim, Toby Berger. 808-812 [doi]
• Lossy Data Compression over Zq by LDPC CodeShigeki Miyake. 813-816 [doi]
• An Efficient Girth-Locating Algorithm for Quasi-Cyclic LDPC CodesXiaofu Wu, Xiaohu You, Chunming Zhao. 817-820 [doi]
• Approximately Lower Triangular Ensembles of LPDC Codes with Linear Encoding ComplexityShay Freundlich, David Burshtein, Simon Litsyn. 821-825 [doi]
• Optimal Puncturing of Block-Type LDPC Codes and Their Fast Convergence DecodingSong-Nam Hong, Hyeong-Gun Joo, Dong-Joon Shin. 826-830 [doi]
• Optimized Asymptotic Puncturing Distributions for Different LDPC Code ConstructionsGerd Richter, Stephan Stiglmayr, Martin Bossert. 831-835 [doi]
• Universal Quantile Estimation with Feedback in the Communication-Constrained SettingRam Rajagopal, Martin J. Wainwright, Pravin Varaiya. 836-840 [doi]
• Nonlinear Estimation for a Class of SystemsCharalambos D. Charalambous, Yiannis Socratous. 841-845 [doi]
• Optimal Least Squares Deterministic Parameter Estimation from a Class of Block-Circulant-with-Circulant-Block Linear ModelJwo-Yuh Wu, Ta-Sung Lee. 846-850 [doi]
• Maximum Likelihood DOA Estimation Based on the Cross-Entropy MethodYen-Chih Chen, Yu T. Su. 851-855 [doi]
• Low-Rate Repeat-Zigzag-Hadamard CodesKai Li 0009, Guosen Yue, Xiaodong Wang 0001, Ping Li 0009. 856-860 [doi]
• On the rank of LDPC matrices constructed by Vandermonde matrices and RS codesErnst M. Gabidulin, Martin Bossert. 861-865 [doi]
• Information Embedding Codes on Graphs with Iterative Encoding and DecodingVenkat Chandar, Emin Martinian, Gregory W. Wornell. 866-870 [doi]
• Which Codes Have 4-Cycle-Free Tanner Graphs?Thomas R. Halford, Keith M. Chugg, Alex J. Grant. 871-875 [doi]
• Information Capacity of MIMO Channels with Relative Entropy ConstraintCharalambos D. Charalambous, Stojan Z. Denic, Costas Constantinou. 876-880 [doi]
• A Proof of the Converse for the Capacity of Gaussian MIMO Broadcast ChannelsMehdi Mohseni, John M. Cioffi. 881-885 [doi]
• Sum Capacity of Multiuser MIMO Broadcast Channels with Block DiagonalizationZukang Shen, Runhua Chen, Jeffrey G. Andrews, Robert W. Heath Jr., Brian L. Evans. 886-890 [doi]
• Capacity Study of Non-Coherent MIMO ChannelsJianqiu Zhang. 891-895 [doi]
• Generalized Multilevel Constructions for Reed-Muller Codes and Barnes-Wall latticesAmir J. Salomon, Ofer Amrani. 896-900 [doi]
• Projective two-weight Cyclic or Constacyclic CodesJacques Wolfmann. 901-902 [doi]
• A new class of monomial bent functionsAnne Canteaut, Pascale Charpin, Gohar M. M. Kyureghyan. 903-906 [doi]
• A New Family of Codes and Generalized Kasami SequencesXiangyong Zeng, Qingchong Liu, Lei Hu. 907-911 [doi]
• Proposal of an Asymptotically Contrast-Ideal (t, n)- Threshold Visual Secret Sharing SchemeHiroki Koga, Etsuyo Ueda. 912-916 [doi]
• Multivariate Signature using Algebraic TechniquesFarshid Delgosha, Faramarz Fekri. 917-921 [doi]
• Integrated DH-like Key Exchange Protocols from LUC, GH and XTRKatrin Hoeper, Guang Gong. 922-926 [doi]
• Secure Dot-product Protocol Using Trace FunctionsBehzad Malek, Ali Miri. 927-931 [doi]
• On the Complexity of Sphere Decoding for MSDDVolker Pauli, Lutz Lampe. 932-936 [doi]
• Bandwidth-Efficient-Power-Greedy Joint Adaptive Modulation and Diversity CombiningHong-Chuan Yang, Nesrine Belhaj, Mohamed-Slim Alouini. 937-941 [doi]
• The Most Favorable Impulsive Interference for Ternary CDMAMoran Gariby, Tal Gariby, Ram Zamir. 942-946 [doi]
• Multipath Aided Rapid Acquisition Techniques for Spread Spectrum SignalsWatcharapan Suwansantisuk, Moe Z. Win. 947-951 [doi]
• Generalized Multiple Access Channels with Confidential MessagesYingbin Liang, H. Vincent Poor. 952-956 [doi]
• The Discrete Memoryless Multiple Access Channel with Confidential MessagesRuoheng Liu, Ivana Maric, Roy D. Yates, Predrag Spasojevic. 957-961 [doi]
• Capacity Results for Multiple Access Channels with State and FeedbackWei Wu, Sriram Vishwanath, Ari Arapostathis. 962-966 [doi]
• Rateless Coded Cooperation for Multiple-Access Channels in the Low Power RegimeZigui Yang, Anders Høst-Madsen. 967-971 [doi]
• Low Density Parity Check Codes over Half-duplex Relay ChannelsJun Hu, Tolga M. Duman. 972-976 [doi]
• On the Performance of Independently Designed LDPC Codes for the Relay ChannelJeremie Ezri, Michael Gastpar. 977-981 [doi]
• On the Theory and Practice of Data Recovery with Multiple VersionsMichael Mitzenmacher. 982-986 [doi]
• Distributed LT CodesSrinath Puducheri, Jörg Kliewer, Thomas E. Fuja. 987-991 [doi]
• Covering spheres and balls with smaller ballsIlya Dumer. 992-996 [doi]
• A bound on Grassmannian codesAlexander Barg, Dmitry Yu. Nogin. 997-1000 [doi]
• Multidimensional Second Order Reed-Muller Codes as Grassmannian PackingsAlexei Ashikhmin, A. Robert Calderbank, Wjatscheslaw Kewlin. 1001-1005 [doi]
• 8Lattice: A New 4×4 Space-Time Code with Non-vanishing DeterminantJiaping Liu, A. Robert Calderbank. 1006-1010 [doi]
• Proof of Entropy Power Inequalities Via MMSEDongning Guo, Shlomo Shamai, Sergio Verdú. 1011-1015 [doi]
• An Extremal Inequality Motivated by Multiterminal Information Theoretic ProblemsTie Liu, Pramod Viswanath. 1016-1020 [doi]
• The Monotonicity of Information in the Central Limit Theorem and Entropy Power InequalitiesMokshay Madiman, Andrew R. Barron. 1021-1025 [doi]
• On Achievable Sum Rates of A Multiuser MIMO Relay ChannelTaiwen Tang, Chan-Byoung Chae, Robert W. Heath Jr., Sunghyun Cho. 1026-1030 [doi]
• Symmetric Capacity of MIMO Downlink ChannelsJuyul Lee, Nihar Jindal. 1031-1035 [doi]
• The Ideal MIMO Channel: Maximizing Capacity in Sparse Multipath with Reconfigurable ArraysAkbar M. Sayeed, Vasanthan Raghavan. 1036-1040 [doi]
• Structure of Optimal Input Covariance Matrices for MIMO Systems with Covariance Feedback under General Correlated FadingIgor Bjelakovic, Holger Boche. 1041-1045 [doi]
• Performance of Rotated Lattice Constellations in Fading ChannelsAlbert Guillén i Fàbregas, Emanuele Viterbo. 1046-1050 [doi]
• Optimal Layered Transmission Over Quasi-Static Fading ChannelsFarzad Etemadi, Hamid Jafarkhani. 1051-1055 [doi]
• On the Fading Number of Multiple-Input Single-Output Fading Channels with MemoryStefan M. Moser. 1056-1060 [doi]
• Autoregressive Time-Varying Flat-Fading Channels: Model Order and Information Rate BoundsParastoo Sadeghi, Predrag B. Rapajic, Rodney A. Kennedy, Thushara D. Abhayapala. 1061-1065 [doi]
• AG Goppa Codes from Maximal Curves over determined Finite Fields of characteristic 2Robert J. McEliece, Mari Cruz Rodríguez-Palánquex. 1066-1069 [doi]
• A Generalization of Perfect Lee Codes over Gaussian IntegersCarmen Martínez, Miquel Moretó, Ramón Beivide, Ernst M. Gabidulin. 1070-1074 [doi]
• On the Construction of Integer Codes with Minimal Signal Point ConstellationsHiroyoshi Morita, Adriaan J. de Lind van Wijngaarden, Albert Geyser. 1075-1079 [doi]
• Fourier Transforms from a Weighted Trace MapKathy J. Horadam, Asha Rao. 1080-1084 [doi]
• Simple Tight Exponential Bounds on the First-Order Marcum Q-Function via the Geometric ApproachPooi Yuen Kam, Rong Li. 1085-1089 [doi]
• Computing and Bounding the Generalized Marcum Q-Function via a Geometric ApproachRong Li, Pooi Yuen Kam. 1090-1094 [doi]
• Error Event Characterization on 2-D ISI ChannelsIsmail Demirkan, Paul H. Siegel, Jack K. Wolf. 1095-1099 [doi]
• Union Bound Analysis of Bit Interleaved Coded Orthogonal Modulation with Differential PrecodingShi Cheng, Matthew C. Valenti. 1100-1104 [doi]
• Remarkable Degenerate Quantum Stabilizer Codes Derived from Duadic CodesSalah A. Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli. 1105-1108 [doi]
• Non-catastrophic Encoders and Encoder Inverses for Quantum Convolutional CodesMarkus Grassl, Martin Rötteler. 1109-1113 [doi]
• Primitive Quantum BCH Codes over Finite FieldsSalah A. Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli. 1114-1118 [doi]
• A New Minimum Weight Algorithm for Additive CodesGreg White, Markus Grassl. 1119-1123 [doi]
• On Rateless Coding over Fading Channels with Delay ConstraintsJeff Castura, Yongyi Mao, Stark C. Draper. 1124-1128 [doi]
• Rate-Compatible Puncturing of Finite-Length Low-Density Parity-Check CodesBadri N. Vellambi, Faramarz Fekri. 1129-1133 [doi]
• H-ARQ Rate-Compatible Structured LDPC CodesMostafa El-Khamy, Jilei Hou, Naga Bhushan. 1134-1138 [doi]
• Design of Rate-Compatible Irregular LDPC Codes for Incremental Redundancy Hybrid ARQ SystemsJaehong Kim, Woonhaing Hur, Aditya Ramamoorthy, Steven W. McLaughlin. 1139-1143 [doi]
• Diversity-Multiplexing Tradeoff in Rank-Deficient and Spatially Correlated MIMO ChannelsWoohyuk Chang, Sae-Young Chung, Yong-Hoon Lee. 1144-1148 [doi]
• Explicit Constructions of Multi-Block Space-Time Codes That Achieve The Diversity-Multiplexing TradeoffHsiao-feng Lu. 1149-1153 [doi]
• Diversity-Multiplexing Tradeoff in Multiple-Antenna Relay SystemsMelda Yuksel, Elza Erkip. 1154-1158 [doi]
• The Approximation of Outage Probability and the Trade-off between Capacity and Diversity for the Frequency-Selective ChannelZhifei Fan, Louis Scharf. 1159-1163 [doi]
• The Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy ConstraintsEnder Tekin, Aylin Yener. 1164-1168 [doi]
• The coding theorems for the Shannon cipher system with a guessing wiretapper and correlated source outputsYutaka Hayashi, Hirosuke Yamamoto. 1169-1173 [doi]
• Capacity and Random-Coding Error Exponent for Public Fingerprinting GameYing Wang, Pierre Moulin. 1174-1178 [doi]
• LDPC-based secret key agreement over the Gaussian wiretap channelMatthieu Bloch, Andrew Thangaraj, Steven W. McLaughlin, Jean-Marc Merolla. 1179-1183 [doi]
• Information Rates Subjected to State MaskingNeri Merhav, Shlomo Shamai. 1184-1188 [doi]
• A Model for the Two-Dimensional No Isolated Bits ConstraintSøren Forchhammer, Torben V. Laursen. 1189-1193 [doi]
• Bit Stuff Encoding for (0, G/I) ConstraintsYogesh Sankarasubramaniam, Steven W. McLaughlin. 1194-1198 [doi]
• Automated Theorem Proving for Hexagonal Run Length Constrained Capacity ComputationZsolt Kukorelly, Kenneth Zeger. 1199-1203 [doi]
• On Row-by-Row Coding for 2-D ConstraintsIdo Tal, Tuvi Etzion, Ron M. Roth. 1204-1208 [doi]
• New Properties of Complex Noncentral Quadratic Forms and Bounds on MIMO Mutual InformationMatthew R. McKay, Peter J. Smith, Iain B. Collings. 1209-1213 [doi]
• Finite-Rate Feedback MIMO Broadcast Channels with a Large Number of UsersTaesang Yoo, Nihar Jindal, Andrea Goldsmith. 1214-1218 [doi]
• On the Ergodic Capacity-Achieving Covariance Matrix of Certain Classes of MIMO ChannelsWonjong Rhee, Giorgio Taricco. 1219-1223 [doi]
• The Capacity Gain from Base Station Cooperative Scheduling in a MIMO DPC Cellular SystemWan Choi, Jeffrey G. Andrews. 1224-1228 [doi]
• LDPC Coding For The Three-Terminal Erasure Relay ChannelDeepak Sridhara, Christine A. Kelley. 1229-1233 [doi]
• Improving Amplify-and-Forward Relay Networks: Optimal Power Allocation versus SelectionYi Zhao, Raviraj Adve, Teng Joon Lim. 1234-1238 [doi]
• Half-Duplex Estimate-and-Forward Relaying: Bounds and Code DesignArnab Chakrabarti, Alexandre de Baynast, Ashutosh Sabharwal, Behnaam Aazhang. 1239-1243 [doi]
• A Low Complexity Protocol for Relay Channels Employing Rateless Codes and AcknowledgementYoujian Liu. 1244-1248 [doi]
• Using Improved Shannon-Fano-Elias Codes for Data EncryptionXiaoyu Ruan, Rajendra S. Katti. 1249-1252 [doi]
• Redundancy in homophonic coding and a new homophonic coding techniqueV. C. da Rocha, Cecilio Pimentel, D. P. B. A. Camara. 1253-1257 [doi]
• Renyi to Renyi - Source Coding under SiegeMichael B. Baer. 1258-1262 [doi]
• Worst-case Analysis of the Low-complexity Symbol Grouping Coding TechniqueAmir Said. 1263-1267 [doi]
• Epsilon-Capacity of a Class of Nonergodic ChannelsJohn Kieffer. 1268-1271 [doi]
• Non-asymptotic Capacity Lower Bound for Non-coherent SIMO Channels with MemoryJianqiu Zhang. 1272-1276 [doi]
• Capacity Theorems for the Gaussian Zigzag ChannelHon-Fah Chong, Mehul Motani, Hari Krishna Garg. 1277-1281 [doi]
• Water-filling is the Limiting Case of a General Capacity Maximization PrincipleAnke Feiten, Rudolf Mathar. 1282-1286 [doi]
• Calculation of Achievable Information Rates of Long-Haul Optical Transmission Systems using Instanton ApproachMilos Ivkovic, Ivan B. Djordjevic, Bane Vasic. 1287-1291 [doi]
• Binary self-dual extremal codes of length 92Radinka Yorgova. 1292-1295 [doi]
• s-Extremal Additive Codes over GF(4)Evangeline P. Bautista, Philippe Gaborit, Jon-Lark Kim, Judy L. Walker. 1296-1300 [doi]
• Self-Dual Codes over F3 and Negacirculant Conference MatricesK. T. Arasu, Yu Qing Chen, T. Aaron Gulliver, Weilai Song. 1301-1304 [doi]
• Multi-Keyhole MIMO Channels: Asymptotic Analysis of Outage CapacityGeorge Levin, Sergey Loyka. 1305-1309 [doi]
• How much feedback is required in MIMO Broadcast Channels?Alireza Bayesteh, Amir K. Khandani. 1310-1314 [doi]
• Note On Mutual Information and Orthogonal Space-Time CodesGuy Bresler, Bruce E. Hajek. 1315-1318 [doi]
• Scheduling Gain in Spatial Diversity Systems: Asymptotic AnalysisHuaiyu Dai, Quan Zhou 0002. 1319-1323 [doi]
• Rate-Adaptive CPM with Punctured LDGM Codes in Slow-Fading ChannelsMing Xiao, Tor M. Aulin. 1324-1328 [doi]
• A Geometry-Inclusive Fading Model for Random Wireless NetworksMartin Haenggi. 1329-1333 [doi]
• Fading Multiple Access Channels: A Game Theoretic PerspectiveLifeng Lai, Hesham El Gamal. 1334-1338 [doi]
• Outage Probabilities and Finite-SNR Diversity Gains in Rate-Adaptive Fading Multiple Access ChannelsRavi Narasimhan. 1339-1343 [doi]
• On the Switching Gap of Ahlswede-Cai-Li-Yeung's Single-Source Multicast NetworkXue-Bin Liang. 1344-1348 [doi]
• On Constructive Multi-Source Network CodingYunnan Wu. 1349-1353 [doi]
• Computing over Multiple-Access Channels with Connections to Wireless Network CodingBobak Nazer, Michael Gastpar. 1354-1358 [doi]
• Network Coding for Joint Storage and Transmission with Minimum CostAnxiao Jiang. 1359-1363 [doi]
• Pseudo-Codewords in LDPC Convolutional CodesRoxana Smarandache, Ali Emre Pusane, Pascal O. Vontobel, Daniel J. Costello Jr.. 1364-1368 [doi]
• Guessing Facets: Polytope Structure and Improved LP DecoderAlexandros G. Dimakis, Martin J. Wainwright. 1369-1373 [doi]
• Adaptive Linear Programming DecodingMohammad H. Taghavi, Paul H. Siegel. 1374-1378 [doi]
• Pseudocodeword weights for non-binary LDPC codesChristine A. Kelley, Deepak Sridhara, Joachim Rosenthal. 1379-1383 [doi]
• Optimum Subcarrier Grouping and Rotation Matrix for Coded OFDM with Modulation DiversityNghi H. Tran, Ha H. Nguyen, Tho Le-Ngoc. 1384-1388 [doi]
• Turbo TCM Coded OFDM Systems for Non-Gaussian ChannelsYanxia Wang, Lei Wei 0003. 1389-1393 [doi]
• Optimal Resource Allocation for OFDMA Downlink SystemsKibeom Seong, Mehdi Mohseni, John M. Cioffi. 1394-1398 [doi]
• Large System Performance of Downlink OFDMA with Limited FeedbackJieying Chen, Randall A. Berry, Michael L. Honig. 1399-1403 [doi]
• Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding ProblemAaron B. Wagner, Saurabha Tavildar, Pramod Viswanath. 1404-1408 [doi]
• Gaussian Multiterminal Source Coding with Several Side Informations at the DecoderYasutada Oohama. 1409-1413 [doi]
• On the Rate Loss of Multiterminal Source CodesHanying Feng. 1414-1418 [doi]
• An Outer Bound for the Multi-Terminal Rate-Distortion RegionWei Kang 0002, Sennur Ulukus. 1419-1423 [doi]
• The Single-Serving Channel CapacityRenato Renner, Stefan Wolf 0001, Jürg Wullschleger. 1424-1427 [doi]
• On the Oblivious Transfer Capacity of the Erasure ChannelHideki Imai, Kirill Morozov, Anderson C. A. Nascimento. 1428-1431 [doi]
• Efficient Protocols Achieving the Commitment Capacity of Noisy CorrelationsHideki Imai, Kirill Morozov, Anderson C. A. Nascimento, Andreas Winter. 1432-1436 [doi]
• Bit Commitment over Gaussian ChannelsJoão Barros, Hideki Imai, Anderson C. A. Nascimento, Stefan Skludarek. 1437-1441 [doi]
• Joint Beamforming and Scheduling for a MIMO Downlink with Random ArrivalsMari Kobayashi, Giuseppe Caire. 1442-1446 [doi]
• Optimal Operating Point in MIMO Channel for Delay-Sensitive and Bursty TrafficSomsak Kittipiyakul, Tara Javidi. 1447-1451 [doi]
• Degrees of Freedom for the MIMO Interference ChannelSyed Ali Jafar, Maralle J. Fakhereddin. 1452-1456 [doi]
• A Capacity-Based Approach for Designing Bit-Interleaved Coded GFSK with Noncoherent DetectionRohit Iyer Seshadri, Matthew C. Valenti. 1457-1461 [doi]
• On the Capacity of Precision-Resolution Constrained SystemsMoshe Schwartz 0001, Jehoshua Bruck. 1462-1466 [doi]
• The Positive Capacity Region of Two-Dimensional Run Length Constrained ChannelsKeren Censor, Tuvi Etzion. 1467-1471 [doi]
• Capacity Lower Bounds for Two-Dimensional M-ary (0, k) and (d, ∞) Runlength-limited ChannelsShayan G. Srinivasa, Steven W. McLaughlin. 1472-1476 [doi]
• On the Shannon Covers of Certain Irreducible Constrained Systems of Finite TypeAkiko Manada, Navin Kashyap. 1477-1481 [doi]
• On q-ary fix-free codes and directed deBrujin graphsChristian Deppe, Holger Schnettler. 1482-1485 [doi]
• On (d, k) Sequences Not Containing a Given WordPhilippe Jacquet, Wojciech Szpankowski. 1486-1489 [doi]
• Minimum Distance of Codes and Their Branching Program ComplexityNandakishore Santhi, Alexander Vardy. 1490-1494 [doi]
• Optimal Parsing Trees for Run-Length Coding of Biased DataSharon Aviran, Paul H. Siegel, Jack K. Wolf. 1495-1499 [doi]
• Capacity of Underspread WSSUS Fading Channels in the Wideband RegimeGiuseppe Durisi, Helmut Bölcskei, Shlomo Shamai. 1500-1504 [doi]
• Energy-Efficient Resource Allocation in TDMA over Fading ChannelsXin Wang 0003, Georgios B. Giannakis. 1505-1509 [doi]
• Simple Expressions for the Correlation between Fading Channel Error RatesAlan Clark, Desmond P. Taylor, Peter J. Smith. 1510-1513 [doi]
• Non-Ergodic Power-Bandwidth Tradeoff in Linear Multi-hop NetworksOzgur Oyman, Sumeet Sandhu. 1514-1518 [doi]
• Weighted Norms of Ambiguity Functions and Wigner DistributionsPeter Jung. 1519-1523 [doi]
• A lower bound on the mean squared correlations for band-limited asynchronous DS/CDMA systemsYutaka Jitsumatsu, Tohru Kohda. 1524-1528 [doi]
• Compound Pulse Position Modulation CodesSam Dolinar, Kenneth S. Andrews. 1529-1533 [doi]
• Optimal Distortion-Power Tradeoffs in Gaussian Sensor NetworksNan Liu, Sennur Ulukus. 1534-1538 [doi]
• Analog Matching of Colored Sources to Colored ChannelsYuval Kochman, Ram Zamir. 1539-1543 [doi]
• Stopping Set Enumerators of Full-Rank Parity-Check Matrices of Hamming CodesKhaled A. S. Abdel-Ghaffar, Jos H. Weber. 1544-1548 [doi]
• On the minimum distance of structured LDPC codes with two variable nodes of degree 2 per parity-check equationJean-Pierre Tillich, Gilles Zémor. 1549-1553 [doi]
• Ensemble Weight Enumerators for Protograph LDPC CodesDariush Divsalar. 1554-1558 [doi]
• Ensemble Analysis on Syndrome Entropy of Binary Linear CodesTadashi Wadayama. 1559-1563 [doi]
• Ordered Eigenvalues of Complex Noncentral Wishart Matrices and Performance Analysis of SVD MIMO SystemsShi Jin, Xiqi Gao, Matthew R. McKay. 1564-1568 [doi]
• Utilizing Channel Mean Information with MMSE detection for LDC in MIMO systemsAydin Sezgin, Eduard A. Jorswieck, Holger Boche, Elena Costa. 1569-1573 [doi]
• How Much Does Transmit Correlation Affect the Sum-Rate of MIMO Downlink Channels?Tareq Y. Al-Naffouri, Masoud Sharif, Babak Hassibi. 1574-1578 [doi]
• Calculating and Achieving Capacity on the Unknown Fading MIMO ChannelRavi-Kiran Gopalan, Krishnan Padmanabhan, Shyam Ranganathan, Oliver M. Collins. 1579-1583 [doi]
• Multiple Descriptions in the Wyner-Ziv SettingJia Wang 0004, Xiaolin Wu 0001, Songyu Yu, Jun Sun 0005. 1584-1588 [doi]
• Vector Gaussian Multiple Description with Individual and Central ReceiversHua Wang, Pramod Viswanath. 1589-1593 [doi]
• Multistage successive refinement for Wyner-Ziv source coding with degraded side informationsChao Tian, Suhas N. Diggavi. 1594-1598 [doi]
• On the Concavity of Rate Regions for Lossless Source Coding in NetworksWei-Hsin Gu, Michelle Effros. 1599-1603 [doi]
• Cryptographic Properties of Stream Ciphers Based on T-functionsNicholas Kolokotronis. 1604-1608 [doi]
• Related-Key Linear CryptanalysisPoorvi L. Vora, Darakhshan J. Mir. 1609-1613 [doi]
• A Stream Cipher Proposal: Grain-128Martin Hell, Thomas Johansson 0001, Alexander Maximov, Willi Meier. 1614-1618 [doi]
• A New Variant of the Self-Shrinking GeneratorBin Zhang, Dengguo Feng. 1619-1622 [doi]
• Irregular Puncturing for Convolutional Codes and the Application to Unequal Error ProtectionChung-Hsuan Wang, Shih-Chieh Wang, Yun-Liang Chang. 1623-1627 [doi]
• The Single Parity Check Code in Concatenation with Non-Recursive Inner Convolutional CodesAnders Nilsson, Tor M. Aulin. 1628-1632 [doi]
• Irregular Low-Density Parity-Check Convolutional Codes Based on ProtographsGerd Richter, Markus Kaupper, Kamil Sh. Zigangirov. 1633-1637 [doi]
• On the Free Distance of Convolutional Turbo CodesAxel Hübner, Kamil Sh. Zigangirov, Daniel J. Costello Jr.. 1638-1642 [doi]
• Doubly Periodic Arrays and a New Construction of Multiple Target Sonar and Extended Costas Arrays with Perfect CorrelationOscar Moreno, Reza Omrani, Svetislav V. Maric. 1643-1647 [doi]
• Weil Sequences: A Family of Binary Sequences with Good Correlation PropertiesJoseph J. Rushanan. 1648-1652 [doi]
• Three-Valued Crosscorrelation Between m-Sequences of Different LengthsGeir Jarle Ness, Tor Helleseth. 1653-1657 [doi]
• The Peak Sidelobe Level of Families of Binary SequencesJonathan Jedwab, Kayo Yoshida. 1658-1662 [doi]
• On the Discrete Memoryless Relay Channel with Relay-Transmitter FeedbackYacov Gabbai, Shraga I. Bross. 1663-1667 [doi]
• Achievable Rate Regions for the Two-way Relay ChannelBoris Rankov, Armin Wittneben. 1668-1672 [doi]
• The Capacity of the Single Source Multiple Relay Single Destination Mesh NetworkLawrence Ong, Mehul Motani. 1673-1677 [doi]
• Parity Forwarding For Multiple-Relay NetworksPeyman Razaghi, Wei Yu 0001. 1678-1682 [doi]
• On the Achievable Throughput in Two-Scale Wireless NetworksRadhika Gowaikar, Babak Hassibi. 1683-1687 [doi]
• The Impact of Link Layer Model on the Capacity of a Random Ad hoc NetworkVivek P. Mhatre, Catherine P. Rosenberg. 1688-1692 [doi]
• The Effect of Node Density and Propagation Model on Throughput Scaling of Wireless NetworksEnrique J. Duarte-Melo, Awlok Josan, Mingyan Liu, David L. Neuhoff, S. Sandeep Pradhan. 1693-1697 [doi]
• Scaling Laws for Line Networks: From Zero-Error to Min-Cut CapacityUrs Niesen, Christina Fragouli, Daniela Tuninetti. 1698-1702 [doi]
• Computational Performance of Various Formulations of the Iterative Soft-Decision Decoder AlgorithmRaymond Moberly, Michael O'Sullivan. 1703-1707 [doi]
• Turbo-like Decoding Algorithm for Structured LDPC codesAjit Nimbalker, Yufei W. Blankenship, Brian K. Classon. 1708-1712 [doi]
• Efficient Message-Passing Decoding of LDPC Codes using Vector-based MessagesMats Tjader, Mikael Grimnell, Danyo Danev, Hugo M. Tullberg. 1713-1717 [doi]
• Burst-Correction Decoding of Cyclic LDPC CodesShumei Song, Shu Lin, Khaled A. S. Abdel-Ghaffar. 1718-1722 [doi]
• On Cosets of the Generalized First-Order Reed-Muller Code with Low PMEPRKai-Uwe Schmidt. 1723-1727 [doi]
• On the PMEPR of Phase-Shifted Binary CodesKai-Uwe Schmidt. 1728-1732 [doi]
• Two NP-complete Problems in Coding Theory with an Application in Code Based CryptographyChristian Wieschebrink. 1733-1737 [doi]
• Multi-Sequence Linear Shift-Register Synthesis: The Varying Length CaseGeorg Schmidt, Vladimir R. Sidorenko. 1738-1742 [doi]
• On Convolutional Network CodingShuo-Yen Robert Li, Raymond W. Yeung. 1743-1747 [doi]
• Information Dissemination via Network CodingDamon Mosk-Aoyama, Devavrat Shah. 1748-1752 [doi]
• Online Network Coding for the Dynamic Multicast ProblemFang Zhao 0001, Muriel Médard. 1753-1757 [doi]
• Network Coding for Multiple Unicasts: An Approach based on Linear OptimizationDanail Traskov, Niranjan Ratnakar, Desmond S. Lun, Ralf Koetter, Muriel Médard. 1758-1762 [doi]
• The Error Propagation of Bit-Stuff Coding SystemsPeter Vámos, Laszlo Osvath. 1763-1767 [doi]
• Error control codes for parallel asymmetric channelsRudolf Ahlswede, Harout K. Aydinian. 1768-1772 [doi]
• ARQ Protocols and Unidirectional CodesMadhusudhanan Anantha, Bella Bose, Luca G. Tallini. 1773-1777 [doi]
• Coding Schemes for Data Transmission over Bus SystemsVladimir B. Balakirsky, A. J. Han Vinck. 1778-1782 [doi]
• Linear Programming Detection and Decoding for MIMO SystemsTao Cui, Tracey Ho, Chintha Tellambura. 1783-1787 [doi]
• MIMO Broadcast Scheduling with Quantized Channel State InformationCharles H. Swannack, Gregory W. Wornell, Elif Uysal-Biyikoglu. 1788-1792 [doi]
• Outage Analysis for MIMO Rician Channels and Channels with Partial CSIWon-Yong Shin, Sae-Young Chung, Yong H. Lee. 1793-1797 [doi]
• Constellation Design for the Noncoherent MIMO Rayleigh Fading Channel at General SNRShivratna Giri Srinivasan, Mahesh K. Varanasi. 1798-1802 [doi]
• Serial concatenation with simple block inner codesMarcin Sikora, Daniel J. Costello Jr.. 1803-1807 [doi]
• Encoders and Decoders for Braided Block CodesKamil Sh. Zigangirov, Alberto Jiménez Feltström, Michael Lentmaier, Dmitri V. Truhachev. 1808-1812 [doi]
• Block Turbo Codes: From Architecture to ApplicationBenoit Geller, Ibrahima Diatta, Jean-Pierre Barbot, Christophe Vanstraceele, François Rambeau. 1813-1816 [doi]
• Trellis Codes with Low Ones Density for the OR Multiple Access ChannelMiguel Griot, Andres I. Vila Casado, Wen-Yen Weng, Herwin Chan, Juthika Basak, Eli Yablonovitch, Ingrid Verbauwhede, Braham Jalali, Richard D. Wesel. 1817-1821 [doi]
• A Geometric Characterization of Maximum Rényi Entropy DistributionsChristophe Vignat, Alfred O. Hero III, Jose A. Costa. 1822-1826 [doi]
• Rényi Entropies of ProjectionsPeter Harremoës, Christophe Vignat. 1827-1830 [doi]
• Rényi's Entropy and Error Exponent of Source Coding with Countably Infinite AlphabetHidetoshi Shimokawa. 1831-1835 [doi]
• Information-theoretic and Set-theoretic SimilarityLuca Cazzanti, Maya R. Gupta. 1836-1840 [doi]
• Capacity Limits of Multiple Antenna MulticastNihar Jindal, Zhi-Quan Luo. 1841-1845 [doi]
• Uniform Multi-commodity Flow in Wireless Networks with Gaussian Fading ChannelsOlivier Lévêque, Ritesh Madan, Devavrat Shah. 1846-1850 [doi]
• On the Capacity Region of Multi-Antenna Gaussian Broadcast Channels with Estimation ErrorAmir F. Dana, Masoud Sharif, Babak Hassibi. 1851-1855 [doi]
• Anti-Jamming Schedules for Wireless Data Broadcast SystemsPaolo Codenotti, Alexander Sprintson, Jehoshua Bruck. 1856-1860 [doi]
• Scheduling and Codeword Length Optimization in Time Varying Wireless NetworksMehdi Ansari Sadrabadi, Alireza Bayesteh, Amir K. Khandani. 1861-1865 [doi]
• On the Capacity of Clipped OFDM ChannelsFei Peng, William E. Ryan. 1866-1870 [doi]
• On the Oblivious Transfer Capacity of Noisy CorrelationsAnderson C. A. Nascimento, Andreas J. Winter 0002. 1871-1875 [doi]
• A tighter Cut-Set bound for the multi-terminal erasure channel without side informationRamin Khalili, Kavé Salamatian. 1876-1880 [doi]
• Fountain CapacityShlomo Shamai, Emre Telatar, Sergio Verdú. 1881-1884 [doi]
• On the Information Stability of Channels With Timing ErrorsWei Zeng, Patrick Mitran, Aleksandar Kavcic. 1885-1889 [doi]
• Skew-Tolerant Gray CodesBruce A. Wilson, Mario Blaum. 1890-1894 [doi]
• A Multilevel Construction for Mappings from Binary Sequences to Permutation SequencesTheo G. Swart, Hendrik C. Ferreira. 1895-1899 [doi]
• Multiple User Tracing CodesBálint Laczay, Miklós Ruszinkó. 1900-1904 [doi]
• An Elementary Approach to Ax-Katz, McEliece's Divisibility and Applications to Quasi-Perfect Binary 2-Error Correcting CodesFrancis N. Castro, Ivelisse Rubio, Hugues Randriam, Oscar Moreno, Harold F. Mattson. 1905-1908 [doi]
• Multiuser Detection of M-QAM Symbols via Bit-Level Equalization and Soft DetectionDarryl Dexu Lin, Teng Joon Lim. 1909-1913 [doi]
• Multiuser Interference Cancellation and Detection for Users with Four Transmit AntennasJavad Kazemitabar, Hamid Jafarkhani. 1914-1918 [doi]
• Belief Propagation for Coded Multiuser DetectionPeng Hui Tan, Lars K. Rasmussen. 1919-1923 [doi]
• The Simplest Solution to an Underdetermined System of Linear EquationsDavid L. Donoho, Hossein Kakavand, James Mammen. 1924-1928 [doi]
• Capacity/Storage Tradeoff in High-Dimensional Identification SystemsErtem Tuncel. 1929-1933 [doi]
• Iterative Message Passing Algorithm for Bipartite Maximum Weighted MatchingYuan-Sheng Cheng, Michael J. Neely, Keith M. Chugg. 1934-1938 [doi]
• Generalized maximum likelihood estimates for exponential familiesImre Csiszár, Frantisek Matús. 1939-1943 [doi]
• Sum-Rate of MIMO Broadcast Channels with One Bit FeedbackJordi Diaz, Osvaldo Simeone, Yeheskel Bar-Ness. 1944-1948 [doi]
• Perfect Space-Time Block Codes for parallel MIMO channelsSheng Yang, Jean-Claude Belfiore, Ghaya Rekaya-Ben Othman. 1949-1953 [doi]
• Throughput analysis for MIMO systems in the high SNR regimeNarayan Prasad, Mahesh K. Varanasi. 1954-1958 [doi]
• Random Labeling: A New Approach to Achieve Capacity in MIMO Quasi-Static Fading ChannelsMeritxell Lamarca, Hanqing Lou, Javier Garcia-Frias. 1959-1963 [doi]
• On the Performance of Sphere Decoding of Block CodesMostafa El-Khamy, Haris Vikalo, Babak Hassibi, Robert J. McEliece. 1964-1968 [doi]
• Universal Burst Error CorrectionMarc P. C. Fossorier. 1969-1973 [doi]
• User Identification by Signature Code for Noisy Multiple-Access Adder ChannelJun Cheng 0001, Koichi Kamoi, Yoichiro Watanabe. 1974-1977 [doi]
• Multiple-Packet Recovery Technique using Partially-Overlapped Block CodesYasunao Katayama, Daiju Nakano. 1978-1982 [doi]
• A New Metric for Permutation Polynomial InterleaversOscar Y. Takeshita. 1983-1987 [doi]
• Optimum Distance Quadratic Permutation Polynomial-Based Interleavers for Turbo CodesEirik Rosnes, Oscar Y. Takeshita. 1988-1992 [doi]
• Serial and Parallel Concatenations Based on Faster Than Nyquist SignalingFredrik Rusek, John B. Anderson. 1993-1997 [doi]
• The Properties of the 1-error Linear Complexity of pn-periodic Sequences Over FpMing Su, Lusheng Chen. 1998-2002 [doi]
• New Results on the Linear Complexity of Binary SequencesKonstantinos Limniotis, Nicholas Kolokotronis, Nicholas Kalouptsidis. 2003-2007 [doi]
• On Complementary Punctured Binary Sequence PairsTing Jiang, Zhaobin Li, Zheng Zhou. 2008-2011 [doi]
• Arithmetic-Walsh Spectral Transform Decision DiagramsBogdan J. Falkowski, Shixing Yan. 2012-2016 [doi]
• Generalized Fastest LIA Transform Spectra Calculation by Systolic ProcessorBogdan J. Falkowski, Cicilia C. Lozano, Susanto Rahardja. 2017-2021 [doi]
• Graph Codes with Reed-Solomon Component CodesTom Høholdt, Jørn Justesen. 2022-2026 [doi]
• On the Performance of Multivariate Interpolation Decoding of Reed-Solomon CodesFarzad Parvaresh, Mohammad H. Taghavi, Alexander Vardy. 2027-2031 [doi]
• An Interpolation Algorithm using Gröbner Bases for Soft-Decision Decoding of Reed-Solomon CodesKwankyu Lee, Michael E. O'Sullivan. 2032-2036 [doi]
• A Low-Complexity Method for Chase-Type Decoding of Reed-Solomon CodesJason Bellorado, Aleksandar Kavcic. 2037-2041 [doi]
• On Generalized Survey Propagation: Normal Realization and Sum-Product InterpretationRonghui Tu, Yongyi Mao, Jiying Zhao. 2042-2046 [doi]
• Sub-tree Based Upper and Lower Bounds on the Partition FunctionMehdi Molkaraie, Payam Pakzad. 2047-2051 [doi]
• Particle Methods as Message PassingJustin Dauwels, Sascha Korl, Hans-Andrea Loeliger. 2052-2056 [doi]
• A Synchronization Technique for Array-based LDPC Codes in Channels With Varying Sampling RateLara Dolecek, Venkat Anantharam. 2057-2061 [doi]
• Oblivious Cooperation in Colocated Wireless NetworksMichael Katz, Shlomo Shamai. 2062-2066 [doi]
• Optimum Power Allocation for Cooperative Systems with Orthogonal Space-Time TransmissionsPaul A. Anghel, Mostafa Kaveh, Zhi-Quan Luo. 2067-2071 [doi]
• On Capture in Random-Access SystemsGam D. Nguyen, Anthony Ephremides, Jeffrey E. Wieselthier. 2072-2076 [doi]
• On the Capacity of the Cognitive Tracking ChannelSudhir Srinivasa, Syed Ali Jafar, Nihar Jindal. 2077-2081 [doi]
• Thermodynamic Cost of Reversible ComputingLev B. Levitin, Tommaso Toffoli. 2082-2084 [doi]
• Non-Gaussian asymptotic minimizers in entropic uncertainty principles and the dimensional effectSteeve Zozor, Christophe Vignat. 2085-2089 [doi]
• Quantum key distribution based on a Sagnac loop interferometer and polarization-insensitive phase modulatorsBing Qi, Leilei Huang, Hoi-Kwong Lo, Li Qian. 2090-2093 [doi]
• Simulation and Implementation of Decoy State Quantum Key Distribution over 60km Telecom FiberYi Zhao, Bing Qi, Xiongfeng Ma, Hoi-Kwong Lo, Li Qian. 2094-2098 [doi]
• V-BLAST Power and Rate Control under Delay Constraints in Markovian Fading Channels - Optimality of Monotonic PoliciesDejan V. Djonin, Vikram Krishnamurthy. 2099-2103 [doi]
• Signaling over MIMO Multi-Base Systems: Combination of Multi-Access and Broadcast SchemesMohammad Ali Maddah-Ali, Abolfazl S. Motahari, Amir K. Khandani. 2104-2108 [doi]
• On the Asymptotic Geometric Mean of MIMO Channel EigenvaluesJari Salo, Dominik Seethaler, Ana Skupch. 2109-2113 [doi]
• Challenges in Coding for Quantized MIMO SystemsMichel T. Ivrlac, Josef A. Nossek. 2114-2118 [doi]
• The Capacity of the Asynchronous Compound Multiple Access Channel and Results for Random Access SystemsBrooke Shrader, Anthony Ephremides. 2119-2123 [doi]
• Sending a Bi-Variate Gaussian Source over a Gaussian MACAmos Lapidoth, Stephan Tinguely. 2124-2128 [doi]
• The Multiple Access Channel with Feedback and Correlated SourcesLawrence Ong, Mehul Motani. 2129-2133 [doi]
• Distributed Detection of A Deterministic Signal in Correlated Gaussian Noise Over MACWenjun Li, Huaiyu Dai. 2134-2138 [doi]
• On the Excess Distortion Exponent for Memoryless Gaussian Source-Channel PairsYangfan Zhong, Fady Alajaji, L. Lorne Campbell. 2139-2143 [doi]
• Joint Source-Channel Decoding for Transmitting Correlated Sources over Broadcast NetworksTodd P. Coleman, Emin Martinian, Erik Ordentlich. 2144-2147 [doi]
• On Hierarchical Joint Source-Channel Coding With Causal Side Information at the DecodersAlina Maor, Neri Merhav. 2148-2152 [doi]
• Superimposed Coded and Uncoded Transmissions of a Gaussian Source over the Gaussian ChannelShraga I. Bross, Amos Lapidoth, Stephan Tinguely. 2153-2155 [doi]
• The Arbitrarily Varying Degraded Broadcast Channel with States Known at the EncoderAmir Winshtok, Yossef Steinberg. 2156-2160 [doi]
• Randomization bounds on Gaussian arbitrarily varying channelsAnand D. Sarwate, Michael Gastpar. 2161-2165 [doi]
• Error Exponent in AVS CodingAshot N. Harutyunyan, A. J. Han Vinck. 2166-2170 [doi]
• Decision-Making with Unbounded Loss FunctionsMajid Fozunbal, Ton Kalker. 2171-2175 [doi]
• Rate of convergence of local averaging plug-in classification rules under margin conditionMichael Kohler, Adam Krzyzak. 2176-2179 [doi]
• Bayesian approach to a definition of random sequences and its applications to statistical inferenceHayato Takahashi 0001. 2180-2184 [doi]
• Convergence and Consistency of Recursive BoostingAurelie C. Lozano, Sanjeev R. Kulkarni. 2185-2189 [doi]
• A Multi-Step Conference for Cooperative BroadcastRon Dabora, Sergio D. Servetto. 2190-2194 [doi]
• On the Capacity Region of the Multi-Antenna Broadcast Channel with Common MessagesHanan Weingarten, Yossef Steinberg, Shlomo Shamai. 2195-2199 [doi]
• Broadcasting Over a Degraded Relay Channel with Two ReceiversSibi Raj Bhaskaran. 2200-2204 [doi]
• An Outer Bound to the Capacity Region of the Broadcast ChannelChandra Nair, Abbas El Gamal. 2205-2209 [doi]
• Coalitional Games in Gaussian Interference ChannelsSuhas Mathur, Lalitha Sankaranarayanan, Narayan B. Mandayam. 2210-2214 [doi]
• On Achievable Sum Rate for Vector Gaussian Interference ChannelsXiaohu Shang, Biao Chen, Michael J. Gans. 2215-2219 [doi]
• Is interference like noise when you know its codebook?Rahul Tandra, Anant Sahai. 2220-2224 [doi]
• Bargaining Over the Interference ChannelAmir Leshem, Ephraim Zehavi. 2225-2229 [doi]
• Random Redundant Soft-In Soft-Out Decoding of Linear Block CodesThomas R. Halford, Keith M. Chugg. 2230-2234 [doi]
• Probabilistic Sufficient Conditions on Optimality for Reliability Based Decoding of Linear Block CodesWenyi Jin, Marc P. C. Fossorier. 2235-2239 [doi]
• On Suboptimum Component Decoding for Product CodesMaja Loncar, Rolf Johannesson, Jossy Sayir, Irina E. Bocharova, Boris D. Kudryashov. 2240-2244 [doi]
• Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two RoundsK. Murali Krishnan, Priti Shankar. 2245-2249 [doi]
• Inverse-Free Implementation of Berlekamp-Massey-Sakata Algorithm for Decoding Codes on Algebraic CurvesHajime Matsui, Seiichi Mita. 2250-2254 [doi]
• Decoder Scheduling of Hybrid Turbo CodesNeele von Deetzen, Werner Henkel. 2255-2258 [doi]
• Sharp Bounds for MAP Decoding of General Irregular LDPC CodesShrinivas Kudekar, Nicolas Macris. 2259-2263 [doi]
• Exact solution of a p-spin model and its relationship to error correcting codesSatish Babu Korada, Nicolas Macris. 2264-2268 [doi]
• Block code reconstruction using iterative decoding techniquesMathieu Cluzeau. 2269-2273 [doi]
• On the Utility of a 3dB SNR Gain in MIMO ChannelsKambiz Azarian, Hesham El Gamal. 2274-2278 [doi]
• Rate Region Combining in Multiuser MIMORobert F. H. Fischer, Johannes B. Huber. 2279-2283 [doi]
• On Error Probability for Non-coherent MIMO Channels in the Wideband RegimeSiddharth Ray, Muriel Médard, Lizhong Zheng. 2284-2288 [doi]
• Exact Bit Error Rate for SVD-based MIMO systems with Channel Estimation ErrorsEdward K. S. Au, Wai Ho Mow. 2289-2293 [doi]
• Distribution-based Bayesian Minimum Expected Risk for Discriminant AnalysisSantosh Srivastava, Maya R. Gupta. 2294-2298 [doi]
• Upper Bound Kullback-Leibler Divergence for Hidden Markov Models with Application as Discrimination Measure for Speech RecognitionJorge F. Silva, Shrikanth Narayanan. 2299-2303 [doi]
• Weighted Bloom filterJehoshua Bruck, Jie Gao, Anxiao Jiang. 2304-2308 [doi]
• Automatic Extraction of Meaning from the WebRudi Cilibrasi, Paul M. B. Vitányi. 2309-2313 [doi]
• On Optimal Index Assignment for MAP Decoding of Markov SequencesXiaohan Wang, Xiaolin Wu 0001, Sorina Dumitrescu. 2314-2318 [doi]
• Fixed Delay Optimal Joint Source-Channel Coding for Finite-Memory SystemsAditya Mahajan, Demosthenis Teneketzis. 2319-2323 [doi]
• Source-Channel Erasure Codes with Lattice Codebooks for Multiple Description CodingJan Østergaard, Richard Heusdens, Jesper Jensen 0001. 2324-2328 [doi]
• Insight into Source/Channel Duality and More based on an Intuitive Covering/Packing LemmaSoumya Jana, Richard E. Blahut. 2329-2333 [doi]
• Precise Asymptotic Analysis of the Tunstall CodeMichael Drmota, Yuriy A. Reznik, Serap A. Savari, Wojciech Szpankowski. 2334-2337 [doi]
• Error recovery properties of quasi-arithmetic codes and soft decoding with length constraintSimon Malinowski, Herve Jegou, Christine Guillemot. 2338-2342 [doi]
• On the Construction of an Antidictionary of a Binary String with Linear ComplexityTakahiro Ota, Hiroyoshi Morita. 2343-2347 [doi]
• Lossless Source Coding using Tree Structured Random BinningJavad Haghighat, Walaa Hamouda, M. Reza Soleymani. 2348-2352 [doi]
• Universal Decoding of Watermarks Under Geometric AttacksPierre Moulin. 2353-2357 [doi]
• Universal Erasure Entropy EstimationJiming Yu, Sergio Verdú. 2358-2362 [doi]
• Lower Limits of Discrete Universal DenoisingKrishnamurthy Viswanathan, Erik Ordentlich. 2363-2367 [doi]
• Replica Analysis of Performance Loss Due to Separation of Detection and Decoding in CDMA ChannelsToshiyuki Tanaka. 2368-2372 [doi]
• Generating Functional Analysis of CDMA multiuser detection dynamicsKazushi Mimura, Masato Okada. 2373-2377 [doi]
• Analysis of Sparsely-Spread CDMA via Statistical MechanicsMika Yoshida, Toshiyuki Tanaka. 2378-2382 [doi]
• A Multi-Relay Scheme for the Multi-Source Multi-Cast NetworkLiang-Liang Xie, P. R. Kumar. 2383-2387 [doi]
• Optimization of LDPC Codes for Receiver FrontendsGottfried Lechner, Jossy Sayir, Ingmar Land. 2388-2392 [doi]
• Complexity-Optimized Irregular DecodersMasoud Ardakani, Pirouz Zarrinkhat, Raman Yazdani. 2393-2397 [doi]
• On Accuracy of Gaussian Assumption in Iterative Analysis for LDPC CodesKai Xie, Jing Li. 2398-2402 [doi]
• An improved iterative decoding algorithm for block turbo codesMassinissa Lalam, Karine Amis, Dominique Leroux, Dongning Feng, Jinhong Yuan. 2403-2407 [doi]
• General Relayless Networks: Representation of the Capacity RegionAnelia Somekh-Baruch, Sergio Verdú. 2408-2412 [doi]
• Cognitive Radio: An Information-Theoretic PerspectiveAleksandar Jovicic, Pramod Viswanath. 2413-2417 [doi]
• Representation of Correlated Sources into Graphs for Transmission over Broadcast ChannelsSuhan Choi, S. Sandeep Pradhan. 2418-2422 [doi]
• On Capacity of a Constrained Two-Dimensional Channel in Presence of ViolationsNegar Kiyavash, Richard E. Blahut. 2423-2427 [doi]
• A Scaling Theory for Distributed Sparse Matrix Coding in the CEO ProblemTatsuto Murayama, Peter Davis. 2428-2432 [doi]
• Slepian-Wolf Code Design via Source-Channel CorrespondenceJun Chen, Dake He, Ashish Jagmohan. 2433-2437 [doi]
• Guessing Under Source Uncertainty With Side InformationRajesh Sundaresan. 2438-2440 [doi]
• Source Coding with Limited Side Information Lookahead at the DecoderAbbas El Gamal, Tsachy Weissman. 2441-2445 [doi]
• On Slotted Amplify-and-Forward Cooperative Diversity SchemesSheng Yang, Jean-Claude Belfiore. 2446-2450 [doi]
• Partially Cooperative MIMO Channels with Scaled Identity Transmit CovarianceErik Stauffer, Djordje Tujkovic, Arogyaswami Paulraj. 2451-2455 [doi]
• Cooperative diversity based on code superpositionLei Xiao, Thomas E. Fuja, Jörg Kliewer, Daniel J. Costello Jr.. 2456-2460 [doi]
• Strategic Versus Collaborative Power Control in Relay Fading ChannelsShuangqing Wei, Rajgopal Kannan. 2461-2465 [doi]
• Iterative Estimation and Decoding for Gaussian Channels with Abruptly Changing StatisticsWufei Zhang, Daniel J. Costello Jr., Thomas E. Fuja, Gil I. Shamir, Andrew W. Eckford. 2466-2470 [doi]
• Strict Log-Convexity of the Minimum Power VectorSlawomir Stanczak, Holger Boche, Marcin Wiczanowski. 2471-2475 [doi]
• Stochastic Control for Sensor Activity Management in Many-to-one Sensor NetworksZhifeng Hu, Junshan Zhang, Lang Tong. 2476-2480 [doi]
• Encoder-Decoder Design for Feedback Control over the Binary Symmetric ChannelLei Bao, Mikael Skoglund, Karl Henrik Johansson. 2481-2485 [doi]
• Non-binary error correcting codes with noiseless feedback, localized errors, or bothRudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev. 2486-2487 [doi]
• On Minimum Girth of Graphs Reconstructible from Metric Balls of Their VerticesVladimir I. Levenshtein. 2488-2490 [doi]
• On the Stopping Redundancy of MDS CodesJunsheng Han, Paul H. Siegel. 2491-2495 [doi]
• The Two Covering Radius of the Two Error Correcting BCH CodeAndrew Klapper, Andrew Mertz. 2496-2500 [doi]
• Maximizing the Capacity of Large Wireless Networks: Optimal and Distributed SolutionsSaad G. Kiani, David Gesbert. 2501-2505 [doi]
• Optimal Distributed Power Control and Routing in Wireless NetworksYufang Xi, Edmund M. Yeh. 2506-2510 [doi]
• Optimal Capacity Allocation, Routing, and Congestion Control in Wireless NetworksYufang Xi, Edmund M. Yeh. 2511-2515 [doi]
• QoS-Driven Adaptive Power and Rate Allocation for Multichannel Communications in Mobile Wireless NetworksJia Tang, Xi Zhang 0005. 2516-2520 [doi]
• Universal Simulation with a Fidelity CriterionNeri Merhav, Marcelo J. Weinberger. 2521-2525 [doi]
• Strong Consistency of the Good-Turing EstimatorAaron B. Wagner, Pramod Viswanath, Sanjeev R. Kulkarni. 2526-2530 [doi]
• Universal Denoising of Discrete-time Continuous-Amplitude SignalsKamakshi Sivaramakrishnan, Tsachy Weissman. 2531-2535 [doi]
• Existence, Uniqueness, and Optimality of Sibling-Property Codes for Infinite SourcesMatthew Klimesh, Robert J. McEliece. 2536-2540 [doi]
• On Some Distributions and Their Pattern EntropiesGil I. Shamir. 2541-2545 [doi]
• On the Duality between Slepian-Wolf Coding and Channel CodingDa-ke He, En-Hui Yang. 2546-2550 [doi]
• Low Rate Scalar Quantization for Gaussian Sources and Absolute ErrorDaniel Marco, David L. Neuhoff. 2551-2553 [doi]
• Design of Low-Rate Codes through Concatenation of LDGM and Repeat-Hadamard CodesWei Zhong, Javier Garcia-Frias. 2554-2558 [doi]
• Bifurcations and EXIT charts for the Binary Erasure ChannelChristopher M. Kellett, Steven R. Weller. 2559-2563 [doi]
• On the design of high rate multiple turbo codesWei Zhang 0061, Daniel J. Costello Jr.. 2564-2568 [doi]
• A Method for Constructing LDPC Codes with Low Error FloorEran Sharon, Simon Litsyn. 2569-2573 [doi]
• On Jamming in the Wideband RegimeSiddharth Ray, Pierre Moulin, Muriel Médard. 2574-2577 [doi]
• Comparison of Two Low Complexity Multiple Access SchemesJie Luo 0001, Anthony Ephremides. 2578-2582 [doi]
• Timing Acquisition of Wideband PPM Systems over MultipathDana Porrat, Urbashi Mitra. 2583-2587 [doi]
• UWB Communications with Under-Sampled ReceiversWei-De Wu, Chung-Hsuan Wang, Mao-Ching Chiu, Chi-Chao Chao. 2588-2592 [doi]
• Extracting Secrecy from Jointly Gaussian Random VariablesChunxuan Ye, Alex Reznik, Yogendra Shah. 2593-2597 [doi]
• Secret Key Capacity and Advantage Distillation CapacityJun Muramatsu, Kazuyuki Yoshimura, Peter Davis. 2598-2602 [doi]
• Practical Construction Against Theoretical Approach in FingerprintingFabien Galand. 2603-2606 [doi]
• Wiretap channel with side informationYanling Chen, A. J. Han Vinck. 2607-2611 [doi]
• Distributive High-Rate Full-Diversity Space-Frequency Codes for Asynchronous Cooperative CommunicationsYabo Li, Wei Zhang 0001, Xiang-Gen Xia. 2612-2616 [doi]
• Shift Full Rank Matrices with Applications in Asynchronous Cooperative CommunicationsYue Shang, Xiang-Gen Xia. 2617-2621 [doi]
• Near-Optimal Codebook Constructions for Limited Feedback Beamforming in Correlated MIMO Channels with Few AntennasVasanthan Raghavan, Akbar M. Sayeed, Nigel Boston. 2622-2626 [doi]
• Code Designs for MIMO Broadcast ChannelsMomin Uppal, Vladimir Stankovic 0001, Zixiang Xiong. 2627-2631 [doi]
• OOCs, Partial Relative Difference Families and a Conjecture of GolombOscar Moreno, Reza Omrani, P. Vijay Kumar, Solomon W. Golomb. 2632-2636 [doi]
• An infinite class of quadratic APN functions which are not equivalent to power mappingsLilya Budaghyan, Claude Carlet, Patrick Felke, Gregor Leander. 2637-2641 [doi]
• Spreading Sequences for Asynchronous Spectrally Phase Encoded Optical CDMAReza Omrani, P. Vijay Kumar. 2642-2646 [doi]
• Information Bounds for Decentralized Sequential DetectionYajun Mei. 2647-2651 [doi]
• On optimal quantization rules for sequential decision problemsXuanLong Nguyen, Martin J. Wainwright, Michael I. Jordan. 2652-2656 [doi]
• Optimal implicit channel estimation for finite state Markov communication channelsZarko B. Krusevac, Rodney A. Kennedy, Predrag B. Rapajic. 2657-2661 [doi]
• Bounded Expected Delay in Arithmetic CodingOfer Shayevitz, Ram Zamir, Meir Feder. 2662-2666 [doi]
• Optimal prefix codes for pairs of geometrically-distributed random variablesFrédérique Bassino, Julien Clément 0001, Gadiel Seroussi, Alfredo Viola. 2667-2671 [doi]
• Relative redundancy for large alphabetsAlon Orlitsky, Narayana Santhanam, Junan Zhang. 2672-2676 [doi]
• New model for rigorous analysis of LT-codesElitza N. Maneva, Amin Shokrollahi. 2677-2679 [doi]
• On the achievable extrinsic information of inner decoders in serial concatenationJörg Kliewer, Axel Huebner, Daniel J. Costello Jr.. 2680-2684 [doi]
• Calculation of Mutual Information between Messages in Loops of a Tanner GraphKalle Ruttik. 2685-2688 [doi]
• Analysis of Max-Product via Local MaxifiersStephan Winkler, Sekhar Tatikonda, David Pollard. 2689-2693 [doi]
• Outage Behavior of MIMO Channels with Partial Feedback and Minimum Multiplexing GainsThanh Tùng Kim, Mikael Skoglund. 2694-2698 [doi]
• A Feedback Reduction Technique for MIMO Broadcast ChannelsNihar Jindal. 2699-2703 [doi]
• On the Fundamental Tradeoff of Spatial Diversity and Spatial Multiplexing of MIMO Links with Imperfect CSITAlbert W. C. Lim, Vincent K. N. Lau. 2704-2708 [doi]
• Power Region for Fading Multiple-Access Channel with Multiple AntennasRui Zhang 0006, Mehdi Mohseni, John M. Cioffi. 2709-2713 [doi]
• On the Performance of Superposition Cooperative Diversity in Wireless NetworksZhiguo Ding, Tharmalingam Ratnarajah, Colin Cowan. 2714-2718 [doi]
• An Information Theoretic Analysis for Adaptive-Network-Coded-Cooperation (ANCC) in Wireless Relay NetworksXingkai Bao, Jing Li. 2719-2723 [doi]
• Constructions of Cooperative Diversity Schemes for Asynchronous Wireless NetworksPetros Elia, P. Vijay Kumar. 2724-2728 [doi]
• Asymptotically Optimal Cooperative Wireless Networks without Constellation ExpansionPetros Elia, P. Vijay Kumar, Frédérique E. Oggier. 2729-2733 [doi]
• Symmetric Characterization of Finite State Markov ChannelsMohammad Rezaeian. 2734-2738 [doi]
• Oblivious channelsMichael Langberg. 2739-2743 [doi]
• N-Sequence RSNS Redundancy AnalysisBrian L. Luke, Phillip E. Pace. 2744-2748 [doi]
• Information Transmission over the Postal Channel with and without FeedbackWenyi Zhang, Shivaprasad Kotagiri, J. Nicholas Laneman. 2749-2753 [doi]
• On Transmission Scheduling in Wireless NetworksSerdar Boztas. 2754-2758 [doi]
• Multi-User Scheduling in Wireless Networks with QoS ConstraintsLei Ying, R. Srikant, Geir E. Dullerud. 2759-2763 [doi]
• Stability of Scheduled Message Communication over Degraded Broadcast ChannelsK. C. V. Kalyanarama Sesha Sayee, Utpal Mukherji. 2764-2768 [doi]
• A Markov Random Field Approach to Multicast-Based Network Inference ProblemsJian Ni, Sekhar Tatikonda. 2769-2773 [doi]
• Perfect Hashing for Network ApplicationsYi Lu, Balaji Prabhakar, Flavio Bonomi. 2774-2778 [doi]
• Analog memory by recursive 2-stage switchingShuo-Yen Robert Li, Xuesong Tan. 2779-2783 [doi]
• A Family of MDS Array Codes with Minimal Number of Encoding OperationsMario Blaum. 2784-2788 [doi]
• Modified Low-Density MDS Array CodesHachiro Fujita. 2789-2793 [doi]
• Cyclic Low-Density MDS Array CodesYuval Cassuto, Jehoshua Bruck. 2794-2798 [doi]
• Shortening Array Codes and the Perfect 1-Factorization ConjectureVasken Bohossian, Jehoshua Bruck. 2799-2803 [doi]
• Sudocodes ߝ Fast Measurement and Reconstruction of Sparse SignalsShriram Sarvotham, Dror Baron, Richard G. Baraniuk. 2804-2808 [doi]
• Rate-Constrained Beamforming for Collaborating Hearing AidsOlivier Roy, Martin Vetterli. 2809-2813 [doi]
• Language Modeling with the Maximum Likelihood Set: Complexity Issues and the Back-off FormulaDamianos Karakos, Sanjeev Khudanpur. 2814-2818 [doi]
• Multiuser Space-Time/Frequency Code DesignMarkus E. Gärtner, Helmut Bölcskei. 2819-2823 [doi]
• Design of optimal lattice space-time codesNarayan Prasad, Inaki Berenguer, Xiaodong Wang 0001, Mohammad Madihian. 2824-2828 [doi]
• A New Family of Space-Time Codes for Pulse Amplitude and Position Modulated UWB SystemsChadi Abou-Rjeily, Norbert Daniele, Jean-Claude Belfiore. 2829-2833 [doi]
• Construction of Structured LaST CodesK. Raj Kumar, Giuseppe Caire. 2834-2838 [doi]
• Sub-optimal Power Allocation for MIMO ChannelsAlex J. Grant, Leif W. Hanlen. 2839-2843 [doi]
• BER-Allocation in MIMO and MIMO-OFDMErez Wineberger, Ofer Amrani. 2844-2848 [doi]
• Dependence of MIMO System Performance on the Joint Properties of Angular PowerTerence Betlehem, Tharaka A. Lamahewa, Thushara D. Abhayapala. 2849-2853 [doi]
• Soft-Output Decoding of Rotationally Invariant Codes Over Channels with Phase NoiseAlan Barbieri, Giulio Colavolpe. 2854-2858 [doi]
• Phase Noise Mitigation in Serially Concatenated Continuous Phase Modulation with the Sum-Product AlgorithmDhammika Bokolamulla, Teng Joon Lim, Tor M. Aulin. 2859-2863 [doi]
• First-order Markov Models for Packet Transmission on Rayleigh Fading Channels with DPSK/NCFSK ModulationRamesh Annavajjala, A. Chockalingam, Pamela C. Cosman, Laurence B. Milstein. 2864-2868 [doi]
• Logarithmic Bit-Significance Ratio: Definition, Calculation Rules and ExamplesNorbert Goertz, Tomas Eriksson, John B. Anderson. 2869-2873 [doi]
• Cross-layer Optimization for LDPC-coded Multi-rate Multiuser Systems with QoS ConstraintsKai Li 0009, Xiaodong Wang 0001. 2874-2878 [doi]
• Second Support Weight Distribution of Regular LDPC Code EnsemblesTakayuki Itsui, Kenta Kasai, Ryoji Ikegaya, Tomoharu Shibuya, Kohichi Sakaniwa. 2879-2883 [doi]
• Design of Rate-Compatible IRA Codes for Capacity-Approaching with Hybrid ARQGuosen Yue, Xiaodong Wang 0001, Mohammad Madihian. 2884-2888 [doi]
• On the Optimal Power Allocation for Broadcasting in Dense Cooperative NetworksBirsen Sirkeci Mergen, Anna Scaglione. 2889-2893 [doi]
• Cross-layer Downlink Scheduling of Multi-user Multi-Antenna Systems with Heterogeneous Delay ConstraintsMeilong Jiang, David Shui Wing Hui, Vincent K. N. Lau, Wong Hing Lam. 2894-2898 [doi]
• On the transmission of bursty sourcesStephane Musy, Emre Telatar. 2899-2903 [doi]
• A SIMO Fiber Aided Wireless Network ArchitectureSiddharth Ray, Muriel Médard, Lizhong Zheng. 2904-2908 [doi]
• Supportable Rates in Symmetric Blocking Wavelength RoutersCan Emre Koksal. 2909-2913 [doi]
• Resilient Architecture of All-Optical Networks: Probabilistic Graphical Models for Crosstalk Attack PropagationGuanglei Liu, Chuanyi Ji. 2914-2918 [doi]
• Efficient fault diagnosis for all-optical networks: an information theoretic approachYonggang Wen, Vincent W. S. Chan, Lizhong Zheng. 2919-2923 [doi]