Abstract is missing.
- Competition and Collaboration in Wireless NetworkH. Vincent Poor. [doi]
- "Teaching it"Sergio Verdú. [doi]
- Reflections on the Gaussian Broadcast Channel: Progress and ChallengesShlomo Shamai. [doi]
- Signal Processing Algorithms to Decipher Brain FunctionEmery N. Brown. [doi]
- Network Source Coding: Pipe Dream or Promise?Michelle Effros. [doi]
- Downlink Macro-Diversity in Cellular NetworksSheng Jing, David N. C. Tse, Joseph B. Soriaga, Jilei Hou, John E. Smee, Roberto Padovani. 1-5 [doi]
- Distributed Downlink Beamforming in Cellular NetworksBoon Loong Ng, Jamie S. Evans, Stephen V. Hanly. 6-10 [doi]
- Uplink Macro Diversity with Limited Backhaul CapacityAmichai Sanderovich, Oren Somekh, Shlomo Shamai. 11-15 [doi]
- Cellular Systems with Full-Duplex Amplify-and-Forward Relaying and Cooperative Base-StationsOren Somekh, Osvaldo Simeone, H. Vincent Poor, Shlomo Shamai. 16-20 [doi]
- New exponential bounds for the threshold test and decision feedbackJürgen Freudenberger. 21-25 [doi]
- On Single Cross Error Correcting Integer Codes with Minimum-Energy Signal ConstellationsHiroyoshi Morita, Ko Kamada, Hristo Kostadinov, Adriaan J. de Lind van Wijngaarden. 26-30 [doi]
- Mac Williams Identity for m-Spotty Weight EnumeratorKazuyoshi Suzuki, Haruhiko Kaneko, Eiji Fujiwara. 31-35 [doi]
- MacWilliams Identity for the Rank MetricMaximilien Gadouleau, Zhiyuan Yan. 36-40 [doi]
- Infinitely Many Information InequalitiesFrantisek Matús. 41-44 [doi]
- A Simple Proof of the Entropy-Power Inequality via Properties of Mutual InformationOlivier Rioul. 46-50 [doi]
- On Relationship between Mutual Information and VariationVyacheslav V. Prelov. 51-55 [doi]
- EXIT-Chart Based Labeling Design for Bit-interleaved Coded Modulation with Iterative DecodingTsang-Wei Yu, Chu-yan Wang, Chung-Hsuan Wang, Wern-Ho Sheen. 56-60 [doi]
- Optimum Linear LLR Calculation for Iterative Decoding on Fading ChannelsRaman Yazdani, Masoud Ardakani. 61-65 [doi]
- Generalized Iterative Decoding for Linear Block Codes on the Binary Erasure ChannelKhaled A. S. Abdel-Ghaffar, Jos H. Weber. 66-70 [doi]
- Evolution Analysis of Iterative LMMSE-APP Detection for Coded Linear System with Cyclic PrefixesXiaojun Yuan, Qinghua Guo, Li Ping 0001. 71-75 [doi]
- Fast Generation of Tunstall CodesJohn C. Kieffer. 76-80 [doi]
- Tunstall Parse Trees Optimum under Various CriteriaFerdinando Cicalese, Luisa Gargano, Ugo Vaccaro. 81-85 [doi]
- On the On-line Arithmetic Coding Based on Antidictionaries with Linear ComplexityTakahiro Ota, Hiroyoshi Morita. 86-90 [doi]
- On vocabulary size of grammar-based codesLukasz Debowski. 91-95 [doi]
- Guaranteed Performance Region in Fading Orthogonal Space-Time Coded Broadcast ChannelsEduard A. Jorswieck, Björn Ottersten, Aydin Sezgin, Arogyaswami Paulraj. 96-100 [doi]
- Optimum Zero-forcing Beamforming with Per-antenna Power ConstraintsKemal Karakayali, Roy D. Yates, Gerard J. Foschini, Reinaldo A. Valenzuela. 101-105 [doi]
- MIMO Capacity in Correlated Interference-Limited ChannelsJin Sam Kwak, Jeffrey G. Andrews, Angel Lozano. 106-110 [doi]
- The Multiplexing Gain of MIMO X-Channels with Partial Transmit Side-InformationNatasha Devroye, Masoud Sharif. 111-115 [doi]
- The Capacity Region for Multi-source Multi-sink Network CodingXijin Yan, Raymond W. Yeung, Zhen Zhang. 116-120 [doi]
- Beyond the Butterfly - A Graph-Theoretic Characterization of the Feasibility of Network Coding with Two Simple Unicast SessionsChih-Chun Wang, Ness B. Shroff. 121-125 [doi]
- On the Capacity Bounds of Undirected NetworksAli Al-Bashabsheh, Abbas Yongaçoglu. 126-130 [doi]
- A "Chicken & Egg" Network Coding ProblemNicholas J. A. Harvey, Robert Kleinberg, Chandra Nair, Yunnan Wu. 131-135 [doi]
- Scaling Bounds for Function Computation over Large NetworksSundar Subramanian, Piyush Gupta, Sanjay Shakkottai. 136-140 [doi]
- Routing is Order-optimal in Broadcast Erasure Networks with InterferenceBrian Smith, Piyush Gupta, Sriram Vishwanath. 141-145 [doi]
- Characterization of max-min fair performance in large networks via Szemeredi's Regularity LemmaMarcin Wiczanowski, Holger Boche, Slawomir Stanczak. 146-150 [doi]
- Characterization of the Critical Density for Percolation in Random Geometric GraphsZhenning Kong, Edmund M. Yeh. 151-155 [doi]
- Capacity of Underspread Noncoherent WSSUS Fading Channels under Peak Signal ConstraintsGiuseppe Durisi, Helmut Bölcskei, Shlomo Shamai. 156-160 [doi]
- Markov Capacity of Continuous Phase ModulationsAlan Barbieri, A. Cero, Amina Piemontese, Giulio Colavolpe. 161-165 [doi]
- On the Low-SNR Capacity of Phase-Shift Keying with Hard-Decision DetectionMustafa Cenk Gursoy. 166-170 [doi]
- Optimizing Information Rate Bounds for Channels with MemoryParastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams. 171-175 [doi]
- Maximum Autocorrelation Analysis of Nonlinear Combining Functions in Stream CiphersYongzhuang Wei, Yupu Hu. 176-180 [doi]
- Equivalence classes of boolean functions for first-order correlationJean-Marie Le Bars, Alfredo Viola. 181-185 [doi]
- SYND: a Fast Code-Based Stream Cipher with a Security ReductionPhilippe Gaborit, Cédric Lauradoux, Nicolas Sendrier. 186-190 [doi]
- Lightweight code-based identification and signaturePhilippe Gaborit, Marc Girault. 191-195 [doi]
- Effective LLL Reduction for Lattice DecodingCong Ling 0001, Nick Howgrave-Graham. 196-200 [doi]
- On The Limitations of The Naive Lattice DecodingMahmoud Taherzadeh, Amir K. Khandani. 201-204 [doi]
- Finding the Closest Lattice Point by Iterative SlicingNaftali Sommer, Meir Feder, Ofir Shalvi. 206-210 [doi]
- On the Optimality of Lattice Coding and Decoding in Multiple Access ChannelsYoung-Han Nam, Hesham El Gamal. 211-215 [doi]
- Fast Decoding of Rate-Compatible Punctured LDPC CodesJini Kwon, Demijan Klinc, Jeongseok Ha, Steven W. McLaughlin. 216-220 [doi]
- Iterative LDPC decoding using neighborhood reliabilitiesValentin Savin. 221-225 [doi]
- On the error correction of regular LDPC codes using the flipping algorithmDavid Burshtein. 226-230 [doi]
- Analytical Performance of One-Step Majority Logic Decoding of Regular LDPC CodesRathnakumar Radhakrishnan, Sundararajan Sankaranarayanan, Bane Vasic. 231-235 [doi]
- Random Quantization Bounds for Lattices over q -ary Linear CodesKirill V. Yurkov, Boris D. Kudryashov. 236-240 [doi]
- n Lattice Vectors for Generalized Gaussian DistributionsLeonardo Hidd Fonteles, Marc Antonini. 241-245 [doi]
- Context Quantization by Minimum Adaptive Code LengthSøren Forchhammer, Xiaolin Wu 0001. 246-250 [doi]
- Capacity of Input-Memoryless Causal Ergodic Classical-Quantum ChannelsIgor Bjelakovic, Holger Boche. 251-255 [doi]
- Smooth R??nyi Entropy of Ergodic Quantum Information SourcesBerry Schoenmakers, Jilles Tjoelker, Pim Tuyls, Evgeny A. Verbitskiy. 256-260 [doi]
- Unambiguous discrimination between two rank-2 mixed quantum statesMihailo Stojnic, Babak Hassibi. 261-265 [doi]
- Self-orthogonality of Images and Traces of Codes with Applications to Quantum CodesSundeep B, Andrew Thangaraj. 266-270 [doi]
- A Structured Generalization of Decode-and-Forward Strategies for Multiple-Relay NetworksPeyman Razaghi, Wei Yu 0001. 271-275 [doi]
- The Multiple-Relay Channel with Estimate-and-Forward RelayingRon Dabora, Sergio D. Servetto. 276-280 [doi]
- A New Achievable Rate and the Capacity of a Class of Semi-Deterministic Relay NetworksLeila Ghabeli, Mohammad Reza Aref. 281-285 [doi]
- Opportunism in Multiuser Relay Channels: Scheduling, Routing and Spectrum ReuseOzgur Oyman. 286-290 [doi]
- Towards generic theory of data compressionAnatoli Torokhti, Shmuel Friedland, Phil Howlett. 291-295 [doi]
- Successive Refinement for High-Dimensional Identification SystemsErtem Tuncel. 296-300 [doi]
- Behavior of Shannon's Sampling Series with ApplicationsHolger Boche, Ullrich J. Mönich. 301-305 [doi]
- Pattern Recognition System Design with Linear Encoding for Discrete PatternsPo-Hsiang Lai, Joseph A. O'Sullivan. 306-310 [doi]
- Multiple-Bases Belief-Propagation for Decoding of Short Block CodesThorsten Hehn, Johannes B. Huber, Stefan Laendner, Olgica Milenkovic. 311-315 [doi]
- Loop Calculus and Belief Propagation for q-ary Alphabet: Loop TowerVladimir Y. Chernyak, Michael Chertkov. 316-320 [doi]
- Constraint Relaxation and Annealed Belief Propagation for Binary NetworksYen-Chih Chen, Yu T. Su. 321-325 [doi]
- On the Dynamics of Analog Min-Sum Iterative Decoders, an Analytical ApproachSaied Hemati, Abbas Yongaçoglu. 326-330 [doi]
- Bounds on ordered codes and orthogonal arraysAlexander Barg, Punarbasu Purkayastha. 331-335 [doi]
- Bounds and Constructions for Optimal Constant Weight Conflict-Avoiding CodesKoji Momihara, Meinard Müller, Junya Satoh, Masakazu Jimbo. 336-340 [doi]
- A lower bound for generalized superimposed codes with application to group testing with inhibitorsAnnalisa De Bonis. 341-345 [doi]
- An Upper Bound for the Number of Uniformly Packed CodesNatalia N. Tokareva. 346-349 [doi]
- Throughput Optimal Control of Wireless Networks with Two-hop Cooperative RelayingEdmund M. Yeh, Randall Berry. 351-355 [doi]
- On the Stability Region of Two-User Slotted ALOHA with Cooperative RelaysYao-Win Hong, Chun-Kuang Lin, Shu-Hsien Wang. 356-360 [doi]
- Cooperative Diversity in Wireless Networks with Stochastic and Bursty TrafficPetros Elia, Somsak Kittipiyakul, Tara Javidi. 361-365 [doi]
- Single-Hop Connectivity in Interference-Limited Hybrid Wireless NetworksRadha Krishna Ganti, Martin Haenggi. 366-370 [doi]
- Channel coding with strictly casual colored side-information at transmitterVinod M. Prabhakaran, David Tse, Kannan Ramchandran. 371-375 [doi]
- Dirty Paper Coding for PAM SignalingTal Gariby, Uri Erez, Shlomo Shamai. 376-380 [doi]
- Writing on Dirty Paper with Resizing and its Application to Quasi-Static Fading Broadcast ChannelsWenyi Zhang, Shivaprasad Kotagiri, J. Nicholas Laneman. 381-385 [doi]
- Lattice Strategies for the Dirty Multiple Access ChannelTal Philosof, Ashish Khisti, Uri Erez, Ram Zamir. 386-390 [doi]
- Communication with Feedback via Posterior MatchingOfer Shayevitz, Meir Feder. 391-395 [doi]
- On the Compound Finite State Channel with FeedbackBrooke Shrader, Haim H. Permuter. 396-400 [doi]
- On Evaluating the Rate-Distortion Function of Sources with Feed-Forward and the Capacity of Channels with FeedbackRamji Venkataramanan, S. Sandeep Pradhan. 401-405 [doi]
- Broadcasting with FeedbackSibi Raj Bhaskaran. 406-410 [doi]
- EXIT Functions for LT and Raptor Codes, and Asymptotic Ranks of Random MatricesPayam Pakzad, Amin Shokrollahi. 411-415 [doi]
- Analysis of PCO Raptor codes and Turbo-Fountain Codes on Noiseless ChannelsAlberto Tarable, Sergio Benedetto. 416-420 [doi]
- Analysis and design of raptor codes for joint decoding using Information Content evolutionAuguste Venkiah, Charly Poulliat, David Declercq. 421-425 [doi]
- On the Design of Raptor Codes for Binary-Input Gaussian ChannelsZhong Cheng, Jeff Castura, Yongyi Mao. 426-430 [doi]
- Universal Data Compression with Side Information at the Decoder by Using Traditional Universal Lossless Compression AlgorithmsEn-Hui Yang, Da-ke He. 431-435 [doi]
- On Conditional Branches in Optimal Decision TreesMichael B. Baer. 436-440 [doi]
- On the -overflow probability of lossless codesRyo Nomura, Toshiyasu Matsushima, Shigeichi Hirasawa. 441-445 [doi]
- Kraft Inequality and Zero-Error Source Coding with Decoder Side InformationErtem Tuncel. 446-450 [doi]
- Constructing balanced functions with optimum algebraic immunityClaude Carlet. 451-455 [doi]
- Decimation-Based Fast Correlation AttackMarc P. C. Fossorier, Miodrag J. Mihaljevic, Hideki Imai. 456-460 [doi]
- Efficient Multiple Assignment Secret Sharing SchemesKouya Tochikubo. 461-465 [doi]
- The Martini Synch: Device Pairing via Joint QuantizationDarko Kirovski, Michael Sinclair, David Wilson. 466-470 [doi]
- New Results on the Reliability Function of the Gaussian ChannelMarat V. Burnashev. 471-474 [doi]
- Computing Extensions of Linear CodesMarkus Grassl. 476-480 [doi]
- Code Decomposition: Theory and ApplicationsNavin Kashyap. 481-485 [doi]
- On the Maximally Recoverable Property for Multi-Protection Group CodesMinghua Chen, Cheng Huang, Jin Li 0001. 486-490 [doi]
- The Interplay between Entropy and Variational DistanceSiu-Wai Ho, Raymond W. Yeung. 491-495 [doi]
- Entropy with Limited Computation ResourcesSina Sohangir, Ivan Linscott. 496-500 [doi]
- On a Construction of Entropic Vectors Using Lattice-Generated DistributionsBabak Hassibi, Sormeh Shadbakht. 501-505 [doi]
- Group characterizable entropy functionsTerence H. Chan. 506-510 [doi]
- Sandwich bounds for joint entropyMokshay M. Madiman, Prasad Tetali. 511-515 [doi]
- Low SNR Capacity of Fading Channels -MIMO and Delay SpreadVignesh Sethuraman, Ligong Wang, Bruce E. Hajek, Amos Lapidoth. 516-520 [doi]
- The Fading Number of Multiple-Input Multiple-Output Fading Channels with MemoryStefan M. Moser. 521-525 [doi]
- On the "Critical Rate" in Ricean MIMO ChannelsMarkus E. Gärtner, Helmut Bölcskei. 526-530 [doi]
- On the Ergodic Capacity of the Asymptotic Separately-Correlated Rician Fading MIMO Channel with InterferenceGiorgio Taricco, Erwin Riegler. 531-535 [doi]
- High SNR approximations of the capacity of MIMO correlated Rician channels: a large system approachJulien Dumont, Walid Hachem, Samson Lasaulce, Philippe Loubaton, Jamal Najim. 536-540 [doi]
- Resilient network codes in the presence of eavesdropping Byzantine adversariesSidharth Jaggi, Michael Langberg. 541-545 [doi]
- Random Linear Network Coding: A free cipher?Luísa Lima, Muriel Médard, João Barros. 546-550 [doi]
- On Wiretap Networks IISalim Y. El Rouayheb, Emina Soljanin. 551-555 [doi]
- Signatures for Content Distribution with Network CodingFang Zhao 0001, Ton Kalker, Muriel Médard, Keesook J. Han. 556-560 [doi]
- A Security Condition for Multi-Source Linear Network CodingNing Cai, Raymond W. Yeung. 561-565 [doi]
- The Information Bottleneck Revisited or How to Choose a Good Distortion MeasurePeter Harremoës, Naftali Tishby. 566-570 [doi]
- New Bounds on the Rate-Distortion Function of a Binary Markov SourceShirin Jalali, Tsachy Weissman. 571-575 [doi]
- Delay-Constrained Source Coding for a Peak Distortion MeasureCheng Chang, Anant Sahai. 576-580 [doi]
- New Rate Distortion Bounds for Natural Videos Based on a Texture Dependent Correlation ModelJing Hu, Jerry D. Gibson. 581-585 [doi]
- A Bound of Generalized Cutoff Rate for the Fixed-Length Lossy Coding of General SourcesHidetoshi Shimokawa. 586-589 [doi]
- Capacity of a Class of Deterministic Relay ChannelsThomas M. Cover, Young-Han Kim 0001. 591-595 [doi]
- Capacity of a Class of Modulo-Sum Relay ChannelsMarko Aleksic, Peyman Razaghi, Wei Yu 0001. 596-600 [doi]
- Relay With Unlimited LookaheadNavid Hassanpour. 601-603 [doi]
- Relay with Side InformationRyoulhee Kwak, Wooyul Lee, Abbas El Gamal, John M. Cioffi. 606-610 [doi]
- Source Transmission over Relay Channel with Correlated Relay Side InformationDeniz Gündüz, Chris T. K. Ng, Elza Erkip, Andrea J. Goldsmith. 611-615 [doi]
- Bayesian Selection of Non-Faulty SensorsKevin Ni, Greg Pottie. 616-620 [doi]
- Modulo-q Sum Consensus Via Compressed DataOla Ayaso, Munther A. Dahleh. 621-625 [doi]
- On Distributed Computation in Noisy Random Planar NetworksYashodhan Kanoria, D. Manjunath. 626-630 [doi]
- Adaptive Quantization and Distributed Estimation for Bandwidth-Constraint Sensor NetworksHongbin Li, Jun Fang. 631-635 [doi]
- Single versus multiple rounds for distributed function computationAnand K. Dhulipala, Christina Fragouli, Alon Orlitsky. 636-640 [doi]
- Turbo Decoding of Product Codes based on the Modified Adaptive Belief Propagation AlgorithmChristophe Jégo, Warren J. Gross. 641-644 [doi]
- Theory and Performance of ML Decoding for Turbo Codes using Genetic AlgorithmTsun-chih Hsueh, Da-shan Shiu. 646-650 [doi]
- A Flexible Memory-Mapping Scheme for Parallel Turbo Decoders with Periodic InterleaversTak K. Lee, Ba-Zhong Shen. 651-654 [doi]
- Pseudo-random Puncturing: A Technique to Lower the Error Floor of Turbo CodesIoannis Chatzigeorgiou, Miguel R. D. Rodrigues, Ian J. Wassell, Rolando A. Carrasco. 656-660 [doi]
- A Codeword Weight Lower Bound for a Class of Tail-Biting Turbo CodesYan-Xiu Zheng, Yu T. Su. 661-665 [doi]
- Coding Schemes for an Erasure Relay ChannelSrinath Puducheri, Jörg Kliewer, Thomas E. Fuja. 666-670 [doi]
- Practical rateless cooperation in multiple access channels using multiplexed Raptor codesMomin Uppal, Anders Høst-Madsen, Zixiang Xiong. 671-675 [doi]
- Algebraic Superposition of LDGM Codes for Cooperative DiversityLei Xiao, Thomas E. Fuja, Jörg Kliewer, Daniel J. Costello Jr.. 676-680 [doi]
- D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication ProtocolsPetros Elia, K. Vinodh, M. Anand, P. Vijay Kumar. 681-685 [doi]
- On Non-Parametric Field Estimation using Randomly Deployed, Noisy, Binary SensorsYe Wang, Prakash Ishwar. 686-690 [doi]
- Scanning, Filtering and Prediction for Random Fields Corrupted by Gaussian NoiseAsaf Cohen 0001, Neri Merhav, Tsachy Weissman. 691-695 [doi]
- Optimal Measurement under Cost Constraints for Estimation of Propagating Wave FieldsAyça Özçelikkale, Haldun M. Özaktas, Erdal Arikan. 696-700 [doi]
- Space-Time-Frequency Degrees of Freedom: Fundamental Limits for Spatial InformationLeif W. Hanlen, Thushara D. Abhayapala. 701-705 [doi]
- Fingerprinting Capacity Under the Marking AssumptionN. Prasanth Anthapadmanabhan, Alexander Barg, Ilya Dumer. 706-710 [doi]
- Expurgated Gaussian Fingerprinting CodesPierre Moulin, Negar Kiyavash. 711-715 [doi]
- Guessing Based On Length FunctionsRajesh Sundaresan. 716-719 [doi]
- Multiplex Coding of Bit Commitment Based on a Discrete Memoryless ChannelHirosuke Yamamoto, Daichi Isami. 721-725 [doi]
- Robust Joint Source-Channel Coding for Delay-Limited ApplicationsMahmoud Taherzadeh, Amir K. Khandani. 726-730 [doi]
- Multiple Description Quantizer Design for Space-time Orthogonal Block Coded ChannelsYugang Zhou, Wai-Yip Chan. 731-735 [doi]
- Optimal Linear Assignment of a Binary Group Code to Integer Vectors for Source-Channel CodingIlju Na, David L. Neuhoff. 736-740 [doi]
- The Best Binary Linear Block Codes for Scalar Source-Channel CodingIlju Na, David L. Neuhoff. 741-745 [doi]
- On the minimum weight of simple full-length array LDPC codesKenji Sugiyama, Yuichi Kaji. 746-750 [doi]
- On the Minimum Distance of Generalized LDPC CodesAyoub Otmani, Jean-Pierre Tillich, Iryna Andriyanova. 751-755 [doi]
- Tight Bounds of Minimum Distance Distributions of Irregular LDPC Code EnsemblesShinya Miyamoto, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa. 756-760 [doi]
- A Combinatorial Family of Near Regular LDPC CodesK. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar. 761-765 [doi]
- The Capacity Region of the Degraded MIMO Compound Broadcast ChannelHanan Weingarten, Tie Liu, Shlomo Shamai, Yossef Steinberg, Pramod Viswanath. 766-770 [doi]
- On the Capacity Scalings of the Multiple Antenna Group-Broadcast SystemsAmir F. Dana, Tareq Y. Al-Naffouri, Babak Hassibi. 771-775 [doi]
- Sum-Capacity and MMSE for the MIMO Broadcast Channel without Eigenvalue DecompositionsRaphael Hunger, David A. Schmidt, Wolfgang Utschick. 776-780 [doi]
- Conjugate Gradient Projection Approach for MIMO Gaussian Broadcast ChannelsJia Liu, Y. Thomas Hou, Sastry Kompella, Hanif D. Sherali. 781-785 [doi]
- A Binary Coding Approach for Combination Networks and General Erasure NetworksMing Xiao, Muriel Médard, Tor Aulin. 786-790 [doi]
- Coding for Errors and Erasures in Random Network CodingRalf Koetter, Frank R. Kschischang. 791-795 [doi]
- Using Rank-Metric Codes for Error Correction in Random Network CodingDanilo Silva, Frank R. Kschischang. 796-800 [doi]
- Network Coding over a Noisy Relay : a Belief Propagation ApproachSichao Yang, Ralf Koetter. 801-804 [doi]
- Quantum Quasi-Cyclic LDPC CodesManabu Hagiwara, Hideki Imai. 806-810 [doi]
- A class of quantum LDPC codes: construction and performances under iterative decodingThomas Camara, Harold Ollivier, Jean-Pierre Tillich. 811-815 [doi]
- Constructions of Quantum Convolutional CodesMarkus Grassl, Martin Rötteler. 816-820 [doi]
- Quantum Convolutional Codes Derived from Generalized Reed-Solomon CodesSalah A. Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli. 821-825 [doi]
- Neighbor Discovery for Wireless NetworksDaniele Angelosante, Ezio Biglieri, Marco Lops. 826-830 [doi]
- On the critical communication range under node placement with vanishing densitiesGuang Han, Armand M. Makowski. 831-835 [doi]
- Bandwidth-SINR Tradeoffs in Spatial NetworksNihar Jindal, Jeffrey G. Andrews, Steven Weber. 836-840 [doi]
- Improved Power-Delay Trade-off in Wireless Ad Hoc Networks Using Opportunistic RoutingWon-Yong Shin, Sae-Young Chung, Yong H. Lee. 841-845 [doi]
- Codes for Deletion and Insertion Channels with Segmented ErrorsZhenming Liu, Michael Mitzenmacher. 846-850 [doi]
- On Linear and Cyclic Codes for Correcting DeletionsKhaled A. S. Abdel-Ghaffar, Hendrik C. Ferreira, Ling Cheng 0001. 851-855 [doi]
- Some Open Problems on Quasi-Twisted and Related Code Constructions and Good Quaternary CodesNuh Aydin, Tsvetan Asamov, T. Aaron Gulliver. 856-860 [doi]
- New Constructions of a Family of 2-Generator Quasi-Cyclic Two-Weight Codes and Related CodesEric Z. Chen. 861-864 [doi]
- Existence Proofs of Some EXIT Like FunctionsVishwambhar Rathi, Rüdiger L. Urbanke. 866-870 [doi]
- EXIT Chart Analysis of Binary Message-Passing DecodersGottfried Lechner, Troels Pedersen, Gerhard Kramer. 871-875 [doi]
- EXIT and Density Evolution Analysis for Homogeneous Expectation PropagationJohn MacLaren Walsh. 876-880 [doi]
- EXIT Functions of Hadamard Components in Repeat-Zigzag-Hadamard (RZH) CodesKai Li, Xiaodong Wang, Alexei Ashikhmin. 881-885 [doi]
- Type Classes of Tree ModelsAlvaro Martín, Gadiel Seroussi, Marcelo J. Weinberger. 886-890 [doi]
- Infinite-Alphabet Prefix Codes Optimal for ß-Exponential PenaltiesMichael B. Baer. 891-895 [doi]
- D-ary Bounded-Length Huffman CodingMichael B. Baer. 896-900 [doi]
- Tsallis entropy as a lower bound of average description length for the q-generalized code treeHiroki Suyari. 901-905 [doi]
- A Channel that Heats UpTobias Koch, Amos Lapidoth, Paul P. Sotiriadis. 906-910 [doi]
- Ordering Finite-State Markov Channels by Mutual InformationAndrew W. Eckford. 911-915 [doi]
- Simultaneous Communication of Data and StateThomas M. Cover, Young-Han Kim 0001, Arak Sutivong. 916-920 [doi]
- Capacity Definitions of General Channels with Receiver Side InformationMichelle Effros, Andrea Goldsmith, Yifan Liang. 921-925 [doi]
- Capacity Theorems for Relay Channels with Confidential MessagesYasutada Oohama. 926-930 [doi]
- Cooperative Secrecy: The Relay-Eavesdropper ChannelLifeng Lai, Hesham El Gamal. 931-935 [doi]
- An Algorithm for Computing the Secrecy Capacity of Broadcast Channels with Confidential MessagesKensuke Yasui, Tota Suko, Toshiyasu Matsushima. 936-940 [doi]
- Achievable Rates for Two-Way Wire-Tap ChannelsEnder Tekin, Aylin Yener. 941-945 [doi]
- Random Sparse Linear Systems Observed Via Arbitrary Channels: A Decoupling PrincipleDongning Guo, Chih-Chun Wang. 946-950 [doi]
- On Sparsity, Redundancy and Quality of Frame RepresentationsMehmet Akçakaya, Vahid Tarokh. 951-955 [doi]
- On-line Nonlinear Sparse Approximation of FunctionsPaul Honeine, Cédric Richard, José Carlos M. Bermudez. 956-960 [doi]
- Information-theoretic bounds on sparsity recovery in the high-dimensional and noisy settingMartin J. Wainwright. 961-965 [doi]
- An Information Theoretic View of Stochastic ResonanceVenkat Anantharam, Vivek S. Borkar. 966-970 [doi]
- Spectra of multidimensional complex improper (almost) cyclostationary processesPatrik Wahlberg, Peter J. Schreier. 971-975 [doi]
- Fisher Information, Compound Poisson Approximation, and the Poisson ChannelMokshay M. Madiman, Oliver Johnson, Ioannis Kontoyiannis. 976-980 [doi]
- Capacity Bounds on Timing Channels with Bounded Service TimesSarah H. Sellke, Chih-Chun Wang, Ness B. Shroff, Saurabh Bagchi. 981-985 [doi]
- Noisy Constrained CapacityPhilippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski. 986-990 [doi]
- Asymptotics of Noisy Constrained Channel CapacityGuangyue Han, Brian H. Marcus. 991-995 [doi]
- Channels with nosy "noise"Anand D. Sarwate, Michael Gastpar. 996-1000 [doi]
- Gaussian Jamming in Block-Fading Channels under Long Term Power ConstraintsGeorge T. Amariucai, Shuangqing Wei, Rajgopal Kannan. 1001-1005 [doi]
- Delay-Optimal Burst Erasure Code ConstructionEmin Martinian, Mitchell Trott. 1006-1010 [doi]
- A Generalization of the Finite-Length Scaling Approach Beyond the BECJeremie Ezri, Andrea Montanari, Rüdiger L. Urbanke. 1011-1015 [doi]
- Exact solution for the conditional entropy of Poissonian LDPC codes over the Binary Erasure ChannelSatish Babu Korada, Shrinivas Kudekar, Nicolas Macris. 1016-1020 [doi]
- nGeoffrey Exoo, Tero Laihonen, Sanna M. Ranto. 1021-1025 [doi]
- A Modification of Jarecki and Saxena Proactive RSA Signature SchemeVentzislav Nikov, Svetla Nikova. 1026-1029 [doi]
- ID-based Ring Proxy SignaturesBaodian Wei, Fangguo Zhang, Xiaofeng Chen 0001. 1031-1035 [doi]
- Finding low-weight polynomial multiples using discrete logarithmFrédéric Didier, Yann Laigle-Chapuy. 1036-1040 [doi]
- Secure Construction for Nonlinear Function Threshold Ramp Secret SharingMaki Yoshida, Toru Fujiwara. 1041-1045 [doi]
- Estimate-and-Forward Relaying for the Gaussian Relay Channel with Coded ModulationRon Dabora, Sergio D. Servetto. 1046-1050 [doi]
- A Schalkwijk-Kailath Type Encoding Scheme for the Gaussian Relay Channel with Receiver-Transmitter FeedbackShraga I. Bross, Michele A. Wigger. 1051-1055 [doi]
- On Upper bounds for Decentralized MIMO ReceiverAmichai Sanderovich, Shlomo Shamai, Yossef Steinberg. 1056-1060 [doi]
- Optimal Routing for the Gaussian Multiple-Relay Channel with Decode-and-ForwardLawrence Ong, Mehul Motani. 1061-1065 [doi]
- Channel Hardening and the Scheduling Gain of Antenna Selection Diversity SchemesDongwoon Bai, Patrick Mitran, Saeed S. Ghassemzadeh, Robert R. Miller, Vahid Tarokh. 1066-1070 [doi]
- On Achievable Rates of MIMO Systems with Nonlinear ReceiversGeorgios K. Psaltopoulos, Florian Troesch, Armin Wittneben. 1071-1075 [doi]
- Channel Capacity of MIMO Systems with Closely Spaced Terminated AntennasSnezana Krusevac, Predrag B. Rapajic. 1076-1080 [doi]
- Reduced Rank Signaling in Spatially Correlated MIMO ChannelsVasanthan Raghavan, Venugopal V. Veeravalli, Robert W. Heath Jr.. 1081-1085 [doi]
- Network Coding for Speedup in SwitchesMinji Kim, Jay Kumar Sundararajan, Muriel Médard. 1086-1090 [doi]
- A Multimessage Capacity Region for Undirected Ring NetworksS. M. Sadegh Tabatabaei Yazdi, Serap A. Savari, Farzad Farnoud, Gerhard Kramer. 1091-1095 [doi]
- On Network Coding of Independent and Dependent Sources in Line NetworksMayank Bakshi, Michelle Effros, Wei-Hsin Gu, Ralf Koetter. 1096-1100 [doi]
- Joint Relaying and Network Coding in Wireless NetworksSachin Katti, Ivana Maric, Andrea Goldsmith, Dina Katabi, Muriel Médard. 1101-1105 [doi]
- Construction of a Lossy Source Code Using LDPC MatricesShigeki Miyake, Jun Muramatsu. 1106-1110 [doi]
- Transform Coding of Densely Sampled Gaussian DataS. Sandeep Pradhan, David L. Neuhoff. 1111-1114 [doi]
- Integer Polar Coordinates for CompressionDemba E. Ba, Vivek K. Goyal. 1116-1120 [doi]
- A Monte Carlo Algorithm for Optimal Quantization in Hidden Markov ModelsVladislav B. Tadic, Arnaud Doucet. 1121-1125 [doi]
- Competitive On-line Linear FIR MMSE FilteringTaesup Moon, Tsachy Weissman. 1126-1130 [doi]
- Approximation and Convergence Behavior of Spectral Factorization MethodsHolger Boche, Volker Pohl. 1131-1135 [doi]
- The Complexity of Tracking a Stopping TimeUrs Niesen, Aslan Tchamkerten, Gregory W. Wornell. 1136-1140 [doi]
- Broadcasting when Receivers Know Some Messages A PrioriYunnan Wu. 1141-1145 [doi]
- On the capacity region of parallel Gaussian broadcast channels with common informationRamy H. Gohary, Timothy N. Davidson. 1146-1150 [doi]
- Multilevel Broadcast NetworksShashi Borade, Lizhong Zheng, Mitchell Trott. 1151-1155 [doi]
- Towards Reliable Broadcasting using ACKsMathilde Durvy, Christina Fragouli, Patrick Thiran. 1156-1160 [doi]
- Duality between Broadcasting with Bandwidth Expansion and Bandwidth CompressionKrishna Narayanan, Giuseppe Caire, Makesh P. Wilson. 1161-1165 [doi]
- Floating Codes for Joint Information Storage in Write Asymmetric MemoriesAnxiao Jiang, Vasken Bohossian, Jehoshua Bruck. 1166-1170 [doi]
- Representation of 2 Dimensional RLL ConstraintsHiroshi Kamabe. 1171-1175 [doi]
- Codes for Multi-Level Flash Memories: Correcting Asymmetric Limited-Magnitude ErrorsYuval Cassuto, Moshe Schwartz 0001, Vasken Bohossian, Jehoshua Bruck. 1176-1180 [doi]
- Multimode Coding for Generating Conservative Arrays for Holographic StorageYongguang Zhu, Ivan J. Fair. 1181-1185 [doi]
- Buffer Coding for Asymmetric Multi-Level MemoryVasken Bohossian, Anxiao Jiang, Jehoshua Bruck. 1186-1190 [doi]
- Multilevel Coding for Fading ChannelsMei Chen, Oliver M. Collins. 1191-1195 [doi]
- Analysis and Computation of the Outage Probability of Discrete-Input Block-Fading ChannelsKhoa D. Nguyen, Albert Guillen i Fabregas, Lars K. Rasmussen. 1196-1200 [doi]
- Differential Diversity Reception of MDPSK over Independent Rayleigh Channels with Nonidentical Branch Statistics and Asymmetric Fading SpectrumHua Fu, Pooi Yuen Kam. 1201-1205 [doi]
- An Energy Efficiency Perspective on Training for Fading ChannelsMustafa Cenk Gursoy. 1206-1210 [doi]
- On the ARMA Approximation for Frequency-Flat Rayleigh Fading ChannelsAlan Barbieri, Amina Piemontese, Giulio Colavolpe. 1211-1215 [doi]
- A family of non-binary TLDPC codes: density evolution, convergence and thresholdsIryna Andriyanova, Jean-Pierre Tillich. 1216-1220 [doi]
- On Deriving Good LDPC Convolutional Codes from QC LDPC Block CodesAli Emre Pusane, Roxana Smarandache, Pascal O. Vontobel, Daniel J. Costello Jr.. 1221-1225 [doi]
- Staircase and other structured linear-time encodable LDPC codes: analysis and designFederica Garin, Giacomo Como, Fabio Fagnani. 1226-1230 [doi]
- Constructing LDPC Codes by 2-LiftsXudong Ma, En-Hui Yang. 1231-1235 [doi]
- On Codes Constructed by Generalized Kronecker ProductWen-Yao Chen, Chung-Chin Lu. 1236-1240 [doi]
- On the Discrete Memoryless Partially Cooperative Broadcast Relay ChannelShraga I. Bross. 1241-1245 [doi]
- Rate Regions for the Partially-Cooperative Relay Broadcast Channel with Non-causal Side InformationAbdellatif Zaidi, Luc Vandendorpe. 1246-1250 [doi]
- An Achievable Rate Region for Interference Channels with ConferencingYi Cao, Biao Chen. 1251-1255 [doi]
- High Diversity Scheme for Wireless Networks based on Interference CancellationChaitanya Rao, Babak Hassibi. 1256-1260 [doi]
- Opportunistic Communications in an Orthogonal Multiaccess Relay ChannelLalitha Sankar, Yingbin Liang, H. Vincent Poor, Narayan B. Mandayam. 1261-1265 [doi]
- Mutual Information Optimal Constellations for the Low SNR Noncoherent MIMO Rayleigh Fading ChannelShivratna Giri Srinivasan, Mahesh K. Varanasi. 1266-1270 [doi]
- Hierarchical Decoupling Principle of a MIMO-CDMA Channel in Asymptotic LimitsKeigo Takeuchi, Toshiyuki Tanaka. 1271-1275 [doi]
- On the Diversity of Rayleigh Product ChannelsSheng Yang, Jean-Claude Belfiore. 1276-1280 [doi]
- Clipping Noise Model Based Fast ML Decoding for OSTBC and QOSTBC in Clipped MIMO-OFDM SystemsZhefeng Li, Xiang-Gen Xia. 1281-1285 [doi]
- On Ultra-Wideband MIMO Systems with 1-bit Quantized Outputs: Performance Analysis and Input OptimizationAmine Mezghani, Josef A. Nossek. 1286-1289 [doi]
- Secrecy Capacity Region of Fading Broadcast ChannelsYingbin Liang, H. Vincent Poor, Shlomo Shamai. 1291-1295 [doi]
- Secret Communication with a Fading Eavesdropper ChannelZang Li, Roy D. Yates, Wade Trappe. 1296-1300 [doi]
- On the Secrecy Capacity of Fading Wireless Channel with Multiple EavesdroppersPeiya Wang, Guanding Yu, Zhaoyang Zhang 0001. 1301-1305 [doi]
- On the Secrecy Capacity of Fading ChannelsPraveen Kumar Gopala, Lifeng Lai, Hesham El Gamal. 1306-1310 [doi]
- An Achievable Secrecy Throughput of Hybrid-ARQ Protocols for Block Fading ChannelsXiaojun Tang, Ruoheng Liu, Predrag Spasojevic. 1311-1315 [doi]
- Rateless Slepian-Wolf Coding Based on Rate Adaptive Low-Density-Parity-Check CodesJing Jiang, Dake He, Ashish Jagmohan. 1316-1320 [doi]
- Redundancy of Variable Rate Slepian-Wolf Codes from the Decoder's PerspectiveDa-ke He, Luis Alfonso Lastras-Montaño, En-Hui Yang. 1321-1325 [doi]
- On the Redundancy-Error Tradeoff in Slepian-Wolf Coding and Channel CodingJun Chen, Da-ke He, Ashish Jagmohan, Luis Alfonso Lastras-Montaño. 1326-1330 [doi]
- On A Partial Ordering Relation Derived from Redundancy of Slepian-Wolf CodingDa-ke He, Ashish Jagmohan, Vadim Sheinin. 1331-1335 [doi]
- A Low Complexity Algorithm and Architecture for Systematic Encoding of Hermitian CodesRachit Agarwal 0001, Ralf Koetter, Emanuel M. Popovici. 1336-1340 [doi]
- Enhancing the Correcting Radius of Interleaved Reed-Solomon Decoding using Syndrome Extension TechniquesGeorg Schmidt, Vladimir Sidorenko, Martin Bossert. 1341-1345 [doi]
- Soft-Decision List Decoding with Linear Complexity for the First-Order Reed-Muller CodesIlya Dumer, Grigory Kabatiansky, Cédric Tavernier. 1346-1349 [doi]
- On Algebraic Decoding of q-ary Reed-Muller and Product Reed-Solomon CodesNandakishore Santhi. 1351-1355 [doi]
- On the Hardness of Decoding the Gale-Berlekamp CodeRon M. Roth, Krishnamurthy Viswanathan. 1356-1360 [doi]
- Cascaded Formulation of the Fundamental Polytope of General Linear Block CodesKai Yang 0001, Xiaodong Wang, Jon Feldman. 1361-1365 [doi]
- Perfect Codes over Lipschitz IntegersCarmen Martínez, Esteban Stafford, Ramón Beivide, Ernst M. Gabidulin. 1366-1370 [doi]
- The poset metrics that allow binary codes of codimension m to be m-, (m - 1)-, or (m - 2)-perfectHyun Kwang Kim, Denis S. Krotov. 1371-1375 [doi]
- Minimizing local automataMarie-Pierre Béal, Maxime Crochemore. 1376-1380 [doi]
- Error-Correction of Multidimensional BurstsEitan Yaakobi, Tuvi Etzion. 1381-1385 [doi]
- Constrained Codes as Networks of RelationsMoshe Schwartz 0001, Jehoshua Bruck. 1386-1390 [doi]
- On The Generalization of Error-Correcting WOM CodesAnxiao Jiang. 1391-1395 [doi]
- Low Delay Scheduling in Wireless NetworkKyomin Jung, Devavrat Shah. 1396-1400 [doi]
- Delay-Throughput Analysis in Decentralized Single-Hop Wireless NetworksJamshid Abouei, Alireza Bayesteh, Amir K. Khandani. 1401-1405 [doi]
- Delay-Constrained Energy-Efficient Scheduling over a Multihop LinkWanshi Chen, Michael J. Neely, Urbashi Mitra. 1406-1410 [doi]
- Multihopping Strategies: An Error-Exponent ComparisonWenyi Zhang, Urbashi Mitra. 1411-1415 [doi]
- The Gaussian Channel with Noisy FeedbackYoung-Han Kim 0001, Amos Lapidoth, Tsachy Weissman. 1416-1420 [doi]
- Delayed Feedback Capacity of Stationary Sources over Linear Gaussian Noise ChannelsShaohua Yang, Aleksandar Kavcic. 1421-1425 [doi]
- Error Exponent for Gaussian Channels with Partial Sequential FeedbackManish Agarwal, Dongning Guo, Michael L. Honig. 1426-1430 [doi]
- Using zero-rate feedback on binary additive channels with individual noise sequencesKrishnan Eswaran, Anand D. Sarwate, Anant Sahai, Michael Gastpar. 1431-1435 [doi]
- Asymptotic Capacity of Multi-Level Amplify-and-Forward Relay NetworksShu-ping Yeh, Olivier Lévêque. 1436-1440 [doi]
- Exact Capacity Scaling of Extended Wireless NetworksAyfer Özgür, Olivier Lévêque, David Tse. 1441-1445 [doi]
- Capacity Scaling of Ad Hoc Networks with Spatial DiversityAndrew M. Hunter, Jeffrey G. Andrews, Steven P. Weber. 1446-1450 [doi]
- Capacity Scaling for MIMO Two-Way RelayingRahul Vaze, Robert W. Heath Jr.. 1451-1455 [doi]
- On Source Coding with Coded Side Information for a Binary Source with Binary Side InformationWei-Hsin Gu, Ralf Koetter, Michelle Effros, Tracey Ho. 1456-1460 [doi]
- On Scalable Source Coding With Decoder Side InformationsChao Tian, Suhas N. Diggavi. 1461-1465 [doi]
- On Successive Refinement for the Kaspi/Heegard-Berger ProblemAlina Maor, Neri Merhav. 1466-1470 [doi]
- Successive Coding of Correlated SourcesJayanth Nayak, Ertem Tuncel. 1471-1475 [doi]
- Using Convex Optimization for Nonparametric Statistical Analysis of Point ProcessesTodd P. Coleman, Sridevi S. Sarma. 1476-1480 [doi]
- Common words between two random stringsPhilippe Jacquet. 1481-1485 [doi]
- Effect of Random Permutation of Symbols in a SequenceJun Muramatsu. 1486-1490 [doi]
- Thinning and the Law of Small NumbersPeter Harremoës, Oliver Johnson, Ioannis Kontoyiannis. 1491-1495 [doi]
- The Value of Frame-Delays in the Sequential Coding of Correlated SourcesNan Ma, Prakash Ishwar. 1496-1500 [doi]
- Source Coding with Distortion through Graph ColoringVishal Doshi, Devavrat Shah, Muriel Médard. 1501-1505 [doi]
- Distributed Predictive Coding For Spatio-Temporally Correlated SourcesAnkur Saxena, Kenneth Rose. 1506-1510 [doi]
- Compound conditional source coding, Slepian-Wolf list decoding, and applications to media codingStark C. Draper, Emin Martinian. 1511-1515 [doi]
- Algebraic Distributed Space-Time Codes with Low ML Decoding ComplexityG. Susinder Rajan, B. Sundar Rajan. 1516-1520 [doi]
- Noncoherent Low-Decoding-Complexity Space-Time Codes for Wireless Relay NetworksG. Susinder Rajan, B. Sundar Rajan. 1521-1525 [doi]
- AF and DF Protocols based on Alamouti ST CodeCharlotte Hucher, Ghaya Rekaya-Ben Othman, Jean-Claude Belfiore. 1526-1530 [doi]
- A New Class of Asynchronous Distributed Space-Time CodesMohamed Oussama Damen, A. Roger Hammons Jr.. 1531-1535 [doi]
- Generalized Stability Condition for Generalized and Doubly-Generalized LDPC CodesEnrico Paolini, Marc P. C. Fossorier, Marco Chiani. 1536-1540 [doi]
- Asymptotic Rate versus Design RateCyril Measson, Andrea Montanari, Rüdiger L. Urbanke. 1541-1545 [doi]
- Pseudo-codeword LandscapeMichael Chertkov, Mikhail G. Stepanov. 1546-1550 [doi]
- Error Rate Estimation of Finite-Length Low-Density Parity-Check Codes on Binary Symmetric Channels Using Cycle EnumerationHua Xiao, Amir H. Banihashemi. 1551-1555 [doi]
- Cooperative Multiple Access Encoding with States Available at One TransmitterAnelia Somekh-Baruch, Shlomo Shamai, Sergio Verdú. 1556-1560 [doi]
- Multiple-Access Channels with Distributed Channel State InformationChan-Soo Hwang, Moshe Malkin, Abbas El Gamal, John M. Cioffi. 1561-1565 [doi]
- Multiaccess Channels with State Known to One Encoder: A Case of Degraded Message SetsShivaprasad Kotagiri, J. Nicholas Laneman. 1566-1570 [doi]
- Individual Outage Rate Regions for Fading Multiple Access ChannelsRavi Narasimhan. 1571-1575 [doi]
- Construction of Linear Network Codes that Achieve a Refined Singleton BoundShenghao Yang, Chi Kin Ngai, Raymond W. Yeung. 1576-1580 [doi]
- Error Correction Capability of Random Network Error Correction CodesHuseyin Balli, Xijin Yan, Zhen Zhang. 1581-1585 [doi]
- Entropy Vectors and Network CodesTerence Chan, Alex J. Grant. 1586-1590 [doi]
- On Random Network Coding for MulticastAdrian Tauste Campo, Alex Grant. 1591-1595 [doi]
- Distributed Detection of Information Flows in ChaffTing He, Lang Tong. 1596-1600 [doi]
- Decentralized Sequential Change Detection Using Physical Layer FusionLeena Zacharias, Rajesh Sundaresan. 1601-1605 [doi]
- Detection Outage and Detection Diversity in Distributed Sensor NetworksHyoung-Soo Kim, Shuguang Cui. 1606-1610 [doi]
- The sequential decoding metric for detection in sensor networksNarayanaswamy Balakrishnan, Yaron Rachlin, Rohit Negi, Pradeep K. Khosla. 1611-1615 [doi]
- Signal Set Design for Full-Diversity Low-Decoding-Complexity Differential Scaled-Unitary STBCsG. Susinder Rajan, B. Sundar Rajan. 1616-1620 [doi]
- An Elementary Condition for Non-norm Elements for QAM and HEX SignalsXiaoyong Guo, Xiang-Gen Xia. 1621-1625 [doi]
- STBCs from Representation of Extended Clifford AlgebrasG. Susinder Rajan, B. Sundar Rajan. 1626-1630 [doi]
- On MIDO Space-Time Block CodesCamilla Hollanti, Kalle Ranto. 1631-1635 [doi]
- A Note on the Elementwise Convergence of Functions of Toeplitz MatricesPedro M. Crespo, Jesús Gutiérrez-Gutiérrez. 1636-1640 [doi]
- Adaptive Alternating Minimization AlgorithmsUrs Niesen, Devavrat Shah, Gregory W. Wornell. 1641-1645 [doi]
- Shannon Transform of Certain Matrix ProductsNick Letzepis, Alex J. Grant. 1646-1650 [doi]
- On dualistic structure involving Shannon transform and integrated R-transformToshiyuki Tanaka. 1651-1654 [doi]
- ML decoding via mixed-integer adaptive linear programmingStark C. Draper, Jonathan S. Yedidia, Yige Wang. 1656-1660 [doi]
- Synchronizing block codes with a decoder for variable-length codesUlrich Speidel, T. Aaron Gulliver. 1661-1664 [doi]
- Towards Understanding Weighted Bit-Flipping DecodingXiaofu Wu, Cong Ling 0001, Ming Jiang, Enyang Xu, Chunming Zhao, Xiaohu You. 1666-1670 [doi]
- Reduction of Computational Complexity and Sufficient Stack Size of the MLSDA by Early EliminationShin-Lin Shieh, Po-Ning Chen, Yunghsiang S. Han. 1671-1675 [doi]
- Moment Balancing Templates: Universal Constructions to Add Insertion/Deletion Correction Capability to Arbitrary Error Correcting or Constrained CodesHendrik C. Ferreira, Khaled A. S. Abdel-Ghaffar, Ling Cheng 0001, Theo G. Swart. 1676-1680 [doi]
- Capacity Lower Bounds and Approximate Enumerative Coding for 2-D ConstraintsErik Ordentlich, Ron M. Roth. 1681-1685 [doi]
- Constrained Coding for Context-Free Languages with Applications to Genetic Sequence ModellingOlgica Milenkovic. 1686-1690 [doi]
- On Subsets of Binary Strings Immune to Multiple Repetition ErrorsLara Dolecek, Venkat Anantharam. 1691-1695 [doi]
- A Comparison of Some Trellis- and Tree-Based SISO Algorithms for Decoding and EqualizationMaja Loncar, Rolf Johannesson, Irina E. Bocharova, Boris D. Kudryashov. 1696-1700 [doi]
- Turbo Equalization for Gray-Coded M-ary QAM with Bit-Level Soft DecisionsDarryl Dexu Lin, Teng Joon Lim. 1701-1705 [doi]
- MMSE Infinite Length Symbol-by-Symbol Linear Equalization Achieves Full DiversityAli Tajer, Aria Nosratinia, Naofal Al-Dhahir. 1706-1710 [doi]
- Channel Model Identification for Godard-Kalman Modeling of Time-varying Communication SystemsPredrag B. Rapajic, Zarko B. Krusevac. 1711-1715 [doi]
- Capacity Upper Bounds for the Deletion ChannelSuhas N. Diggavi, Michael Mitzenmacher, Henry D. Pfister. 1716-1720 [doi]
- The Gaussian Erasure ChannelAntonia Maria Tulino, Sergio Verdú, Giuseppe Caire, Shlomo Shamai. 1721-1725 [doi]
- Universal Decoding With an Erasure OptionNeri Merhav, Meir Feder. 1726-1730 [doi]
- Directly Lower Bounding the Information Capacity for Channels with I.I.D. Deletions and DuplicationsEleni Drinea, Adam Kirsch. 1731-1735 [doi]
- Error Exponents for Asymmetric Two-User Discrete Memoryless Source-Channel SystemsYangfan Zhong, Fady Alajaji, L. Lorne Campbell. 1736-1740 [doi]
- Distributed Scalar Quantizers for Gaussian ChannelsNiklas Wernersson, Johannes Karlsson, Mikael Skoglund. 1741-1745 [doi]
- Correlated Sources over a Noisy Channel: Cooperation in the Wideband LimitChulhan Lee, Sriram Vishwanath. 1746-1750 [doi]
- Interference Channel and Compound MAC with Correlated Sources and Receiver Side InformationDeniz Gündüz, Elza Erkip. 1751-1755 [doi]
- Universal coding for correlated sources with complementary deliveryAkisato Kimura, Tomohiko Uyematsu, Shigeaki Kuzuoka. 1756-1760 [doi]
- Minimum cost distributed source coding over a networkAditya Ramamoorthy. 1761-1765 [doi]
- Cooperative Source Coding with Encoder BreakdownDinkar Vasudevan, Etienne Perron. 1766-1770 [doi]
- Multiple Descriptions with Side Informations Also Known At the EncoderJia Wang, Xiaolin Wu 0001, Songyu Yu, Jun Sun 0005. 1771-1775 [doi]
- Parameter Estimation of a Convolutional Encoder from Noisy ObservationsJanis Dingel, Joachim Hagenauer. 1776-1780 [doi]
- Estimating the Frequency and Phase of a Noisy Sinusoid by Kalman FilterPooi Yuen Kam, Hua Fu. 1781-1785 [doi]
- Estimation of the Frequency of Sinusoidal Signals in Laplace NoiseTa-Hsin Li, Kai-Sheng Song. 1786-1790 [doi]
- Resolution of Closely Spaced Deterministic Signals with Given Success RateAlon Amar, Anthony J. Weiss. 1791-1795 [doi]
- Bounds for Codes in the Grassmann ManifoldChristine Bachoc, Yael Ben-Haim, Simon Litsyn. 1796-1800 [doi]
- Semidefinite programming bounds for spherical codesChristine Bachoc, Frank Vallentin. 1801-1805 [doi]
- Unequal dimensional small balls and quantization on Grassmann ManifoldsWei Dai, Brian Rider, Youjian Liu. 1806-1810 [doi]
- Grassmannian Packings for Efficient Quantization in MIMO Broadcast SystemsAlexei Ashikhmin, RaviKiran Gopalan. 1811-1815 [doi]
- Multidimensional Coded Modulation in Block-Fading ChannelsAlbert Guillen i Fabregas, Giuseppe Caire. 1816-1820 [doi]
- Constellation Design via Capacity MaximizationMaged F. Barsoum, Christopher Jones, Michael P. Fitz. 1821-1825 [doi]
- On Active Hamming Distance Measures for Trellis Coded ModulationAxel Hof, Martin Bossert. 1826-1830 [doi]
- Enumerative Encoding with Non-Uniform Modulation ConstraintsMario Blaum, Roy D. Cideciyan, Evangelos Eleftheriou, Rick Galbraith, Ksenija Lakovic, Thomas Mittelholzer, Travis Oenning, Bruce A. Wilson. 1831-1835 [doi]
- Best Affine Approximations of Boolean Functions and Applications to Low Order ApproximationsNicholas Kolokotronis, Konstantinos Limniotis, Nicholas Kalouptsidis. 1836-1840 [doi]
- Entropy Testing is EfficientPeter Harremoës, Igor Vajda. 1841-1845 [doi]
- Free Deconvolution for Signal Processing ApplicationsØyvind Ryan, Mérouane Debbah. 1846-1850 [doi]
- Error Bounds and Improved Probability Estimation using the Maximum Likelihood SetDamianos Karakos, Sanjeev Khudanpur. 1851-1855 [doi]
- A Coding Theorem for a Class of Stationary Channels with FeedbackYoung Han Kim. 1856-1860 [doi]
- Capacity of Markov Channels with Partial State FeedbackSerdar Yüksel, Sekhar Tatikonda. 1861-1865 [doi]
- Capacity and Zero-Error Capacity of the Chemical Channel with FeedbackHaim H. Permuter, Paul Cuff, Benjamin Van Roy, Tsachy Weissman. 1866-1870 [doi]
- On the Burnashev exponent for Markov channelsGiacomo Como, Serdar Yüksel, Sekhar Tatikonda. 1871-1875 [doi]
- Bounds on Codes Based on Graph TheorySalim Y. El Rouayheb, Costas N. Georghiades, Emina Soljanin, Alex Sprintson. 1876-1879 [doi]
- Conditionally Cycle-Free Generalized Tanner Graphs: Theory and Application to High-Rate Serially Concatenated CodesThomas R. Halford, Keith M. Chugg. 1881-1885 [doi]
- An Analysis of the Sum-Product Decoding of Analog Compound CodesFangning Hu, Werner Henkel. 1886-1890 [doi]
- Encoding for the Blackwell Channel with Reinforced Belief PropagationAlfredo Braunstein, Farbod Kayhan, Guido Montorsi, Riccardo Zecchina. 1891-1895 [doi]
- Classical Information Capacity of the Bosonic Broadcast ChannelSaikat Guha, Jeffrey H. Shapiro. 1896-1900 [doi]
- Noise threshold for universality of 2-input gatesFalk Unger. 1901-1905 [doi]
- A Statistical Mechanical Interpretation of Instantaneous CodesKohtaro Tadaki. 1906-1910 [doi]
- Cooperative diversity using per-user power control in the multiuser MAC channelKamel Tourki, David Gesbert, Luc Deneire. 1911-1915 [doi]
- Power Allocation in Cooperative Networks Using Differential Space-Time CodesBehrouz Maham, Are Hjørungnes. 1916-1919 [doi]
- Distributed Resource Allocation for OFDMA System with Half-Duplex Relay using Rateless CodeShunqing Zhang, Vincent K. N. Lau. 1921-1925 [doi]
- Opportunistic Cooperation via Relay Selection with Minimal Information ExchangeAli Tajer, Aria Nosratinia. 1926-1930 [doi]
- Structured Lattice Space-Time Trellis Coded ModulationK. Raj Kumar, Giuseppe Caire. 1931-1935 [doi]
- Channel Precoding for STBCs from Generalized Pseudo Orthogonal DesignsSuvarup Saha, G. Susinder Rajan, B. Sundar Rajan. 1936-1940 [doi]
- Coset-based lattice detection for MIMO systemsKaren Su, Frank R. Kschischang. 1941-1945 [doi]
- Reducing The Detection Complexity By Using 2??2 Multi-Strata Space-Time CodesMichael Samuel, Michael P. Fitz. 1946-1950 [doi]
- A Universal Wyner-Ziv Scheme for Discrete SourcesShirin Jalali, Sergio Verdú, Tsachy Weissman. 1951-1955 [doi]
- Universal Source Coding for Monotonic and Fast Decaying Monotonic DistributionsGil I. Shamir. 1956-1960 [doi]
- Joint Universal Lossy Coding and Identification of Stationary Mixing SourcesMaxim Raginsky. 1961-1965 [doi]
- The source coding game with a cheating switcherHari Palaiyanur, Cheng Chang, Anant Sahai. 1966-1970 [doi]
- r, m)Patrick Solé, Virgilio Sison. 1971-1974 [doi]
- On binary primitive BCH codes with minimum distance 8 and exponential sumsPascale Charpin, Tor Helleseth, Victor A. Zinoviev. 1976-1980 [doi]
- Module Codes in Group RingsPaul Hurley, Ted Hurley. 1981-1985 [doi]
- A Complexity Reducing Transformation for the Lee-O'Sullivan Interpolation AlgorithmJun Ma, Alexander Vardy. 1986-1990 [doi]
- Mixed Radix Gray Codes and Edge Disjoint Hamiltonian Cycles in Toroidal NetworksMadhusudhanan Anantha, Bella Bose, Bader F. AlBdaiwi. 1991-1995 [doi]
- On Connections between Group Homomorphisms and the Ingleton InequalityHua Li, Edwin K. P. Chong. 1996-1999 [doi]
- Doped Accumulate LT CodesXiaojun Yuan, Li Ping 0001. 2001-2005 [doi]
- A Maximum-Likelihood Decoding Algorithm of LT Codes with a Small Fraction of Dense RowsKi-Moon Lee, Hayder Radha. 2006-2010 [doi]
- Information Estimation from Partially Missed DataAnatoli Torokhti, Phil Howlett, Charles Pearce. 2011-2015 [doi]
- Nonparametric estimation of the likelihood ratio and divergence functionalsXuanLong Nguyen, Martin J. Wainwright, Michael I. Jordan. 2016-2020 [doi]
- Universal Consistency of Data-Driven Partitions for Divergence EstimationJorge F. Silva, Shrikanth Narayanan. 2021-2025 [doi]
- Population estimation with performance guaranteesAlon Orlitsky, Narayana P. Santhanam, K. Viswanathan. 2026-2030 [doi]
- Precoding of Space-Time Block Codes in Multiuser MIMO Channels with Outdated Channel State InformationJane W. Huang, Edward K. S. Au, Vincent K. N. Lau. 2031-2035 [doi]
- Multiuser Limited Feedback for Wireless Multi-Antenna CommunicationKaibin Huang, Robert W. Heath Jr., Jeffrey G. Andrews. 2036-2040 [doi]
- On Quantized Multi-User Beamforming in Spatially Correlated Broadcast ChannelsVasanthan Raghavan, Venugopal V. Veeravalli. 2041-2045 [doi]
- Quantized vs. Analog Feedback for the MIMO Broadcast Channel: A Comparison between Zero-Forcing Based Achievable RatesGiuseppe Caire, Nihar Jindal, Mari Kobayashi, Niranjay Ravindran. 2046-2050 [doi]
- On Multiterminal Secrecy CapacitiesImre Csiszár, Prakash Narayan. 2051-2055 [doi]
- Communication For Omniscience by a Neutral Observer and Information-Theoretic Key Agreement of Multiple TerminalsAmin Aminzadeh Gohari, Venkat Anantharam. 2056-2060 [doi]
- On Oblivious Transfer CapacityRudolf Ahlswede, Imre Csiszár. 2061-2064 [doi]
- A Sufficient Condition for Private Information Hiding of Two Correlated Sources Under Multiple Access AttacksYadong Wang, Yangfan Zhong, Fady Alajaji, Tamás Linder. 2066-2070 [doi]
- Multiuser Detection in a Dynamic Environment: Joint User Identification and Parameter EstimationDaniele Angelosante, Ezio Biglieri, Marco Lops. 2071-2075 [doi]
- Generating functional analysis of CDMA soft-decision multiuser detectorKazushi Mimura, Masato Okada. 2076-2080 [doi]
- Decoupling Principle in Belief-Propagation-Based CDMA Multiuser Detection AlgorithmTakashi Ikehara, Toshiyuki Tanaka. 2081-2085 [doi]
- Affine and Quadratic Multiuser Detection for Square-Law ReceiversKirtan N. Modi, Maïté Brandt-Pearce. 2086-2090 [doi]
- Boolean Functions, Projection Operators and Quantum Error Correcting CodesVaneet Aggarwal, A. Robert Calderbank. 2091-2095 [doi]
- Duadic Group Algebra CodesSalah A. Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli. 2096-2100 [doi]
- General entanglement-assisted quantum error-correcting codesTodd A. Brun, Igor Devetak, Min-Hsiu Hsieh. 2101-2105 [doi]
- On Construction of Two Classes of Efficient Quantum Error-Correction CodesPeiyu Tan, Jing Li. 2106-2110 [doi]
- Enhancing Sensor Network Lifetime Using Interactive CommunicationSamar Agnihotri, Pavan Nuggehalli, Ramesh R. Rao. 2111-2115 [doi]
- Optimal matching in wireless sensor networksA. Roumy, David Gesbert. 2116-2120 [doi]
- Variable-Rate Distributed Source Coding in the Presence of Byzantine SensorsOliver Kosut, Lang Tong. 2121-2125 [doi]
- Reliability of Data Fusion Algorithm In Sensor NetworksAmeesh Pandya. 2126-2130 [doi]
- Bit-Interleaved Coded Modulation in the Wideband RegimeAlfonso Martinez, Albert Guillen i Fabregas, Giuseppe Caire. 2131-2135 [doi]
- Classification of 8PSK Mappings for BICMFredrik Brannstrom, Lars K. Rasmussen. 2136-2140 [doi]
- Bit Interleaved Coded Modulation with Multi-Labeled Signal MappingAnders Nilsson, Tor M. Aulin. 2141-2145 [doi]
- On the Mapping of Low-Density Parity-Check Codes for Bit-Interleaved Coded ModulationGerd Richter, Axel Hof, Martin Bossert. 2146-2150 [doi]
- BICM-ID with Signal Space Diversity for Keyhole Nakagami-m Fading ChannelsNghi H. Tran, Ha H. Nguyen, Tho Le-Ngoc. 2151-2155 [doi]
- On the Capacity of Interference Channels with a Partially-Cognitive TransmitterIvana Maric, Andrea Goldsmith, Gerhard Kramer, Shlomo Shamai. 2156-2160 [doi]
- On the Utility of Frequency Reuse in Cognitive Radio ChannelsOnur Ozan Koyluoglu, Hesham El Gamal. 2161-2165 [doi]
- Writing on Rayleigh faded dirt: a computable upper bound to the outage capacityPulkit Grover, Anant Sahai. 2166-2170 [doi]
- Bits through ARQs: Spectrum Sharing with a Primary Packet SystemKrishnan Eswaran, Michael Gastpar, Kannan Ramchandran. 2171-2175 [doi]
- Spectrum Allocation in Wireless Networks with Duplexing ConstraintsYufang Xi, Edmund M. Yeh. 2176-2180 [doi]
- Gaussian Interference Channel Capacity to Within One Bit: the General CaseRaúl H. Etkin, David N. C. Tse, Hua Wang. 2181-2185 [doi]
- Precoding for the AWGN Channel with Discrete InterferenceHamid Farmanbar, Amir K. Khandani. 2186-2190 [doi]
- A New Computable Achievable Rate Region for the Gaussian Interference ChannelXiaohu Shang, Biao Chen. 2191-2195 [doi]
- M-user Gaussian Interference Channels: To Decode the Interference or To Consider it as NoiseAbolfazl S. Motahari, Amir K. Khandani. 2196-2200 [doi]
- A Linear Interference Network with Local Side-InformationAmos Lapidoth, Shlomo Shamai, Michele A. Wigger. 2201-2205 [doi]
- Hypothesis Testing Under Successive Refinement Communication ConstraintsChao Tian, Jun Chen. 2206-2210 [doi]
- Recognition of a code in a noisy environmentChristophe Chabot. 2211-2215 [doi]
- The Power and Perils of MDLPieter W. Adriaans, Paul M. B. Vitányi. 2216-2220 [doi]
- Maximum Entropy Generative Models for Similarity-based LearningMaya R. Gupta, Luca Cazzanti, Anjali J. Koppal. 2221-2225 [doi]
- Minimum Expected Distortion in Gaussian Layered Broadcast Coding with Successive RefinementChris T. K. Ng, Deniz Gündüz, Andrea J. Goldsmith, Elza Erkip. 2226-2230 [doi]
- Approaching R(D) = C in Colored Joint Source/Channel Broadcasting by PredictionYuval Kochman, Ram Zamir. 2231-2235 [doi]
- Distortion Exponents over Fading MIMO Channels with Quantized FeedbackTùng T. Kim, Mikael Skoglund, Giuseppe Caire. 2236-2240 [doi]
- Joint Source-Channel Coding for Quasi-Static Fading Channels with Quantized FeedbackFarzad Etemadi, Hamid Jafarkhani. 2241-2245 [doi]
- Sending a Bivariate Gaussian Source over a Gaussian MAC with FeedbackAmos Lapidoth, Stephan Tinguely. 2246-2250 [doi]
- Improving the Performance of Protograph LDPC Codes by Using Different Transmission EnergiesGerd Richter, Martin Bossert. 2251-2255 [doi]
- Cycle Analysis and Construction of Protographs for QC LDPC Codes With Girth Larger Than 12Sunghwan Kim, Jong-Seon No, Habong Chung, Dong-Joon Shin. 2256-2260 [doi]
- Analysis of Non-binary Hybrid LDPC CodesLucile Sassatelli, David Declercq. 2261-2265 [doi]
- Designing LDPC Codes without small trapping sets by using Tanner Graph CoversMilos Ivkovic, Shashi Kiran Chilappagari, Bane Vasic. 2266-2270 [doi]
- On the Exhaustion and Elimination of Trapping Sets: Algorithms & The Suppressing EffectChih-Chun Wang. 2271-2275 [doi]
- On Outage Analysis and Code Design for Correlated MIMO Fading ChannelsK. Raj Kumar, Giuseppe Caire. 2276-2280 [doi]
- On the Outage Capacity of a Practical Decoder Using Channel Estimation AccuracyPablo Piantanida, Sajad Sadough, Pierre Duhamel. 2281-2285 [doi]
- Optimal Combining Schemes for MIMO Systems with Hybrid ARQEdward W. Jang, Jungwon Lee, Hui-Ling Lou, John M. Cioffi. 2286-2290 [doi]
- Optimal SNR Exponent for Discrete-Input MIMO ARQ Block-Fading ChannelsAllen Chuang, Albert Guillen i Fabregas, Lars K. Rasmussen, Iain B. Collings. 2291-2295 [doi]
- Derivatives of Mutual Information in Gaussian Vector Channels with ApplicationsAnke Feiten, Stephen V. Hanly, Rudolf Mathar. 2296-2300 [doi]
- Optimal Side Lobes under Linear and Faster-than-Nyquist ModulationJohn B. Anderson, Fredrik Rusek. 2301-2304 [doi]
- Constructions of Multiple Shift-Distinct Signal Sets with Low CorrelationGuang Gong. 2306-2310 [doi]
- Superposition Coding for Power-and Bandwidth Efficient Communication over the Gaussian ChannelHarm S. Cronie. 2311-2315 [doi]
- Vector Precoding in High Dimensions: A Replica AnalysisRalf R. Müller, Dongning Guo, Aris L. Moustakas. 2316-2320 [doi]
- Arbitrary Rate Permutation Modulation for the Gaussian ChannelOliver Henkel. 2321-2325 [doi]
- Asymptotically Good Woven Codes with Fixed Constituent Convolutional CodesIrina E. Bocharova, Boris D. Kudryashov, Rolf Johannesson, Victor V. Zyablov. 2326-2330 [doi]
- From Block to Convolutional Codes using Block DistancesVladimir Sidorenko, Carlos Medina, Martin Bossert. 2331-2335 [doi]
- Sequential Decoding with a Look-Ahead Path MetricMarcin Sikora, Daniel J. Costello Jr.. 2336-2340 [doi]
- Tail-Biting LDPC Convolutional CodesMarcos B. S. Tavares, Kamil Sh. Zigangirov, Gerhard P. Fettweis. 2341-2345 [doi]
- On Sequence Prediction for Arbitrary MeasuresDaniil Ryabko, Marcus Hutter. 2346-2350 [doi]
- Sequential prediction of binary sequence with side information onlyGyörgy Ottucsák, László Györfi. 2351-2355 [doi]
- A Better Good-Turing Estimator for Sequence ProbabilitiesAaron B. Wagner, Pramod Viswanath, Sanjeev R. Kulkarni. 2356-2360 [doi]
- A Context Quantization Approach to Universal DenoisingKamakshi Sivaramakrishnan, Tsachy Weissman. 2361-2365 [doi]
- Constellation Shaping using LDPC CodesSunil Kaimalettu, Andrew Thangaraj, Matthieu Bloch, Steven W. McLaughlin. 2366-2370 [doi]
- Explicit Construction of Type-II QC LDPC Codes with Girth at least 6Kristine Lally. 2371-2375 [doi]
- Edge-based Scheduled BP in LDPC CodesOren Golov, Ofer Amrani. 2376-2380 [doi]
- A Note on Error Correction Schemes using LDPC codes with a High-Capacity Feedback ChannelNaoto Kobayashi, Toshiyasu Matsushima, Shigeichi Hirasawa. 2381-2385 [doi]
- Variations on the Gaussian Multiple-Access ChannelAlfonso Martinez. 2386-2390 [doi]
- Computation over Gaussian Multiple-Access ChannelsBobak Nazer, Michael Gastpar. 2391-2395 [doi]
- The Computation of the Capacity Region of the Discrete MAC is a Rank-One Non-Convex Optimization ProblemEduard Calvo, Daniel P. Palomar, Javier Rodríguez Fonollosa, Josep Vidal. 2396-2400 [doi]
- Throughput (bits/sec/Hz) of Capture-Based Random-Access Systems with SINR Channel ModelsJeffrey E. Wieselthier, Gam D. Nguyen, Anthony Ephremides. 2401-2405 [doi]
- On Optical Orthogonal, Cyclically Permutable, and Super Optical Orthogonal CodesSamvel Martirosyan, A. J. Han Vinck, Ashot N. Harutyunyan. 2406-2410 [doi]
- Fast Control over Fiber MemoryShuo-Yen Robert Li, Xuesong Jonathan Tan. 2411-2415 [doi]
- Upper and Lower Bounds on the Capacity of Wireless Optical Intensity ChannelsAhmed A. Farid, Steve Hranilovic. 2416-2420 [doi]
- On Outage Capacity of MIMO Poisson Fading ChannelsKaushik Chakraborty, Subhrakanti Dey, Massimo Franceschetti. 2421-2425 [doi]
- Power Control Algorithms for CDMA Networks Based on Large System AnalysisStefano Buzzi, H. Vincent Poor. 2426-2430 [doi]
- Characterization of the Structure of General Interference FunctionsHolger Boche, Martin Schubert. 2431-2435 [doi]
- Joint Beamforming and Power Control for Optimal SIR Assignment in Cellular UplinksTian Lan, Prashanth Hande, Mung Chiang. 2436-2440 [doi]
- Characterization of Rate Region in Interference Channels with Constrained PowerHajar Mahdavi-Doost, Masoud Ebrahimi, Amir K. Khandani. 2441-2445 [doi]
- Optimal Watermark Embedding and Detection Strategies Under General Worst Case AttacksErez Sabbag, Neri Merhav. 2446-2450 [doi]
- On Reversible Embedding When Watermarks and Covertexts Are CorrelatedWei Sun, En-Hui Yang. 2451-2455 [doi]
- Coding Theorems for General StegosystemsHiroki Koga, Isao Nakano. 2456-2460 [doi]
- Information-Theoretic Approach to Steganographic SystemsBoris Ryabko, Daniil Ryabko. 2461-2464 [doi]
- Achievable Rates in Gaussian MISO Channels with Secrecy ConstraintsShabnam Shafiee, Sennur Ulukus. 2466-2470 [doi]
- On the Gaussian MIMO Wiretap ChannelAshish Khisti, Gregory W. Wornell, Ami Wiesel, Yonina C. Eldar. 2471-2475 [doi]
- An Achievable Region of Gaussian Wiretap Channel with Side InformationYanling Chen, A. J. Han Vinck. 2476-2480 [doi]
- Shannon's Secrecy System With Informed Receivers and its Application to Systematic Coding for Wiretapped ChannelsNeri Merhav. 2481-2485 [doi]
- On Optimal System Design for Feedback Control over Noisy ChannelsLei Bao, Mikael Skoglund, Karl Henrik Johansson. 2486-2490 [doi]
- Control of Jump Linear Systems Over Jump Communication Channels - Source-Channel Matching ApproachStojan Z. Denic, Charalambos D. Charalambous. 2491-2495 [doi]
- Broadcast Control Channel Jamming: Resilience and Identification of TraitorsAgnes Chan, Xin Liu, Guevara Noubir, Bishal Thapa. 2496-2500 [doi]
- Symbol Error Rates of Maximum-Likelihood Detector: Convex/Concave Behavior and ApplicationsSergey Loyka, Victoria Kostina, François Gagnon. 2501-2505 [doi]
- Welch Bound for FIR Lowpass Filtered SequencesYutaka Jitsumatsu, Tohru Kohda. 2506-2509 [doi]
- Cross-Correlation Distribution of p-ary m-Sequence and Its p + 1 SubsequencesEun-Young Seo, Young-Sik Kim, Jong-Seon No, Dong-Joon Shin. 2511-2514 [doi]
- 2Eun-Young Seo, Young-Sik Kim, Jong-Seon No, Dong-Joon Shin. 2516-2520 [doi]
- Low Correlation Sequences over AM-PSK and QAM AlphabetsM. Anand, P. Vijay Kumar. 2521-2525 [doi]
- Detection Algorithms and Information Rates for Bit-Patterned Media Storage Systems with Written-in ErrorsJun Hu, Tolga M. Duman, Erozan M. Kurtas, M. Fatih Erden. 2526-2530 [doi]
- Reliable Memories with Subline AccessesJunsheng Han, Luis Alfonso Lastras-Montaño. 2531-2535 [doi]
- Information Rates of Oversampled Detectors for Transition-Noise-Limited Digital Storage SystemsRiccardo Pighi, Riccardo Raheli. 2536-2540 [doi]
- Variable Span Fibonacci Modulation Codes with Limited Byte Error PropagationMario Blaum, Ksenija Lakovic. 2541-2544 [doi]
- On Variational Message Passing on Factor GraphsJustin Dauwels. 2546-2550 [doi]
- Equalization on Graphs: Linear Programming and Message PassingMohammad H. Taghavi, Paul H. Siegel. 2551-2555 [doi]
- Distributed Parameter Estimation with Side Information: A Factor Graph ApproachAmin Zia, James P. Reilly, Shahram Shirani. 2556-2560 [doi]
- On Convergence Properties of Message-Passing Estimation AlgorithmsJustin Dauwels. 2561-2565 [doi]
- A Broadcast Approach to Multiple Access with Random StatesPaolo Minero, David N. C. Tse. 2566-2570 [doi]
- Error-Correcting Non-Binary Signature Code for Multiple-Access Adder ChannelJun Cheng, Koichi Kamoi, Yoichiro Watanabe. 2571-2574 [doi]
- Variable Length Codes for Degraded Broadcast ChannelsStephane Musy. 2576-2580 [doi]
- On Achievable Rates in the Two User AWGN Broadcast Channel with Finite Input AlphabetsCarolin Huppert, Martin Bossert. 2581-2585 [doi]
- Re-examining Probabilistic Versus Deterministic Key ManagementDahai Xu, Jianwei Huang, Jeffrey S. Dwoskin, Mung Chiang, Ruby B. Lee. 2586-2590 [doi]
- Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC CodesMarco Baldi, Franco Chiaraluce. 2591-2595 [doi]
- Group Secret Key Generation AlgorithmsChunxuan Ye, Alex Reznik. 2596-2600 [doi]
- Key rate of quantum key distribution with hashed two-way classical communicationShun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu, Yasuhito Kawano. 2601-2605 [doi]
- Pattern Matching in Constrained SequencesYongwook Choi, Wojciech Szpankowski. 2606-2610 [doi]
- N-Shift Cross-Orthogonal Sequences and Complete Complementary CodesChenggao Han, Naoki Suehiro, Takeshi Hashimoto. 2611-2615 [doi]
- New M-ary Power Residue Sequence Families with Low CorrelationYun Kyoung Han, Kyeongcheol Yang. 2616-2620 [doi]
- Robust Codes for 2×2 MIMO Block Fading ChannelsEmanuele Viterbo, Yi Hong. 2621-2625 [doi]
- Square Complex Orthogonal Designs with Low PAPRSmarajit Das, B. Sundar Rajan. 2626-2630 [doi]
- Analysis of Multiuser Stacked Space-time Orthogonal and Quasi-orthogonal DesignsNarayan Prasad, Luca Venturino, Xiaodong Wang 0001, Mohammad Madihian. 2631-2635 [doi]
- Complex Near-Orthogonal Designs with No Zero EntryGopu V. R. Muni Kumar, B. Sundar Rajan. 2636-2640 [doi]
- Quaternary Convolutional Codes from Linear Block Codes over Galois RingsPatrick Solé, Virgilio Sison. 2641-2645 [doi]
- On formulas for decoding binary cyclic codesDaniel Augot, Magali Bardet, Jean-Charles Faugère. 2646-2650 [doi]
- On the Gilbert-Varshamov distance of Abelian group codesGiacomo Como, Fabio Fagnani. 2651-2655 [doi]
- Encoding via Gr??bner bases and discrete Fourier transforms for several types of algebraic codesHajime Matsui, Seiichi Mita. 2656-2660 [doi]
- Canalization of the Genotype-Phenotype Map: A Coding Theoretic PerspectiveHesham El Gamal, Elizabeth Toher. 2661-2665 [doi]
- Study on the genetic code: comparison with multiplexed codesGuillaume Sicot, Ramesh Pyndiah. 2666-2670 [doi]
- Testing the Independence of Two Non-Stationary Random Processes with Applications to Biometric AuthenticationVladimir B. Balakirsky, Anahit R. Ghazaryan, A. J. Han Vinck. 2671-2675 [doi]
- Statistical Dependence in Biological SequencesHasan Metin Aktulga, Ioannis Kontoyiannis, Leszek Alex Lyznik, Lukasz Szpankowski, Ananth Y. Grama, Wojciech Szpankowski. 2676-2680 [doi]
- A MacWilliams formula for Convolutional CodesPatrick Solé, Dmitrii Zinoviev. 2681-2685 [doi]
- On the EXIT Characteristics of Feed Forward Convolutional CodesLaurent Schmalen, Peter Vary, Marc Adrat, Thorsten Clevorn. 2686-2690 [doi]
- Towards a MacWilliams Identity for Convolutional CodesHeide Gluesing-Luerssen, Gert Schneider. 2691-2695 [doi]
- Simplified High-Rate Punctured Convolutional Self-Doubly Orthogonal CodesEric Roy, Christian Cardinal, David Haccoun. 2696-2699 [doi]
- Capacity of Coordinated ActionsThomas M. Cover, Haim H. Permuter. 2701-2705 [doi]
- Adaptive Amplify-and-Forward Cooperative ChannelCharlotte Hucher, Ghaya Rekaya-Ben Othman, Jean-Claude Belfiore. 2706-2710 [doi]
- On the Asymptotic Capacity of the Rayleigh Fading Amplify-and-Forward MIMO Relay ChannelJörg Wagner 0001, Boris Rankov, Armin Wittneben. 2711-2715 [doi]
- Analysis of Outage Probability for Cooperative Networks with HARQStefano Tomasin, Marco Levorato, Michele Zorzi. 2716-2720 [doi]
- Multicasting in Time-varying Wireless Networks: Cross-layer Dynamic Resource AllocationXijin Yan, Michael J. Neely, Zhen Zhang. 2721-2725 [doi]
- Network Coding in Wireless Networks with Random AccessDanail Traskov, Desmond S. Lun, Ralf Koetter, Muriel Médard. 2726-2730 [doi]
- On Distributed Distortion Optimization for Correlated SourcesTao Cui, Tracey Ho, Lijun Chen 0001. 2731-2735 [doi]
- Minimum Cost Integral Network CodingTao Cui, Tracey Ho. 2736-2740 [doi]
- On the Capacity-Achieving Input Covariance for Multicarrier Communications over Doubly Selective ChannelsGeorg Tauböck, Franz Hlawatsch. 2741-2745 [doi]
- Peak-to-Average Power Ratio Reduction in Multi-User OFDMChristian Siegl, Robert F. H. Fischer. 2746-2750 [doi]
- Performance of Limited Feedback Schemes for Downlink OFDMA with Finite Coherence TimeJieying Chen, Randall A. Berry, Michael L. Honig. 2751-2755 [doi]
- Asymptotic Tradeoff between Cross-Layer Goodput Gain and Outage Diversity in OFDMA Systems with Slow Fading and Delayed CSITVincent Kin Nang Lau, Wing Kwan Ng, David Shui Wing Hui. 2756-2760 [doi]
- Sum-Rate Maximization in Single-Hop Wireless Networks with the On-Off Power SchemeJamshid Abouei, Alireza Bayesteh, Masoud Ebrahimi, Amir K. Khandani. 2761-2765 [doi]
- Geometry, Connectivity, and Broadcast Transport Capacity of Random Networks with FadingMartin Haenggi. 2766-2770 [doi]
- Two-Phase Opportunistic Broadcasting in Large Wireless NetworksSang-Woon Jeon, Sae-Young Chung. 2771-2775 [doi]
- On the Maximum Achievable Rates in Wireless Multicast NetworksSeyed Reza Mirghaderi, Alireza Bayesteh, Amir K. Khandani. 2776-2780 [doi]
- Quaternary Constant-Amplitude Codes for Multicode CDMAKai-Uwe Schmidt. 2781-2785 [doi]
- Eigenvalue Distribution of Correlation Matrix in Asynchronous CDMA with Infinite Observation Window WidthChien-Hwa Hwang. 2786-2790 [doi]
- Theoretical Limits of a Novel Multiplexing MethodLuc Haumonté, Luc Deneire. 2791-2795 [doi]
- On The Duality Between Rate And Power OptimizationsArun Padakandla, Rajesh Sundaresan. 2796-2800 [doi]
- On the concentration of the capacity for a code division multiple access systemSatish Babu Korada, Nicolas Macris. 2801-2805 [doi]
- New List Decoding Algorithms for Reed-Solomon and BCH CodesYingquan Wu. 2806-2810 [doi]
- Reliability-Based Soft-Decision Decoding for Memory ChannelWenyi Jin, Marc P. C. Fossorier. 2811-2815 [doi]
- Error Bounds for Algebraic Soft-Decision Decoding of Reed-Solomon Codes over Additive-Noise ChannelsAndrew Duggan, Alexander Barg. 2816-2820 [doi]
- Multiple Symbol Differential Stack Algorithm for Unitary Space-Frequency ModulationYing Li, Xin Wang, Jibo Wei. 2821-2825 [doi]
- Diversity-Multiplexing Tradeoff via Asymptotic Analysis of Large MIMO SystemsSergey Loyka, George Levin. 2826-2830 [doi]
- Benefit of Delay on the Diversity-Multiplexing Tradeoffs of MIMO Channels with Partial CSIMasoud Sharif, Prakash Ishwar. 2831-2835 [doi]
- Diversity-Multiplexing Tradeoff of MIMO Systems with Antenna SelectionYi Jiang, Mahesh K. Varanasi. 2836-2840 [doi]
- Diversity-Multiplexing Tradeoff in Selective-Fading MIMO ChannelsPedro Coronel, Helmut Bölcskei. 2841-2845 [doi]
- Diversity-Multiplexing Trade-Off In Ad-Hoc NetworksMehdi Ansari Sadrabadi, Alireza Bayesteh, Amir K. Khandani. 2846-2850 [doi]
- Discrete Memoryless Interference Channel: New Outer BoundRaúl H. Etkin, Erik Ordentlich. 2851-2855 [doi]
- The Capacity Region of a Class of Interference ChannelsHon-Fah Chong, Mehul Motani, Hari Krishna Garg. 2856-2860 [doi]
- On InterFerence Channel with Generalized Feedback (IFC-GF)Daniela Tuninetti. 2861-2865 [doi]
- Optimal Order of Decoding for Max-Min Fairness in K-User Memoryless Interference ChannelsMohammad Ali Maddah-Ali, Hajar Mahdavi-Doost, Amir K. Khandani. 2866-2870 [doi]
- Bounds on the capacity region of a class of interference channelsEmre Telatar, David Tse. 2871-2874 [doi]
- Twice-Universal Simulation of Markov Sources and Individual SequencesAlvaro Martín, Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger. 2876-2880 [doi]
- Accelerating Distributed Consensus Via Lifting Markov ChainsWenjun Li, Huaiyu Dai. 2881-2885 [doi]
- Markov Random Processes are not Recoverable After Quantization and Mostly not Recoverable From SamplesDaniel Marco. 2886-2890 [doi]
- Exponential Curvature of Markov ModelsJun'ichi Takeuchi, Tsutomu Kawabata. 2891-2895 [doi]
- Study on Coding for Continuous-Time Markov Chains on Real-Time BasisMikihiko Nishiara. 2896-2899 [doi]
- A Recursive Construction of High-Dimensional Grassmann Space-Time Codes for Non-Coherent MIMO SystemsZoran Utkovski, Jürgen Lindner. 2901-2905 [doi]
- A Criterion and Design for Space-Time Block Codes Achieving Full Diversity With Linear ReceiversYue Shang, Xiang-Gen Xia. 2906-2910 [doi]
- Space-time codes with controllable ML decoding complexity for any number of transmit antennasNaresh Sharma, Pavan R. Pinnamraju, Constantinos B. Papadias. 2911-2915 [doi]
- PEP analysis of SDP-based non-coherent signal detectionMihailo Stojnic, Babak Hassibi, Haris Vikalo. 2916-2920 [doi]
- Exact Evaluation of Block-Error Rate Using Correct Probability for Space-Time CodesZ. Zhang, S. W. Cheung, T. I. Yuk. 2921-2925 [doi]
- Permutation Decoding and the Stopping Redundancy Hierarchy of Linear Block CodesThorsten Hehn, Olgica Milenkovic, Stefan Laendner, Johannes B. Huber. 2926-2930 [doi]
- Average Stopping Set Weight Distribution of Redundant Random Matrix EnsemblesTadashi Wadayama. 2931-2935 [doi]
- An Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check MatricesEirik Rosnes, Øyvind Ytrehus. 2936-2940 [doi]
- Bounds on Single-Exclusion Numbers and Stopping Redundancy of MDS CodesJunsheng Han, Paul H. Siegel, Ron M. Roth. 2941-2945 [doi]
- Stopping-Set Enumerator Approximations for Finite-Length Protograph LDPC CodesKaiann Fu, Achilleas Anastasopoulos. 2946-2950 [doi]
- Performance Analysis of Switch-based Multiuser Scheduling with Adaptive ModulationHaewoon Nam, Young-Chai Ko, Mohamed-Slim Alouini. 2951-2955 [doi]
- Scheduling for Time-Varying Broadcast ChannelsEdward W. Jang, Younggeun Cho, Ji-Woong Choi, John M. Cioffi. 2956-2960 [doi]
- Power Optimal Scheduling for Guaranteed Throughput in Multi-access Fading ChannelsPrasanna Chaporkar, Kimmo Kansanen, Ralf R. Müller. 2961-2965 [doi]
- Scheduling for Fading Multiple Access Channels with Heterogeneous QoS ConstraintsKibeom Seong, Ravi Narasimhan, John M. Cioffi. 2966-2970 [doi]
- Occupancy Distribution of Queueing Systems with Opportunistic Scheduling in the DownlinkMaxim Dashouk, Murat Alanyali, Masoud Sharif. 2971-2975 [doi]