Abstract is missing.
- Bit precision analysis for compressed sensingEhsan Ardestanizadeh, Mahdi Cheraghchi, Amin Shokrollahi. 1-5 [doi]
- Optimal quantization of random measurements in compressed sensingJohn Z. Sun, Vivek K. Goyal. 6-10 [doi]
- A comparative study of quantized compressive sensing schemesWei Dai, Hoa Vinh Pham, Olgica Milenkovic. 11-15 [doi]
- Number of measurements in sparse signal recoveryPaul Tune, Sibi Raj Bhaskaran, Stephen V. Hanly. 16-20 [doi]
- Outer bounds for user cooperationRavi Tandon, Sennur Ulukus. 21-25 [doi]
- A new capacity upper bound for "Relay-With-Delay" channelAmir Salimi, Mahtab Mirmohseni, Mohammad Reza Aref. 26-30 [doi]
- Approximate capacity of a class of Gaussian relay-interference networksSoheil Mohajer, David N. C. Tse, Suhas N. Diggavi. 31-35 [doi]
- Deterministic relay networks with state informationSung-Hoon Lim, Sae-Young Chung, Young Han Kim. 36-40 [doi]
- The rate transfer argument in two-stage scenarios: When does it matter?Ertem Tuncel. 41-45 [doi]
- Gaussian multiple description coding with individual and central distortion constraintsJun Chen. 46-50 [doi]
- Consolidating achievable regions of multiple descriptionsPaul Cuff, Lei Zhao, Haim H. Permuter. 51-54 [doi]
- Binary erasure multiple descriptions: Worst-case distortionEbad Ahmed, Aaron B. Wagner. 55-59 [doi]
- Weight distributions of multi-edge type LDPC codesKenta Kasai, Charly Poulliat, Kohichi Sakaniwa, Tomoharu Awano, David Declercq. 60-64 [doi]
- Binary weight distribution of non-binary LDPC codesIryna Andriyanova, Vishwambhar Rathi, Vishwambhar Tillich. 65-69 [doi]
- On the number of minimum weight codewords of SFA-LDPC codesYuichi Kaji. 70-74 [doi]
- On the fundamental system of cycles in the bipartite graphs of LDPC code ensemblesIgal Sason. 75-79 [doi]
- Low complexity distributed STBCs with unitary relay matrices for any number of relaysG. Susinder Rajan, B. Sundar Rajan. 80-84 [doi]
- Codes over M2(F2) and applications to Golden space-time coded modulationFrédérique E. Oggier, Patrick Solé, Jean-Claude Belfiore. 85-88 [doi]
- A novel construction of complex orthogonal designs with maximal rate and low-PAPRSmarajit Das, B. Sundar Rajan. 89-93 [doi]
- Linear receiver based high-rate space-time block codesWei Zhang 0001, Jinhong Yuan. 94-98 [doi]
- A generalized cut-set boundAmin Aminzadeh Gohari, Venkat Anantharam. 99-103 [doi]
- Analog network coding mappings for the Gaussian multiple-access relay channelSha Yao, Mikael Skoglund. 104-108 [doi]
- Compressed network coding vectorsMahdi Jafari Siavoshani, Lorenzo Keller, Christina Fragouli, Katerina J. Argyraki. 109-113 [doi]
- Algebraic network coding: A new perspectiveK. R. Dinesh Kumar, Andrew Thangaraj. 114-118 [doi]
- Systematic constructions of zero-correlation zone sequencesChing-Wei Chen, Yen-Cheng Liu, Yu Ted Su. 119-123 [doi]
- New sequence families with zero or low correlation zone via interleaving techniquesGuang Gong, Honggang Hu. 124-128 [doi]
- Design of low correlation zone sequence sets of period kNJin-Ho Chung, Kyeongcheol Yang. 129-133 [doi]
- Constructions of families with unequal autoand cross-correlation constraintsJosé R. Ortiz-Ubarri, Oscar Moreno. 134-138 [doi]
- On truth, belief and knowledgeFlemming Topsøe. 139-143 [doi]
- Concavity of entropy under thinningYaming Yu, Oliver Johnson. 144-148 [doi]
- Tsallis differential entropy and divergences derived from the generalized Shannon-Khinchin axiomsMakoto Tsukada, Hiroki Suyari. 149-153 [doi]
- On the interplay between Shannon's information measures and reliability criteriaSiu-Wai Ho. 154-158 [doi]
- Linear compressive networksNaveen Goela, Michael Gastpar. 159-163 [doi]
- Sparsity-embracing multiuser detection for CDMA systems with low activity factoryHao Zhu, Georgios B. Giannakis. 164-168 [doi]
- A sparsity detection framework for on-off random access channelsAlyson K. Fletcher, Vivek K. Goyal, Sundeep Rangan. 169-173 [doi]
- Performance bounds on compressed sensing with Poisson noiseRebecca M. Willett, Maxim Raginsky. 174-178 [doi]
- Achievable rates and capacity for Gaussian relay channels with correlated noisesAndrea Goldsmith, Jinhua Jiang, Shuguang Cui. 179-183 [doi]
- Capacity of relay channels with ISI and colored Gaussian noiseChiranjib Choudhuri, Urbashi Mitra. 184-188 [doi]
- The capacity region of the parallel partially cooperative relay broadcast channel with unmatched degraded subchannelsReza Khosravi-Farsani, Mahtab Mirmohseni, Bahareh Akhbari, Hamed Firouzi, Mohammad Reza Aref. 189-193 [doi]
- A new achievable rate for the Gaussian parallel relay channelSeyed Saeed Changiz Rezaei, Shahab Oveis Gharan, Amir K. Khandani. 194-198 [doi]
- Efficient implementation of the generalized Tunstall code generation algorithmMichael B. Baer. 199-203 [doi]
- Malleable coding with edit-distance costLav R. Varshney, Julius Kusuma, Vivek K. Goyal. 204-208 [doi]
- Two recursive versions of the Shannon codeT. Aaron Gulliver, Hamed Narimani, Mohammadali Khosravifard. 209-213 [doi]
- Merge source codingBruno Tenório Ávila, Eduardo Sany Laber. 214-218 [doi]
- Lower bounds on the graphical complexity of finite-length LDPC codesIgal Sason. 219-223 [doi]
- Linear programming bounds on the degree distributions of LDPC code ensemblesIgal Sason. 224-228 [doi]
- Absdet-pseudo-codewords and perm-pseudo-codewords: Definitions and propertiesRoxana Smarandache, Pascal O. Vontobel. 229-233 [doi]
- On the probabilistic computation of the stopping redundancy of LDPC codesMasanori Hirotomo, Yoshiho Konishi, Masakatu Morii. 234-238 [doi]
- On the existence of proper codes for error detectionTorleiv Kløve. 239-243 [doi]
- A novel bit-level DS combining scheme for MIMO systems with HARQJinhuan Xia, Tiejun Lv, Yonghua Li, John M. Cioffi. 244-248 [doi]
- Outage efficient strategies for network MIMO with partial CSITMari Kobayashi, Mérouane Debbah, Jean-Claude Belfiore. 249-253 [doi]
- MIMO ARQ Systems with multi-Level feedbackKhoa D. Nguyen, Lars K. Rasmussen, Albert Guillen i Fabregas, Nick Letzepis. 254-258 [doi]
- Network computing capacity for the reverse butterfly networkRathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger. 259-262 [doi]
- Network coding capacity: A functional dependence boundSatyajit Thakor, Alex J. Grant, Terence Chan. 263-267 [doi]
- A lower bound on the capacity of wireless erasure networks with random node locationsRayyan G. Jaber, Jeffrey G. Andrews. 268-272 [doi]
- On the capacity of non-coherent network codingMahdi Jafari Siavoshani, Soheil Mohajer, Christina Fragouli, Suhas N. Diggavi. 273-277 [doi]
- New quaternary sequences with ideal autocorrelation constructed from binary sequences with ideal autocorrelationJi-Woong Jang, Jong-Seon No, Young-Sik Kim, Sang-Hyo Kim. 278-281 [doi]
- New construction of quaternary sequences with ideal autocorrelation from Legendre sequencesYoung-Sik Kim, Ji-Woong Jang, Sang-Hyo Kim, Jong-Seon No. 282-285 [doi]
- New quaternary sequences with optimal autocorrelationYoung-Sik Kim, Ji-Woong Jang, Sang-Hyo Kim, Jong-Seon No. 286-289 [doi]
- Computing the biases of parity-check relationsAnne Canteaut, María Naya-Plasencia. 290-294 [doi]
- The entropy power of a sum is fractionally superadditiveMokshay M. Madiman, Farhad Ghassemi. 295-298 [doi]
- A vector generalization of Costa entropy-power inequality and applicationsRuoheng Liu, Tie Liu, H. Vincent Poor, Shlomo Shamai. 299-303 [doi]
- Bounds on the mutual informations of the binary sums of Bernoulli random variablesPayam Pakzad, Venkat Anantharam, Amin Shokrollahi. 304-308 [doi]
- Entropy bounds for a Markov random subfieldMatthew G. Reyes, David L. Neuhoff. 309-313 [doi]
- Efficient and guaranteed rank minimization by atomic decompositionYoram Bresler, Kiryung Lee. 314-318 [doi]
- A channel coding perspective of recommendation systemsS. T. Aditya, Onkar Dabeer, Bikash Kumar Dey. 319-323 [doi]
- Matrix completion from a few entriesRaghunandan H. Keshavan, Sewoong Oh, Andrea Montanari. 324-328 [doi]
- Sparse linear representationHalyun Jeong, Young Han Kim. 329-333 [doi]
- On the DMT of bidirectional relaying with limited feedbackTùng T. Kim, H. Vincent Poor. 334-338 [doi]
- The multi-way relay channelDeniz Gündüz, Aylin Yener, Andrea Goldsmith, H. Vincent Poor. 339-343 [doi]
- Power allocation strategies and lattice based coding schemes for bi-directional relayingMakesh P. Wilson, Krishna Narayanan. 344-348 [doi]
- A class of bi-directional multi-relay protocolsSang Joon Kim, Natasha Devroye, Vahid Tarokh. 349-353 [doi]
- On the statistical physics of directed polymers in a random medium and their relation to tree codesNeri Merhav. 354-358 [doi]
- Fundamental limits of almost lossless analog compressionYihong Wu, Sergio Verdú. 359-363 [doi]
- Compression of graphical structuresYongwook Choi, Wojciech Szpankowski. 364-368 [doi]
- Minimum expected length of fixed-to-variable lossless compression of memoryless sourcesWojciech Szpankowski, Sergio Verdú. 369-373 [doi]
- Decreasing error floor in LDPC codes by parity-check matrix extensionsEran Sharon, Omer Fainzilber, Simon Litsyn. 374-378 [doi]
- Analysis of error floors of LDPC codes under LP decoding over the BSCShashi Kiran Chilappagari, Bane V. Vasic, Mikhail G. Stepanov, Michael Chertkov. 379-383 [doi]
- On LP decoding of nonbinary expander codesVitaly Skachek. 384-388 [doi]
- An LP decoding algorithm based on primal path-following interior point methodTadashi Wadayama. 389-393 [doi]
- Some observations on limited feedback for multiaccess channelsAnand D. Sarwate, Michael Gastpar. 394-397 [doi]
- Throughput of precoded broadcast transmission with noisy feedbackAlon Shalev Housfater, Teng Joon Lim. 398-402 [doi]
- Eigen-beamforming with delayed feedback and channel predictionT. R. Ramya, Srikrishna Bhashyam. 403-407 [doi]
- Limited feedback for multi-carrier beamforming: A rate-distortion approachMingguang Xu, Dongning Guo, Michael L. Honig. 408-412 [doi]
- Valuable messages and random outputs of channels in linear network codingNing Cai. 413-417 [doi]
- Separate network coding for private and common messages from one source to two sinksKunihiko Harada, Hirosuke Yamamoto. 418-422 [doi]
- Decoding network codes by message passingDaniel Salmond, Alex J. Grant, Terence Chan, Ian Grivell. 423-427 [doi]
- Multishot codes for network coding: Bounds and a multilevel constructionRoberto W. Nobrega, Bartolomeu F. Uchôa Filho. 428-432 [doi]
- New QAM Golay complementary pairs with unequal sequence powerYing Li, Yen-Wen Huang. 433-437 [doi]
- Z-connectable complete complementary codes and its application in CDMA systemsChenggao Han, Takeshi Hashimoto. 438-442 [doi]
- Grouped complementary codes for multicarrier CDMA systemsZhenyu Zhang, Fanxin Zeng, Wei Chen, Zhiyong Shi. 443-447 [doi]
- Optimal variable-weight optical orthogonal codes via cyclic difference familiesHengchao Li, Pingzhi Fan, Dianhua Wu, Udaya Parampalli. 448-452 [doi]
- Convergence rate on a nonparametric estimator for the conditional meanDong Sik Kim. 453-457 [doi]
- Recursive filtering and smoothing for Gaussian reciprocal processes with continuous indicesDivyanshu Vats, José M. F. Moura. 458-462 [doi]
- Mutual information approximation via maximum likelihood estimation of density ratioTaiji Suzuki, Masashi Sugiyama, Toshiyuki Tanaka. 463-467 [doi]
- Histogram-based estimation for the divergence revisitedShrikanth S. Narayanan, Jorge F. Silva. 468-472 [doi]
- ℓ2/ℓ1-optimization and its strong thresholds in approximately block-sparse compressed sensingMihailo Stojnic. 473-477 [doi]
- Explicit thresholds for approximately sparse compressed sensing via ℓ1-optimizationMihailo Stojnic. 478-482 [doi]
- Weighted ℓ1 minimization for sparse recovery with prior informationM. Amin Khajehnejad, Weiyu Xu, Amir Salman Avestimehr, Babak Hassibi. 483-487 [doi]
- Modified-CS: Modifying compressive sensing for problems with partially known supportNamrata Vaswani, Wei Lu. 488-492 [doi]
- On sharp performance bounds for robust sparse signal recoveriesWeiyu Xu, Babak Hassibi. 493-497 [doi]
- A simple scheme for delay-tolerant decode-and-forward based cooperative communicationManav R. Bhatnagar, Mérouane Debbah, Are Hjørungnes. 498-502 [doi]
- Decode and forward relays: Full diversity with randomized distributed space-time codingDavid Gregoratti, Xavier Mestre. 503-507 [doi]
- Signal combining for relay transmission with rateless codesAzad Ravanshid, Lutz Lampe, Johannes B. Huber. 508-512 [doi]
- On the diversity analysis of decode-and-forward protocol with multiple antennasXianglan Jin, Dong-Sup Jin, Jong-Seon No, Dong-Joon Shin. 513-516 [doi]
- Simultaneous partial and backward decoding approach for two-level relay networksLeila Ghabeli, Mohammad Reza Aref. 517-521 [doi]
- Distortion-rate tradeoff of a source uniformly distributed over the Composite PF(N) and the composite stiefel manifoldsRajesh T. Krishnamachari, Mahesh K. Varanasi. 522-526 [doi]
- Stochastic stability of adaptive quantizers for Markov sourcesSerdar Yüksel. 527-531 [doi]
- Arithmetic encoding of Markov random fieldsMatthew G. Reyes, David L. Neuhoff. 532-536 [doi]
- Length of minimal forbidden words on a stationary ergodic sourceTakahiro Ota, Hiroyoshi Morita. 537-540 [doi]
- Coding theorem for general stationary memoryless channel based on hash propertyJun Muramatsu, Shigeki Miyake. 541-545 [doi]
- Reconstruction of convolutional codes from noisy observationMaxime Cote, Nicolas Sendrier. 546-550 [doi]
- Short quasi-cyclic LDPC codes from convolutional codesIrina E. Bocharova, Boris D. Kudryashov, Roman V. Satyukov, Stephan Stiglmayry. 551-555 [doi]
- Decoding of MDP convolutional codes over the erasure channelVirtudes Tomás, Joachim Rosenthal, Roxana Smarandache. 556-560 [doi]
- Trapping set analysis of protograph-based LDPC convolutional codesAli Emre Pusane, Daniel J. Costello Jr., David G. M. Mitchell. 561-565 [doi]
- Exact erasure channel density evolution for protograph-based generalized LDPC codesMichael Lentmaier, Marcos B. S. Tavares, Gerhard Fettweis. 566-570 [doi]
- Delay-optimal distributed power and transmission threshold control for S-ALOHA network with FSMC fading channelsHuang Huang, Vincent K. N. Lau. 571-575 [doi]
- Average capacity analysis of continuous-time frequency-selective Rayleigh fading channels with correlated scattering using majorizationEduard A. Jorswieck, Martin Mittelbach. 576-580 [doi]
- Full diversity blind signal designs for unique identification of frequency selective channelsJian-Kang Zhang, Chau Yuen. 581-585 [doi]
- Capacity-achieving codes for channels with memory with maximum-likelihood decodingJung Hyun Bae, Achilleas Anastasopoulos. 586-590 [doi]
- Online maximizing weighted throughput in a fading channelFei Li, Zhi Zhang. 591-595 [doi]
- A cognitive network with clustered decodingNathan Levy, Shlomo Shamai, Michele A. Wigger, Amos Lapidoth. 596-600 [doi]
- On the capacity of multi-user cognitive radio networksSriram Vishwanath, Amin Jafarian. 601-605 [doi]
- On the capacity of partially cognitive radiosGoochul Chung, Chan-Soo Hwang, Sriram Sridharan, Sriram Vishwanath. 606-610 [doi]
- An improved achievable rate region for causal cognitive radioSeyed Hossein Seyedmehdi, Jinhua Jiang, Yan Xin 0001, Xiaodong Wang. 611-615 [doi]
- Capture analysis in wireless radio systems with multi-packet reception capabilitiesAndrea Zanella, Ramesh R. Rao, Michele Zorzi. 616-620 [doi]
- An algorithm for computing bidirectional minimal polynomials for multisequencesLi-Ping Wang 0001. 621-624 [doi]
- A differential equation method to derive the formulas of the T-complexity and the LZ-complexityKenji Hamano, Hirosuke Yamamoto. 625-629 [doi]
- A k-cube graph construction for mappings from Binary vectors to permutationsKhmaies Ouahada, Hendrik C. Ferreira. 630-634 [doi]
- Structural complexity of random binary treesJohn C. Kieffer, En-Hui Yang, Wojciech Szpankowski. 635-639 [doi]
- Fast enumeration of run-length-limited wordsBoris Ryabko, Yulia Medvedeva. 640-643 [doi]
- Bayesian quickest change process detectionVasanthan Raghavan, Venugopal V. Veeravalli. 644-648 [doi]
- Least favorable distributions for robust quickest change detectionJayakrishnan Unnikrishnan, Venugopal V. Veeravalli, Sean P. Meyn. 649-653 [doi]
- A sequential procedure for simultaneous detection and state estimation of Markov signalsEmanuele Grossi, Marco Lops, Vasileios Maroulas. 654-658 [doi]
- On MIMO detection under non-Gaussian target scattering: The power-limited caseAugusto Aubry, Marco Lops, Antonia Maria Tulino, Luca Venturino. 659-663 [doi]
- Conditional dependence in distributed detection: How far can we go?Hao Chen, Pramod K. Varshney, Biao Chen. 664-668 [doi]
- Compressed sensing over finite fieldsStark C. Draper, Sheida Malekpour. 669-673 [doi]
- Sublinear compressive sensing reconstruction via belief propagation decodingHoa Vinh Pham, Wei Dai, Olgica Milenkovic. 674-678 [doi]
- Support recovery in compressed sensing: An estimation theoretic approachAmin Karbasi, Ali Hormati, Soheil Mohajer, Martin Vetterli. 679-683 [doi]
- Conditions for recovery of sparse signals correlated by local transformsIvana Tosic, Pascal Frossard. 684-688 [doi]
- Iterative decoding for superposition modulation-based cooperative transmissionJinhong Yuan, Tao Yang. 689-693 [doi]
- Rate-maximizing mappings for memoryless relayingMikael Skoglund, Majid Nasiri Khormuji, Sha Yao, Syed Ali Abbas Zaidi. 694-698 [doi]
- Reliable source transmission over relay networks with Side InformationMilad Sefidgaran, Bahareh Akhbari, Yalda Mohsenzadeh, Mohammad Reza Aref. 699-703 [doi]
- Diversity analysis of irregular fractional cooperationAndrew W. Eckford, Josephine P. K. Chu, Raviraj S. Adve. 704-708 [doi]
- Universal coding for distributions over co-treesHenrik Densing Petersen, Flemming Topsøe. 709-713 [doi]
- Finiteness of redundancy, regret, Shtarkov sums, and Jeffreys integrals in exponential familiesPeter Grünwald, Peter Harremoës. 714-718 [doi]
- Reducing the space complexity of a Bayes coding algorithm using an expanded context treeToshiyasu Matsushima, Shigeichi Hirasawa. 719-723 [doi]
- Unrestricted BIC context tree estimation for not necessarily finite memory processesZsolt Talata, Tyrone E. Duncan. 724-728 [doi]
- Tail behavior of sphere-decoding complexity in random latticesDominik Seethaler, Joakim Jalden, Christoph Studer, Helmut Bölcskei. 729-733 [doi]
- Single-Gaussian messages and noise thresholds for decoding low-density lattice codesBrian M. Kurkoski, Kazuhiko Yamaguchi, Kingo Kobayashi. 734-738 [doi]
- Power-constrained communications using LDLC latticesJustin Dauwels, Hans-Andrea Loeliger, Brian M. Kurkoski. 739-743 [doi]
- Efficient parametric decoder of low density lattice codesYair Yona, Meir Feder. 744-748 [doi]
- Blind per-state detection of DPSK over correlated fading channelsAlan Barbieri. 749-753 [doi]
- On channel estimation in fast fading mobile coded MIMO OFDMDaniel N. Liu, Michael P. Fitz, Urbashi Mitra. 754-758 [doi]
- Practical signaling with vanishing pilot-energy for large noncoherent block-fading MIMO channelsKeigo Takeuchi, Ralf R. Müller, Mikko Vehkaperä, Toshiyuki Tanaka. 759-763 [doi]
- A systematic space-time code design and its maximum-likelihood decoding for combined channel estimation and error correctionPo-Ning Chen, Chia-Lung Wu, Mikael Skoglund, Yunghsiang Sam Han. 764-768 [doi]
- Impact of CSIT on the tradeoff of diversity and spatial multiplexing in MIMO channelsXiao Juan Zhang, Yi Gong. 769-773 [doi]
- A G-estimator of the MIMO channel ergodic capacityPascal Vallet, Philippe Loubaton. 774-778 [doi]
- A distributed differential space-time coding scheme for two-way wireless relay networksZoran Utkovski, Gilbert Yammine, Jürgen Lindner. 779-783 [doi]
- A new scaling law on throughput and delay performance of wireless mobile relay networks over parallel fading channelsRui Wang 0007, Vincent K. N. Lau, Kaibin Huang. 784-788 [doi]
- Quantum error correction via codes over GF(2)Arijit Chowdhury, B. Sundar Rajan. 789-793 [doi]
- A polynomial-time construction of self-orthogonal codes and applications to quantum error correctionMitsuru Hamada. 794-798 [doi]
- ½Jean-Pierre Tillich, Gilles Zémor. 799-803 [doi]
- New decoding algorithms for a class of subsystem codes and generalized shor codesPradeep Kiran Sarvepalli, Andreas Klappenecker, Martin Rötteler. 804-808 [doi]
- Mismatched estimation and relative entropySergio Verdú. 809-813 [doi]
- Relative entropy and score function: New information-estimation relationships through arbitrary additive perturbationDongning Guo. 814-818 [doi]
- Directed information and causal estimation in continuous timeYoung Han Kim, Haim H. Permuter, Tsachy Weissman. 819-823 [doi]
- On concentration for denoiser-loss estimatorsErik Ordentlich, Krishnamurthy Viswanathan, Marcelo J. Weinberger. 824-828 [doi]
- Distributed large scale network utility maximizationDanny Dolev, Argyris Zymnis, Stephen P. Boyd, Danny Bickson, Yoav Tock. 829-833 [doi]
- The delay region for P2P file transferYunnan Wu, Y. Charlie Hu, Jin Li, Philip A. Chou. 834-838 [doi]
- Broadcast delay of epidemic routing in intermittently connected networksPhilippe Jacquet, Bernard Mans, Georgios Rodolakis. 839-843 [doi]
- Delay with network coding and feedbackEleni Drinea, Christina Fragouli, Lorenzo Keller. 844-848 [doi]
- On cooperative downlink transmission with frequency reuseMajid Nasiri Khormuji, Mikael Skoglund. 849-853 [doi]
- Distortion exponents for decode-and-forward multi-relay cooperative networksJing Wang, Jie Liang, Sami Muhaidat. 854-858 [doi]
- Communication by sleeping: Optimizing a relay channel under wake and transmit power costsVinod Prabhakaran, P. R. Kumar. 859-863 [doi]
- Power allocation game in a four node relay network: A lower bound on the price of anarchyAre Hjørungnes, Ninoslav Marina. 864-868 [doi]
- Asynchronous Slepian-Wolf code designZhibin Sun, Chao Tian, Jun Chen, Kon Max Wong. 869-873 [doi]
- Improved Slepian-Wolf exponents via Witsenhausen's rateBenjamin G. Kelly, Aaron B. Wagner. 874-878 [doi]
- Slepian-Wolf coding over cooperative networksMohammad Hossein Yassaee, Mohammad Reza Aref. 879-883 [doi]
- Distributed source coding without Slepian-Wolf compressionYang Yang, Zixiang Xiong. 884-888 [doi]
- New reduced state space BCJR algorithms for the ISI channelJohn B. Anderson, Adnan Prlja, Fredrik Rusek. 889-893 [doi]
- Analog turbo codes: A chaotic constructionKai Xie, Peiyu Tan, Boon Chong Ng, Jing Li. 894-898 [doi]
- Iterative decoding on multiple tanner graphs using random edge local complementationJoakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew G. Parker, Eirik Rosnes. 899-903 [doi]
- Robust initial LLRs for iterative decoders in presence of non-Gaussian noiseArun Ayyar, Michael Lentmaier, Giridhar Krishnamurthy, Gerhard Fettweis. 904-908 [doi]
- Time domain interference cancellation for Alamouti coded cooperative OFDM systems with insufficient CPZhefeng Li, Xiang-Gen Xia. 909-913 [doi]
- Some properties of Alamouti-like MISO codesRoope Vehkalahti. 914-918 [doi]
- Quadrature partial response signaling based on Alamouti CodeKyoung-Young Song, Jae Dong Yang, Xianglan Jin, Jong-Seon No, Habong Chung. 919-922 [doi]
- Novel rotated quasi-orthogonal space-time block codes with the fixed nearest neighbor numberAnzhong Wong, Jian-Kang Zhang. 923-927 [doi]
- Adaptive turbo equalizer with stopping rule based on LDPC codesMyung-Kyu Lee, Kyeongcheol Yang. 928-932 [doi]
- Demultiplexer design for multi-edge type LDPC coded modulationJing Lei, Wen Gao, Predrag Spasojevic, Roy D. Yates. 933-937 [doi]
- Disjoint LDPC coding for Gaussian broadcast channelsMahdi Ramezani, Masoud Ardakani. 938-942 [doi]
- Factor graph approach to distributed facility location in large-scale networksHung Quoc Ngo, Sungyoung Lee, Young-Koo Lee. 943-947 [doi]
- The capacity of quantum channels with side information at the transmitterFrédéric Dupuis. 948-952 [doi]
- Generalized concatenation for quantum codesMarkus Grassl, Peter W. Shor, Bei Zeng. 953-957 [doi]
- Engineering fault tolerance for realistic quantum systems via the full error dynamics of quantum codesA. Robert Calderbank, Gerald Gilbert, Yaakov S. Weinstein, Vaneet Aggarwal. 958-962 [doi]
- Receiver design to harness quantum illumination advantageSaikat Guha. 963-967 [doi]
- Vector Gaussian hypothesis testing and lossy one-helper problemAaron B. Wagner, Md Saifur Rahman. 968-972 [doi]
- The role of MVU estimator and CRB in binary composite hypothesis testAli Ghobadzadeh, Sayed Jalal Zahabi, AliAkbar Tadaion. 973-976 [doi]
- Transformation effects on invariant property of invariant hypothesis test and UMPI detectorMohammad Reza Taban, Ali Ghobadzadeh, AliAkbar Tadaion. 977-980 [doi]
- On arbitrarily varying Markov source coding and hypothesis LAO testing by non-informed statisticianEvgueni A. Haroutunian, Naira Grigoryan. 981-985 [doi]
- Protection against link errors and failures using network coding in overlay networksAditya Ramamoorthy, Shizheng Li. 986-990 [doi]
- Design of efficient robust network codes for multicast connectionsGraham Booker, Alex Sprintson. 991-995 [doi]
- On noncoherent correction of network errors and erasures with random locationsSvitlana Vyetrenko, Tracey Ho, Elona Erez. 996-1000 [doi]
- Rate rRegions for coherent and noncoherent multisource network error correctionSvitlana Vyetrenko, Tracey Ho, Michelle Effros, Jörg Kliewer, Elona Erez. 1001-1005 [doi]
- Optimal schedules for the D-node half duplex phase fading MRCLawrence Ong, Sarah J. Johnson, Mehul Motani. 1006-1010 [doi]
- Application of joint source-relay scheduling to cooperative multiple access channelsZhiguo Ding, Dennis Goeckel, Kin K. Leung, Don Towsley. 1011-1015 [doi]
- Soft-decision-and-forward protocol for cooperative communication networks based on Alamouti codeDong-Joon Shin, Kyoung-Young Song, Jong-Seon No. 1016-1019 [doi]
- Analysis of uncoordinated opportunistic two-hop wireless ad hoc systemsRadha Krishna Ganti, Martin Haenggi. 1020-1024 [doi]
- Efficient on-line schemes for encoding individual sequences with side information at the decoderAvraham Reani, Neri Merhav. 1025-1029 [doi]
- Source coding with a side information 'vending machine' at the decoderTsachy Weissman, Haim H. Permuter. 1030-1034 [doi]
- Lossy source coding with Gaussian or erased side-informationSuhas N. Diggavi, Etienne Perron, Emre Telatar. 1035-1039 [doi]
- Two lossy source coding problems with causal side-informationRoy Timo, Badri N. Vellambi. 1040-1044 [doi]
- Improved lower bounds on capacities of symmetric 2-dimensional constraints ising Rayleigh quotientsErez Louidor, Brian H. Marcus. 1045-1049 [doi]
- Approximate enumerative coding for 2-D constraints through ratios of maprix ProductsErik Ordentlich, Ron M. Roth. 1050-1054 [doi]
- Extending models for two-dimensional constraintsSøren Forchhammer. 1055-1059 [doi]
- Concave programming upper bounds on the capacity of 2-D constraintsRon M. Roth, Ido Tal. 1060-1064 [doi]
- Protection matching: A new scheduling rule for improved design of BICM-ID systemsJian-Jia Weng, Chung-Hsuan Wang. 1065-1069 [doi]
- Quantization for soft-output demodulators in bit-interleaved coded modulation systemsClemens Novak, Peter Fertl, Gerald Matz. 1070-1074 [doi]
- Error probability of BICM in fading channels: Uniform interleaving analysisAlfonso Martinez, Albert Guillen i Fabregas. 1075-1079 [doi]
- Analysis of 1-bit output noncoherent fading channels in the low SNR regimeJosef A. Nossek, Amine Mezghani. 1080-1084 [doi]
- On optimal precoding in linear vector Gaussian channels with arbitrary input distributionMiquel Payaró, Daniel P. Palomar. 1085-1089 [doi]
- Message passing in distributed wireless networksVaneet Aggarwal, Youjian Liu, Ashutosh Sabharwal. 1090-1094 [doi]
- On the ergodic capacity and precoder design of flat fading MIMO systems equipped with MMSE receiversCedric Artigue, Philippe Loubaton. 1095-1099 [doi]
- On the selection of semi-orthogonal users for zero-forcing beamformingGiuseppe Caire, Sandro Bellini, Alessandro Tomasoni, Marco Ferrari. 1100-1104 [doi]
- Authentication and secrecy codes for equiprobable source probability distributionsMichael Huber. 1105-1109 [doi]
- On improving security of GPT cryptosystemsHaitham Rashwan, Bahram Honary, Ernst M. Gabidulin. 1110-1114 [doi]
- Another look at weak feedback polynomials in the nonlinear combinerMartin Hell, Lennart Brynielsson. 1115-1119 [doi]
- Extended windmill polynomialsCédric Lauradoux. 1120-1124 [doi]
- Small-sample distribution estimation over sticky channelsFarzad Farnoud, Olgica Milenkovic, Narayana P. Santhanam. 1125-1129 [doi]
- The maximum likelihood probability of skewed patternsAlon Orlitsky, Shengjun Pan. 1130-1134 [doi]
- The maximum likelihood probability of unique-singleton, ternary, and length-7 patternsShengjun Pan, Jayadev Acharya, Alon Orlitsky. 1135-1139 [doi]
- A large-deviation analysis for the maximum likelihood learning of tree structuresVincent Y. F. Tan, Animashree Anandkumar, Lang Tong, Alan S. Willsky. 1140-1144 [doi]
- The quadratic Gaussian CEO problem with byzantine agentsOliver Kosut, Lang Tong. 1145-1149 [doi]
- Existence and construction of capacity-achieving network codes for distributed storageYunnan Wu. 1150-1154 [doi]
- A general security condition for multi-source linear network codingZhixue Zhang, Raymond W. Yeung. 1155-1158 [doi]
- An algebraic watchdog for wireless network codingMinji Kim, Ralf Koetter, Muriel Médard, João Barros. 1159-1163 [doi]
- Byzantine attacks against network coding in peer to peer distributed storageLuísa Lima, João Barros, Ralf Koetter. 1164-1168 [doi]
- Compress-and-forward strategy for the relay channel with non-causal State InformationBahareh Akhbari, Mahtab Mirmohseni, Mohammad Reza Aref. 1169-1173 [doi]
- Cooperative relay-broadcast channels with causal Channel State InformationReza Khosravi-Farsani, Bahareh Akhbari, Mahtab Mirmohseni, Mohammad Reza Aref. 1174-1178 [doi]
- On the simultaneous relay channel with informed receiversArash Behboodi, Pablo Piantanida. 1179-1183 [doi]
- Functional forwarding of channel state informationJiening Zhan, Michael Gastpar. 1184-1188 [doi]
- Secrecy throughput of MANETs with malicious nodesYingbin Liang, H. Vincent Poor, Lei Ying. 1189-1193 [doi]
- An outer bound for side-information scalable source coding with partially cooperating decodersShraga I. Bross, Tsachy Weissman. 1194-1198 [doi]
- Cascade multiterminal source codingPaul Cuff, Han-I Su, Abbas El Gamal. 1199-1203 [doi]
- High-resolution predictive Wyner-Ziv coding of Gaussian sourcesXuechen Chen, Ertem Tuncel. 1204-1208 [doi]
- The Gray-Wyner network with a limited-rate helper to the encoder and decodersLei Zhao, Haim H. Permuter. 1209-1213 [doi]
- Closed forms of the achievable rate region for Wyner's source coding systemsTetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto. 1214-1218 [doi]
- Universal rewriting in constrained memoriesAnxiao Jiang, Michael Langberg, Moshe Schwartz, Jehoshua Bruck. 1219-1223 [doi]
- On the lifetime of multilevel memoriesLuis Alfonso Lastras-Montaño, Michele Franceschini, Thomas Mittelholzer, John P. Karidis, Mark Wegman. 1224-1228 [doi]
- Storage coding for wear leveling in flash memoriesJehoshua Bruck, Alexander Vardy, Anxiao Andrew Jiang, Eitan Yaakobi, Jack K. Wolf, Robert Mateescu, Paul H. Siegel. 1229-1233 [doi]
- On the capacity of bounded rank modulation for flash memoriesJehoshua Bruck, Anxiao Jiang, Zhiying Wang. 1234-1238 [doi]
- A nearly optimal construction of flash codesHessam Mahdavifar, Paul H. Siegel, Alexander Vardy, Jack K. Wolf, Eitan Yaakobi. 1239-1243 [doi]
- New asymptotic bounds on the size of list codes on Euclidean sphereVladimir Blinovsky, Simon Litsyn. 1244-1247 [doi]
- Multiplicity assignments for algebraic soft-decoding of Reed-Solomon codes using the method of typesHirakendu Das, Alexander Vardy. 1248-1252 [doi]
- On error correction with feedback under list decodingOfer Shayevitz. 1253-1257 [doi]
- Noisy feedback schemes and rate-error tradeoffs from stochastic approximationUtsaw Kumar, J. Nicholas Laneman, Vijay Gupta. 1258-1262 [doi]
- LR-aided MMSE lattice decoding is DMT optimal for all approximately universal codesJoakim Jalden, Petros Elia. 1263-1267 [doi]
- Design of close to optimal Euclidean distance MIMO-precodersFredrik Rusek, Dzevdan Kapetanovic. 1268-1272 [doi]
- Optimal natural encoding scheme for discrete multiplicative degraded broadcast channelsRichard D. Wesel, Bike Xie. 1273-1277 [doi]
- On convergence constrained precoder design for iterative frequency domain MIMO detectorJuha Karjalainen, Tadashi Matsumoto, Antti Tölli, Markku J. Juntti. 1278-1282 [doi]
- On the compound MIMO broadcast channels with confidential messagesMari Kobayashi, Yingbin Liang, Shlomo Shamai, Mérouane Debbah. 1283-1287 [doi]
- Perfect secrecy, perfect omniscience and steiner tree packingSirin Nitinawarat, Alexander Barg, Prakash Narayan, Chunxuan Ye, Alex Reznik. 1288-1292 [doi]
- Efficient oblivious transfer from algebraic signaling over the Gaussian channelMotohiko Isaka. 1293-1297 [doi]
- Strongly secure privacy amplification cannot be obtained by encoder of Slepian-Wolf codeShun Watanabe, Tsuki Saitou, Ryutaroh Matsumoto, Tomohiko Uyematsu. 1298-1302 [doi]
- Bootstrapped oblivious transfer and secure two-party function computationYe Wang, Prakash Ishwar. 1303-1307 [doi]
- A coding theorem for cheating-detectable (2, 2)-threshold blockwise secret sharing schemesMitsugu Iwamoto, Hirosuke Yamamoto, Hiroki Koga. 1308-1312 [doi]
- Optimal secure message transmission by public discussionHongsong Shi, Shaoquan Jiang, Reihaneh Safavi-Naini, Mohammed Ashraful Tuhin. 1313-1317 [doi]
- Minimum description length and clustering with exemplarsPo-Hsiang Lai, Joseph A. O'Sullivan, Robert Pless. 1318-1322 [doi]
- Deformed statistics formulation of the information bottleneck methodRavi C. Venkatesan, Angelo Plastino. 1323-1327 [doi]
- Achievability results for statistical learning under communication constraintsMaxim Raginsky. 1328-1332 [doi]
- Structured variational methods for distributed inference: Convergence analysis and performance-complexity tradeoffYanbing Zhang, Huaiyu Dai. 1333-1337 [doi]
- Sequential probability assignment via online convex programming using exponential familiesMaxim Raginsky, Roummel F. Marcia, Jorge Silva, Rebecca M. Willett. 1338-1342 [doi]
- On networks with side informationAsaf Cohen, Amir Salman Avestimehr, Michelle Effros. 1343-1347 [doi]
- On feedback in network source codingMayank Bakshi, Michelle Effros. 1348-1352 [doi]
- Feasible alphabets for communicating the sum of sources over a networkBrijesh K. Rai, Bikash K. Dey. 1353-1357 [doi]
- Searching for high-rate convolutional codes via binary syndrome trellisesFlorian Hug, Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov. 1358-1362 [doi]
- Performance evaluation of Viterbi decoders by multicanonical Monte Carlo simulationsMarco Secondini, Dario Fertonani, Giulio Colavolpe, Enrico Forestieri. 1363-1367 [doi]
- Design and construction of protocol sequences: Shift invariance and user irrepressibilityWing Shing Wong, Kenneth W. Shum, Chung Shue Chen, Chi Wan Sung. 1368-1372 [doi]
- Cooperation in the MAC channel using frequency division multiplexingAnders Høst-Madsen, Momin Uppal, Zixiang Xiong. 1373-1377 [doi]
- On cyclic frequency diversity for single-carrier packet retransmissionsAbdel-Nasser Assimi, Charly Poulliat, Inbar Fijalkow. 1378-1382 [doi]
- A new approach to improve multiplexing gain in decentralized networks via frequency hopping and repetition codingKamyar Moshksar, Amir K. Khandani. 1383-1387 [doi]
- An algebraic tool for obtaining conditional non-vanishing determinantsCamilla Hollanti, Roope Vehkalahti, Hsiao-feng Lu. 1388-1392 [doi]
- On Extended Forney-Kovalev GMD decodingVladimir Sidorenko, Anas Chaaban, Christian Senger, Martin Bossert. 1393-1397 [doi]
- Modified Euclidean algorithms for decoding Reed-Solomon codesDilip V. Sarwate, Zhiyuan Yan. 1398-1402 [doi]
- Delay-optimal power control and performance analysis in SDMA system with limited buffer size via stochastic decompositionLiangzhong Ruan, Vincent K. N. Lau. 1403-1407 [doi]
- On the delay of network coding over line networksTheodoros K. Dikaliotis, Alexandros G. Dimakis, Tracey Ho, Michelle Effros. 1408-1412 [doi]
- Improved delay estimates for a queueing model for random linear coding for unicastMohammad Ravanbakhsh, Angela I. Barbero, Øyvind Ytrehus. 1413-1417 [doi]
- A fundamental characterization of stability in broadcast queueing systemsChan Zhou, Gerhard Wunder. 1418-1422 [doi]
- Random linear network coding for time-division duplexing: Queueing analysisMuriel Médard, Daniel Enrique Lucani, Milica Stojanovic. 1423-1427 [doi]
- Diversity-multiplexing tradeoff for the MIMO static half-duplex relayOlivier Lévêque, Christophe Vignat, Melda Yüksel. 1428-1432 [doi]
- Secure diversity-multiplexing tradeoffs in MIMO relay channelsKiran Thimme Gowda, Tony Q. S. Quek, Hyundong Shin. 1433-1437 [doi]
- Cooperative multiplexing in the multiple antenna half duplex relay channelVinayak Nagpal, Sameer Pawar, David Tse, Borivoje Nikolic. 1438-1442 [doi]
- Diversity-multiplexing tradeoff of the dynamic decode and forward protocol on a MIMO half-duplex relay channelSanjay Karmakar, Mahesh K. Varanasi. 1443-1447 [doi]
- The MIMO Wireless Switch: Relaying can increase the multiplexing gainYahya Mohasseb, Hassan Ghozlan, Gerhard Kramer, Hesham El Gamal. 1448-1452 [doi]
- Distributed lossy averagingHan-I Su, Abbas El Gamal. 1453-1457 [doi]
- Code design for quadratic Gaussian multiterminal source coding: The symmetric caseYifu Zhang, Zixiang Xiong, Yang Yang. 1458-1462 [doi]
- On the minimum sum rate of Gaussian multiterminal source coding: New proofsJia Wang, Jun Chen, Xiaolin Wu. 1463-1467 [doi]
- Approximating the rate-distortion region of the distributed source coding for three jointly Gaussian tree-structured sourcesMohammad Ali Maddah-Ali, David N. C. Tse. 1468-1472 [doi]
- Two-way source coding with a common helperTsachy Weissman, Yossef Steinberg, Haim H. Permuter. 1473-1477 [doi]
- A class of transformations that polarize binary-input memoryless channelsSatish Babu Korada, Eren Sasoglu. 1478-1482 [doi]
- Polar codes: Characterization of exponent, bounds, and constructionsSatish Babu Korada, Eren Sasoglu, Rüdiger L. Urbanke. 1483-1487 [doi]
- Performance of polar codes for channel and source codingNadine Hussami, Rüdiger L. Urbanke, Satish Babu Korada. 1488-1492 [doi]
- On the rate of channel polarizationErdal Arikan, Emre Telatar. 1493-1495 [doi]
- Performance and construction of polar codes on symmetric binary-input memoryless channelsRyuhei Mori, Toshiyuki Tanaka. 1496-1500 [doi]
- Noisy feedback improves the BSC reliability functionHirosuke Yamamoto, Marat V. Burnashev. 1501-1505 [doi]
- Feedback communication over individual channelsYuval Lomnitz, Meir Feder. 1506-1510 [doi]
- Power adaptive feedback communication over an additive individual noise sequence channelYuval Lomnitz, Meir Feder. 1511-1514 [doi]
- Upper bounds to error probability with feedbackBaris Nakiboglu, Lizhong Zheng. 1515-1519 [doi]
- A stochastic control viewpoint on 'Posterior Matching'-style feedback communication schemesTodd P. Coleman. 1520-1524 [doi]
- Infinite-layer codes for single-user slowly fading MIMO channelsVahid Pourahmadi, Abolfazl S. Motahari, Amir K. Khandani. 1525-1529 [doi]
- Structured superposition for backhaul constrained cellular uplinkBobak Nazer, Amichai Sanderovich, Michael Gastpar, Shlomo Shamai. 1530-1534 [doi]
- On destructive superposition of shaping pulses in band-limited linear modulation systemsHideki Ochiai, Makoto Tanahashi. 1535-1539 [doi]
- Analysis of PAPR reduction performance of SLM schemes with correlated phase vectorsSeok-Joong Heo, Hyun-Seung Joo, Jong-Seon No, Dae-Woon Lim, Dong-Joon Shin. 1540-1543 [doi]
- Coded modulation with a constraint on the minimum channel symbol durationAnil Mengi, A. J. Han Vinck. 1544-1548 [doi]
- Enumerative maximum-transition-run codesThomas Mittelholzer. 1549-1553 [doi]
- Simple balanced codes that approach capacityKees A. Schouhamer Immink, Jos H. Weber. 1554-1558 [doi]
- Insertion rate and optimization of redundancy of constrained systems with unconstrained positionsHiroshi Kamabe. 1559-1563 [doi]
- Efficient balancing of q-ary sequences with parallel decodingTheo G. Swart, Jos H. Weber. 1564-1568 [doi]
- The zeta function of a periodic-finite-type shiftNavin Kashyap, Akiko Manada. 1569-1573 [doi]
- Influence in a large society: Interplay between information dynamics and network structureLara Dolecek, Devavrat Shah. 1574-1578 [doi]
- On application of nonparametric regression estimation to options pricingMichael Kohler, Adam Krzyzak, Harro Walk. 1579-1583 [doi]
- Information transfer by energy-efficient neuronsToby Berger, William B. Levy. 1584-1588 [doi]
- Spiking neuron channelShiro Ikeda, Jonathan H. Manton. 1589-1593 [doi]
- Coding stimulus information with cooperative neural populationsMehdi Aghagolzadeh, Seif Eldawlatly, Karim G. Oweiss. 1594-1598 [doi]
- Diversity-Multiplexing tradeoff of the two-user interference channelAdnan Raja, Pramod Viswanath. 1599-1603 [doi]
- On the achievable diversity-multiplexing tradeoff in interference channelsCemal Akçaba, Helmut Bölcskei. 1604-1608 [doi]
- Symmetric feedback capacity of the Gaussian interference channel to within one bitChangho Suh, David Tse. 1609-1613 [doi]
- On Diversity-Multiplexing Tradeoff of the Interference ChannelHamid Ebrahimzad, Amir K. Khandani. 1614-1618 [doi]
- Monotonic convergence of distributed interference pricing in wireless networksChangxin Shi, Randall A. Berry, Michael L. Honig. 1619-1623 [doi]
- Opportunistic scheduling in large-scale wireless networksMehdi Ansari Sadrabadi, Alireza Bayesteh, Eytan Modiano. 1624-1628 [doi]
- On an information theoretic approach to model anonymous MANET communicationsDijiang Huang. 1629-1633 [doi]
- Analysis of multiple-unicast throughput in finite-buffer Delay-Tolerant NetworksRamanan Subramanian, Faramarz Fekri. 1634-1638 [doi]
- On fidelity per unit costMarius Kleiner, Bixio Rimoldi. 1639-1643 [doi]
- Coding along Hermite polynomials for Gaussian noise channelsEmmanuel Abbe, Lizhong Zheng. 1644-1648 [doi]
- Lower bounds on the information rate of intersymbol interference channels based on the Ungerboeck observation modelFredrik Rusek, Dario Fertonani. 1649-1653 [doi]
- Concavity of mutual information rate for input-restricted finite-state memoryless channels at high SNRGuangyue Han, Brian H. Marcus. 1654-1658 [doi]
- On the convergence of iterative belief propagationAxel Heim, Ulrich Sorger. 1659-1663 [doi]
- New group shuffled BP decoding algorithms for LDPC codesYu-Liang Chen, Chang-Ming Lee, Yu Ted Su, Chi-Yuan Chang. 1664-1668 [doi]
- Analysis of LDPC decoding schedulesEran Sharon, Noam Presman, Simon Litsyn. 1669-1673 [doi]
- Fixing convergence of Gaussian belief propagationDanny Dolev, Danny Bickson, Jason K. Johnson. 1674-1678 [doi]
- Selective Mapping for channel inversion precoding in multiple-antenna broadcast systemsAmin Mobasher, Mohammad Ali Maddah-Ali, Amir K. Khandani. 1679-1683 [doi]
- Linear precoded cooperative transmission protocol for wireless broadcast channelsChee Yen (Bruce) Leow, Zhiguo Ding, Kin K. Leung. 1684-1688 [doi]
- Noisy feedback linear precoding: A Bayesian Cramér-Rao boundAlon Shalev Housfater, Teng Joon Lim. 1689-1693 [doi]
- MISO broadcast channel with user-cooperation and limited feedbackHyukjoon Kwon, John M. Cioffi. 1694-1698 [doi]
- The capacity region of the symbol-asynchronous Gaussian multiple-access channel with orthogonal signalingHon-Fah Chong, Mehul Motani. 1699-1703 [doi]
- New bounds on the maximal error exponent for multiple-access channelsS. Sandeep Pradhan, Ali Nazari, Achilleas Anastasopoulos. 1704-1708 [doi]
- Error exponent of exclusive-or multiple-access channelsJinho Kim, Wayne E. Stark. 1709-1713 [doi]
- Sum capacity of multi-source linear finite-field relay networks with fadingSang-Woon Jeon, Sae-Young Chung. 1714-1718 [doi]
- Cyclic codes over F2 + vF2Shixin Zhu, Yu Wang, Minjia Shi. 1719-1722 [doi]
- Triple-error-correcting BCH-like codesCarl Bracken, Tor Helleseth. 1723-1725 [doi]
- On the weight distribution of a class of cyclic codesJinquan Luo, Yuansheng Tang, Hongyu Wang. 1726-1729 [doi]
- a, m)Shixin Zhu, Xiaoshan Kai, Ping Li. 1730-1733 [doi]
- An impossibility result for process discriminationDaniil Ryabko. 1734-1738 [doi]
- Deinterleaving Markov processes via penalized MLGadiel Seroussi, Marcelo J. Weinberger, Wojciech Szpankowski. 1739-1743 [doi]
- On the distribution of indefinite quadratic forms in Gaussian random variablesTareq Y. Al-Naffouri, Babak Hassibi. 1744-1748 [doi]
- Factorization of joint probability mass functions into parity check interactionsMuhammet Fatih Bayramoglu, Ali Özgür Yilmaz. 1749-1753 [doi]
- Achieving linear scaling with interference alignmentAyfer Özgür, David Tse. 1754-1758 [doi]
- Interference alignment with limited feedbackHelmut Bölcskei, Jatin Thukral. 1759-1763 [doi]
- Relay-aided interference alignment for the quasi-static X channelBehzad Nourani, Abolfazl S. Motahari, Amir K. Khandani. 1764-1768 [doi]
- Ergodic interference alignmentBobak Nazer, Syed Ali Jafar, Michael Gastpar, Sriram Vishwanath. 1769-1773 [doi]
- Generalized results of transmission capacities for overlaid wireless networksChangchuan Yin, Changhai Chen, Tie Liu, Shuguang Cui. 1774-1778 [doi]
- To code or not to code: Rate optimality in node-capacitated networksSidharth Jaggi, Ziyu Shao, Shuo-Yen Robert Li. 1779-1783 [doi]
- Coding improves the throughput-delay trade-off in mobile wireless networksZhenning Kong, Edmund M. Yeh, Emina Soljanin. 1784-1788 [doi]
- Cooperation above the physical layer: The case of a simple networkBeiyu Rong, Anthony Ephremides. 1789-1793 [doi]
- Capacity of channels with action-dependent statesTsachy Weissman. 1794-1798 [doi]
- Capacity and error exponent analysis of multilevel coding with multistage decodingAmir Ingber, Meir Feder. 1799-1803 [doi]
- Simple channel coding boundsLigong Wang, Renato Renner, Roger Colbeck. 1804-1808 [doi]
- On the heat channel and its capacityEdwin Hammerich. 1809-1813 [doi]
- Stopping set analysis of repeat multiple-accumulate codesEirik Rosnes, Alexandre Graell i Amat. 1814-1818 [doi]
- Trapping set enumerators for repeat multiple accumulate code ensemblesChristian Koller, Alexandre Graell i Amat, Jörg Kliewer, Daniel J. Costello Jr.. 1819-1823 [doi]
- On unequal error protection of finite-length LDPC codes over BECs: A scaling approachAmir H. Djahanshahi, Laurence B. Milstein, Paul H. Siegel. 1824-1828 [doi]
- Generating functional analysis of LDGM channel coding with many short loopsKazushi Mimura, A. C. C. Coolen. 1829-1833 [doi]
- Latent capacity region: A case study on symmetric broadcast with common messagesChao Tian. 1834-1838 [doi]
- Capacity regions of two new classes of 2-receiver broadcast channelsChandra Nair. 1839-1843 [doi]
- On 3-receiver broadcast channels with 2-degraded message setsChandra Nair, Zizhou Vincent Wang. 1844-1848 [doi]
- 3-Receiver broadcast channels with common and confidential messagesYeow-Khiang Chia, Abbas El Gamal. 1849-1853 [doi]
- Coset codes for compound multiple access channels with common informationHideki Yagi, H. Vincent Poor. 1854-1858 [doi]
- Coding for two-user Gaussian MAC with PSK and PAM signal setsJagadeesh Harshan, B. Sundar Rajan. 1859-1863 [doi]
- Diversity-multiplexing tradeoff-optimal code constructions for symmetric MIMO multiple access channelsHsiao-feng Lu, Camilla Hollanti. 1864-1868 [doi]
- On multiple access random medium access controlTao Cui, Tracey Ho. 1869-1873 [doi]
- Information Rate loss from radiation decoherenceAlfonso Martinez. 1874-1878 [doi]
- Efficient reconciliation protocol for discrete-variable quantum key distributionDavid Elkouss, Anthony Leverrier, Romain Alleaume, Joseph Jean Boutros. 1879-1883 [doi]
- Optimal axis compensation in quantum key distribution protocols over unital channelsTomohiko Uyematsu, Shun Watanabe, Ryutaroh Matsumoto. 1884-1888 [doi]
- Entanglement transmission capacity of compound channelsIgor Bjelakovic, Holger Boche, Janis Noetzel. 1889-1893 [doi]
- Fisher information determinant and stochastic complexity for Markov modelsJun-ichi Takeuchi. 1894-1898 [doi]
- A criterion for the compound poisson distribution to be maximum entropyOliver Johnson, Ioannis Kontoyiannis, Mokshay M. Madiman. 1899-1903 [doi]
- Embedding maximum entropy models in algebraic varieties by Gröbner bases methodsAmbedkar Dukkipati. 1904-1908 [doi]
- Maximum likelihood time-of-arrival estimation of optical pulses via photon-counting photodetectorsBaris I. Erkmen, Bruce E. Moision. 1909-1913 [doi]
- On the Degrees of Freedom of the 3-user Gaussian interference channel: The symmetric caseAbolfazl S. Motahari, Amir K. Khandani, Shahab Oveis Gharan. 1914-1918 [doi]
- On the Degrees-of-Freedom of the K-user Gaussian interference channelRaúl H. Etkin, Erik Ordentlich. 1919-1923 [doi]
- Capacity of a class of symmetric SIMO Gaussian interference channels within O(1)Tiangao Gou, Syed Ali Jafar. 1924-1928 [doi]
- Interference alignment and the generalized degrees of freedom of the X channelChiachi Huang, Viveck R. Cadambe, Syed Ali Jafar. 1929-1933 [doi]
- Invertible extractors and wiretap protocolsMahdi Cheraghchi, Frédéric Didier, Amin Shokrollahi. 1934-1938 [doi]
- Tandem coding and cryptography on wiretap channels: EXIT chart analysisWillie K. Harrison, Steven W. McLaughlin. 1939-1943 [doi]
- Wiretap channel type II with an active eavesdropperVaneet Aggarwal, Lifeng Lai, A. Robert Calderbank, H. Vincent Poor. 1944-1948 [doi]
- The Shannon cipher system with a guessing wiretapper: General sourcesRajesh Sundaresan, Manjesh Kumar Hanawal. 1949-1953 [doi]
- The Gelfand-Pinsker channel: Strong converse and upper bound for the reliability functionHimanshu Tyagi, Prakash Narayan. 1954-1957 [doi]
- Strong converse for Gel'fand-Pinsker channelPierre Moulin. 1958-1962 [doi]
- On the rate-limited Gelfand-Pinsker problemRavi Tandon, Sennur Ulukus. 1963-1967 [doi]
- Capacity of compound state-dependent channels with states known at the transmitterPablo Piantanida, Shlomo Shamai. 1968-1972 [doi]
- Variable length lossy coding using an LDPC codeJunya Honda, Hirosuke Yamamoto. 1973-1977 [doi]
- Efficient LDPC codes over GF(q) for lossy data compressionAlfredo Braunstein, Riccardo Zecchina, Farbod Kayhan. 1978-1982 [doi]
- On a class of doubly-generalized LDPC codes with single parity-check variable nodesEnrico Paolini, Mark F. Flanagan, Marco Chiani, Marc P. C. Fossorier. 1983-1987 [doi]
- Design of multi-edge type bilayer-expurgated LDPC codesMarwan H. Azmi, Jinhong Yuan. 1988-1992 [doi]
- Low-complexity near-ML decoding of large non-orthogonal STBCs using reactive tabu searchB. Sundar Rajan, Saif K. Mohammed, Ananthanarayanan Chockalingam, Nagaraja Srinidhi. 1993-1997 [doi]
- Low-complexity near-MAP decoding of large non-orthogonal STBCs using PDASaif K. Mohammed, Ananthanarayanan Chockalingam, B. Sundar Rajan. 1998-2002 [doi]
- Belief propagation based decoding of large non-orthogonal STBCsMadhekar Suneel, Pritam Som, Ananthanarayanan Chockalingam, B. Sundar Rajan. 2003-2007 [doi]
- m transmit antennasK. Pavan Srinath, B. Sundar Rajan. 2008-2012 [doi]
- Coding for the bidirectional broadcast channel with random states known at the encoderTobias J. Oechtering, Mikael Skoglund. 2013-2017 [doi]
- Approximate capacity region of the two-pair bidirectional Gaussian relay networkBabak Hassibi, Aydin Sezgin, M. Amin Khajehnejad, Amir Salman Avestimehr. 2018-2022 [doi]
- Interference Channel aided by an Infrastructure RelayOsvaldo Simeone, Onur Sahin, Elza Erkip. 2023-2027 [doi]
- Amplify-and-forward two-way relay channels: Error exponentsTony Q. S. Quek, Hien Quoc Ngo, Hyundong Shin. 2028-2032 [doi]
- Spherical codes on torus layersCristiano Torezzan, Sueli I. R. Costa, Vinay A. Vaishampayan. 2033-2037 [doi]
- On concentric spherical codes and permutation codes with multiple initial codewordsHa Quy Nguyen, Vivek K. Goyal, Lav R. Varshney. 2038-2042 [doi]
- The expected complexity of sphere decoding algorithm in spatial correlated MIMO channelsJibo Wei, Xing Lan. 2043-2047 [doi]
- Generalization of Plotkin bound to the case of multiple packingVladimir Blinovsky. 2048-2050 [doi]
- An iterative algorithm for trust and reputation managementErman Ayday, Hanseung Lee, Faramarz Fekri. 2051-2055 [doi]
- Entropy of the induced transformations associated with the interval algorithmHiroshi Fujisaki. 2056-2060 [doi]
- On the expressibility of stochastic switching circuitsHongchao Zhou, Jehoshua Bruck. 2061-2065 [doi]
- The robustness of stochastic switching networksPo-Ling Loh, Hongchao Zhou, Jehoshua Bruck. 2066-2070 [doi]
- Interference management through cooperationVinod M. Prabhakaran, Pramod Viswanath. 2071-2075 [doi]
- Opportunistic interference managementNilesh Khude, Vinod M. Prabhakaran, Pramod Viswanath. 2076-2080 [doi]
- Capacity bounds of half-duplex gaussian cooperative interference channelYong Peng, Dinesh Rajan. 2081-2085 [doi]
- The Gaussian many-to-one interference channel with confidential messagesXiang He, Aylin Yener. 2086-2090 [doi]
- On the secrecy rate of interference networks using structured codesShweta Agrawal, Sriram Vishwanath. 2091-2095 [doi]
- Secure communication with a Byzantine relayXiang He, Aylin Yener. 2096-2100 [doi]
- A soft decision helper data algorithm for SRAM PUFsRoel Maes, Pim Tuyls, Ingrid Verbauwhede. 2101-2105 [doi]
- Robust key agreement schemesTerence Chan, Ning Cai, Alex J. Grant. 2106-2110 [doi]
- Caching in wireless networksUrs Niesen, Devavrat Shah, Gregory W. Wornell. 2111-2115 [doi]
- Secure coding over networksJin Xu, Biao Chen. 2116-2120 [doi]
- Communicating the sum of sources in a 3-sources/3-terminals networkMichael Langberg, Aditya Ramamoorthy. 2121-2125 [doi]
- Joint source-channel coding at the application layer for parallel Gaussian sourcesOzgun Y. Bursalioglu, Giuseppe Caire, Maria Fresia, H. Vincent Poor. 2126-2130 [doi]
- Optimized concatenated LDPC codes for joint source-channel codingMaria Fresia, Fernando Pérez-Cruz, H. Vincent Poor. 2131-2135 [doi]
- Joint source-channel coding via statistical mechanics: Thermal equilibrium between the source and the channelNeri Merhav. 2136-2140 [doi]
- A computation approach to the minimum total rate problem of causal video codingEn-Hui Yang, Lin Zheng, Zhen Zhang, Da-ke He. 2141-2145 [doi]
- Adaptive decoding of LDPC codes with binary messagesIngmar Land, Gottfried Lechner, Lars K. Rasmussen. 2146-2150 [doi]
- Multi-stage decoding of LDPC codesJonathan S. Yedidia, Stark C. Draper, Yige Wang. 2151-2155 [doi]
- Two-bit message passing decoders for LDPC codes over the binary symmetric channelShashi Kiran Chilappagari, David Declercq, Lucile Sassatelli, Bane V. Vasic. 2156-2160 [doi]
- LDPC decoding and code design on extrinsic treesEric Psota, Lance C. Pérez. 2161-2165 [doi]
- Candidate bit based bit-flipping decoding algorithm for LDPC codesGuiqiang Dong, Yanan Li, Ningde Xie, Tong Zhang 0002, Huaping Liu. 2166-2168 [doi]
- Coded modulation with mismatched power control over block-fading channelsTùng T. Kim, Albert Guillen i Fabregas. 2169-2173 [doi]
- On the sensitivity of noncoherent capacity to the channel modelGiuseppe Durisi, Veniamin I. Morgenshtern, Helmut Bölcskei. 2174-2178 [doi]
- Physical modeling of communication systems in information theoryMichel T. Ivrlac, Josef A. Nossek. 2179-2183 [doi]
- Pilot contamination problem in multi-cell TDD systemsJubin Jose, Alexei E. Ashikhmin, Thomas L. Marzetta, Sriram Vishwanath. 2184-2188 [doi]
- What is the value of joint processing of pilots and data in block-fading channels?Thomas L. Marzetta, Nihar Jindal, Angel E. Lozano. 2189-2193 [doi]
- On the capacity of the discrete-time channel with uniform output quantizationYiyue Wu, Linda M. Davis, A. Robert Calderbank. 2194-2198 [doi]
- On block noncoherent communication with low-precision phase quantization at the receiverJaspreet Singh, Upamanyu Madhow. 2199-2203 [doi]
- Dispersion of Gaussian channelsYury Polyanskiy, H. Vincent Poor, Sergio Verdú. 2204-2208 [doi]
- Dispersion of the Gilbert-Elliott channelYury Polyanskiy, H. Vincent Poor, Sergio Verdú. 2209-2213 [doi]
- A lower bound for the capacity of the discrete-time Poisson channelAlfonso Martinez. 2214-2215 [doi]
- Valid inequalities for binary linear codesStefan Ruzika, Akin Tanatmis, Frank Kienle, Horst W. Hamacher, Norbert Wehn, Mayur Punekar. 2216-2220 [doi]
- Construction and covering properties of constant-dimension codesMaximilien Gadouleau, Zhiyuan Yan. 2221-2225 [doi]
- Decoder error probability of bounded distance decoders for constant-dimension codesMaximilien Gadouleau, Zhiyuan Yan. 2226-2230 [doi]
- Some fundamental coding theoretic limits of unequal error protectionShashi Borade, Sujay Sanghavi. 2231-2235 [doi]
- The optimum distance profiles of the second order Reed-Muller codesYanling Chen, A. J. Han Vinck. 2236-2240 [doi]
- Searching methods for biometric identification systems: Fundamental limitsFrans M. J. Willems. 2241-2245 [doi]
- Combinatorial data reduction algorithm and its applications to biometric verificationVladimir B. Balakirsky, Anahit R. Ghazaryan, A. J. Han Vinck. 2246-2250 [doi]
- Secret rate - Privacy leakage in biometric systemsTanya Ignatenko, Frans M. J. Willems. 2251-2255 [doi]
- Saddle-point solution of the fingerprinting capacity game under the marking assumptionYen-Wei Huang, Pierre Moulin. 2256-2260 [doi]
- Two-level fingerprinting codesN. Prasanth Anthapadmanabhan, Alexander Barg. 2261-2265 [doi]
- Optimal spectrum management in multiuser interference channelsYue Zhao, Gregory J. Pottie. 2266-2270 [doi]
- A novel graph-based soft interference cancellation algorithm for FDM-CPM satellite systemsAmina Piemontese, Giulio Colavolpe. 2271-2275 [doi]
- Reducing repair traffic for erasure coding-based storage via interference alignmentYunnan Wu, Alexandros G. Dimakis. 2276-2280 [doi]
- Resource management in interference channels with asynchronous usersKamyar Moshksar, Amir K. Khandani. 2281-2285 [doi]
- Secret key agreement using asymmetry in channel state knowledgeAshish Khisti, Gregory W. Wornell, Suhas N. Diggavi. 2286-2290 [doi]
- Secure communication in the low-SNR regime: A Characterization of the energy-secrecy tradeoffMustafa Cenk Gursoy. 2291-2295 [doi]
- Minimum energy per bit for secret key acquisition over multipath wireless channelsStark C. Draper, Akbar M. Sayeed, Tzu-Han Chou. 2296-2300 [doi]
- On secrecy capacity per unit costMustafa El-Halabi, Tie Liu, Costas N. Georghiades. 2301-2305 [doi]
- Information-theoretic bounds for multiround function computation in collocated networksNan Ma, Prakash Ishwar, Piyush Gupta. 2306-2310 [doi]
- Identification over multiple databasesErtem Tuncel, H. Vincent Poor, Andrea Goldsmith, Deniz Gündüz. 2311-2315 [doi]
- A strong converse for a collection of network source coding problemsWei-Hsin Gu, Michelle Effros. 2316-2320 [doi]
- Relaying simultaneous multicasts via structured codesDeniz Gündüz, Osvaldo Simeone, Andrea Goldsmith, H. Vincent Poor, Shlomo Shamai. 2321-2325 [doi]
- Analysis of the second moment of the LT decoderGhid Maatouk, Amin Shokrollahi. 2326-2330 [doi]
- Quasi-systematic doped LT codesXiaojun Yuan, Li Ping. 2331-2335 [doi]
- Raptor packets: A packet-centric approach to distributed raptor code designCedomir Stefanovic, Vladimir Stankovic, Milos Stojakovic, Dejan Vukobratovic. 2336-2340 [doi]
- Concatenated fountain codesZheng Wang, Jie Luo 0001. 2341-2345 [doi]
- Upper bounds on the capacities of non-controllable finite-state channels using dynamic programming methodsXiujie Huang, Aleksandar Kavcic, Xiao Ma, Danilo P. Mandic. 2346-2350 [doi]
- On the impact of quantized channel feedback in guaranteeing secrecy with artificial noiseYa-Lan Liang, Yung-Shun Wang, Tsung-Hui Chang, Yao-Win Peter Hong, Chong-Yung Chi. 2351-2355 [doi]
- A new sum-rate outer bound for Gaussian Interference Channels with Generalized FeedbackShuang Yang, Daniela Tuninetti. 2356-2360 [doi]
- Channel state feedback over the MIMO-MACK. Raj Kumar, Giuseppe Caire. 2361-2365 [doi]
- Delay minimization in multiple access channelsJing Yang 0002, Sennur Ulukus. 2366-2370 [doi]
- A new achievable rate region for the discrete memoryless multiple-access channel with feedbackRamji Venkataramanan, S. Sandeep Pradhan. 2371-2375 [doi]
- Multiaccess channels with state known to one encoder: Another case of degraded message setsAbdellatif Zaidi, Luc Vandendorpe, Shivaprasad Kotagiri, J. Nicholas Laneman. 2376-2380 [doi]
- On capacity computation for the two-user binary multiple-access channelGerhard Wunder, Jörg Bühler. 2381-2385 [doi]
- Cross twisted Xate pairing with Barreto-Naehrig curve for multi-pairing techniqueYumi Sakemi, Yoshitaka Morikawa, Yasuyuki Nogami, Hidehiro Kato. 2386-2390 [doi]
- Elliptic curves with a pre-determined embedding degreeShoujiro Hirasawa, Atsuko Miyaji. 2391-2395 [doi]
- Construction of cubic self-dual codesSunghyu Han, Heisook Lee, Yoonjin Lee, Jon-Lark Kim. 2396-2399
- Self-dual codes using the building-up constructionJon-Lark Kim, Yoonjin Lee. 2400-2402 [doi]
- Connectivity results for random key graphsOsman Yagan, Armand M. Makowski. 2403-2407 [doi]
- Decentralized two-sided sequential tests for A normal meanYan Wang, Yajun Mei. 2408-2412 [doi]
- Estimation of the distribution of randomly deployed wireless sensorsBabar H. Khan, Øyvind Ryan, Mérouane Debbah, Tareq Y. Al-Naffouri. 2413-2417 [doi]
- A note on BSD codes constructed from T-codesUlrich Speidel. 2418-2421 [doi]
- Bounds and capacity results for the cognitive Z-interference channelNan Liu, Ivana Maric, Andrea Goldsmith, Shlomo Shamai. 2422-2426 [doi]
- A new achievable rate region for the discrete memoryless X channelOnur Ozan Koyluoglu, Mohammad Shahmohammadi, Hesham El Gamal. 2427-2431 [doi]
- Rank-constrained separable semidefinite programming for optimal beamforming designYongwei Huang, Daniel Pérez Palomar. 2432-2436 [doi]
- Performance analysis of RVQ-based limited feedback beamforming codebooksVasanthan Raghavan, Michael L. Honig, Venugopal V. Veeravalli. 2437-2441 [doi]
- Wireless physical-layer security: The case of colluding eavesdroppersPedro C. Pinto, João Barros, Moe Z. Win. 2442-2446 [doi]
- Secrecy generation for multiple input multiple output channel modelsImre Csiszár, Prakash Narayan. 2447-2451 [doi]
- Channel scrambling for secrecyMatthieu Bloch. 2452-2456 [doi]
- Secure communication using an untrusted relay via sources and channelsNebojsa Milosavljevic, Michael Gastpar, Kannan Ramchandran. 2457-2461 [doi]
- Evaluation of Marton's inner bound for the general broadcast channelAmin Aminzadeh Gohari, Venkat Anantharam. 2462-2466 [doi]
- On the tightness of Marton's regions for semi-additive broadcast channelsEli Haim, Ram Zamir. 2467-2471 [doi]
- Gaussian broadcast channels with receiver message side informationTie Liu, Jae Won Yoo, Feng Xue. 2472-2476 [doi]
- Approximate characterizations for the Gaussian broadcasting distortion regionChao Tian, Shlomo Shamai, Suhas N. Diggavi. 2477-2481 [doi]
- On the number of errors correctable with codes on graphsAlexander Barg, Arya Mazumdar. 2482-2486 [doi]
- Decoding algorithms for binary Raptor codes over nonbinary channelsHarm S. Cronie, Bertrand Ndzana Ndzana, Amin Shokrollahi. 2487-2491 [doi]
- LT codes decoding: Design and analysisFeng Lu, Chuan Heng Foh, Jianfei Cai, Liang-Tien Chia. 2492-2496 [doi]
- Finite-length analysis of irregular expurgated LDPC codes under finite number of iterationsKenta Kasai, Ryuhei Mori, Toshiyuki Tanaka, Kohichi Sakaniwa. 2497-2501 [doi]
- On Gaussian MIMO BC-MAC duality with multiple transmit covariance constraintsLan Zhang, Ying-Chang Liang, Yan Xin 0001, Rui Zhang 0006, H. Vincent Poor. 2502-2506 [doi]
- Error exponents of optimum decoding for the degraded broadcast channel using moments of type class enumeratorsYonatan Kaspi, Neri Merhav. 2507-2511 [doi]
- On multiple-input multiple-output Gaussian channels with arbitrary inputs subject to jammingMiguel R. D. Rodrigues, Gil Ramos. 2512-2516 [doi]
- Time-division multiplexing for green broadcastingPulkit Grover, Anant Sahai. 2517-2521 [doi]
- Mixed anti-jamming strategies in fixed-rate wireless systems over fast fading channelsGeorge T. Amariucai, Shuangqing Wei. 2522-2526 [doi]
- Optimal threshold adaptation with radio environment map for cognitive radio networksDae-Young Seol, Hyoung-Jin Lim, Gi-Hong Im. 2527-2531 [doi]
- Dirty Paper Coding for the MIMO cognitive radio channel with imperfect CSITChinmay S. Vaze, Mahesh K. Varanasi. 2532-2536 [doi]
- Optimal design of learning based MIMO cognitive radio systemsFeifei Gao, Xiaodong Wang, Rui Zhang 0006, Ying-Chang Liang. 2537-2541 [doi]
- Distance-increasing mappings from binary vectors to constant composition vectorsJen-Chun Chang, Hsin-Lung Wu. 2542-2546 [doi]
- An optimal result for codes identifying sets of wordsSvante Janson, Tero Laihonen. 2547-2551 [doi]
- Novel bounds on the capacity of binary channels with deletions and substitutionsDario Fertonani, Tolga M. Duman. 2552-2556 [doi]
- A subsequence-histogram method for generic vocabulary recognition over deletion channelsMajid Fozunbal. 2557-2561 [doi]
- Design of network codes for multiple-user multiple-relay wireless networksMing Xiao, Mikael Skoglund. 2562-2566 [doi]
- On the energy benefit of network coding for wireless multiple unicastJasper Goseling, Ryutaroh Matsumoto, Tomohiko Uyematsu, Jos H. Weber. 2567-2571 [doi]
- Capacity analysis of two-user opportunistic scheduling for wireless network codingPoramate Tarasak, Ubolthip Sethakaset, Sumei Sun. 2572-2576 [doi]
- Adaptive network coded retransmission scheme for wireless multicastSameh Sorour, Shahrokh Valaee. 2577-2581 [doi]
- New sum-rate upper bound for the two-user Gaussian interference channelRaúl H. Etkin. 2582-2586 [doi]
- On the totally asynchronous interference channel with single-user receiversEduard Calvo, Javier Rodríguez Fonollosa, Josep Vidal. 2587-2591 [doi]
- On the separability of parallel Gaussian interference channelsSae-Young Chung, Sang Won Choi. 2592-2596 [doi]
- Noisy-interference sum-rate capacity of parallel Gaussian interference channelsXiaohu Shang, Biao Chen, Gerhard Kramer, H. Vincent Poor. 2597-2601 [doi]
- An MMSE approach to the secrecy capacity of the MIMO Gaussian wiretap channelRuoheng Liu, Ronit Bustin, Shlomo Shamai, H. Vincent Poor. 2602-2606 [doi]
- Information secrecy from multiple eavesdroppers in orthogonal relay channelsH. Vincent Poor, Lalitha Sankar, Vaneet Aggarwal, A. Robert Calderbank. 2607-2611 [doi]
- Secrecy capacity region of the Gaussian multi-receiver wiretap channelErsen Ekrem, Sennur Ulukus. 2612-2616 [doi]
- On the delay limited secrecy capacity of fading channelsKarim Khalil, Moustafa Youssef, Onur Ozan Koyluoglu, Hesham El Gamal. 2617-2621 [doi]
- On the sum capacity of a class of cyclically symmetric deterministic interference channelsBernd Bandemer, Abbas El Gamal, Gonzalo Vazquez-Vilar. 2622-2626 [doi]
- Multicasting in large random wireless networks: Bounds on the minimum energy per bitAman Jain, Sanjeev R. Kulkarni, Sergio Verdú. 2627-2631 [doi]
- Average entropy functionsQi Chen, Chen He, Lingge Jiang, Qingchuan Wang. 2632-2633 [doi]
- The capacity region of a class of deterministic Z channelsViveck R. Cadambe, Syed Ali Jafar, Sriram Vishwanath. 2634-2638 [doi]
- Capacity achieving codes From randomness conductorsMahdi Cheraghchi. 2639-2643 [doi]
- Waterfall region performance of punctured LDPC codes over the BECRüdiger L. Urbanke, Iryna Andriyanova. 2644-2648 [doi]
- Analytical solution of covariance evolution for regular LDPC codesKohichi Sakaniwa, Kenta Kasai, Takayuki Nozaki. 2649-2653 [doi]
- Decay of correlations in low density parity check codes: Low noise regimeShrinivas Kudekar, Nicolas Macris. 2654-2658 [doi]
- Achievable throughput of multi-mode multiuser MIMO with imperfect CSI constraintsJun Zhang 0004, Marios Kountouris, Jeffrey G. Andrews, Robert W. Heath Jr.. 2659-2663 [doi]
- MIMO broadcast channel optimization under general linear constraintsHoon Huh, Haralabos C. Papadopoulos, Giuseppe Caire. 2664-2668 [doi]
- Maximizing sum rate and minimizing MSE on multiuser downlink: Optimality, fast algorithms and equivalence via max-min SIRChee-Wei Tan, Mung Chiang, R. Srikant. 2669-2673 [doi]
- Achievable rate and optimal physical layer rate allocation in interference-free wireless networksTao Cui, Tracey Ho, Jörg Kliewer. 2674-2678 [doi]
- Iterative spectrum shaping with opportunistic multiuser detectionRui Zhang 0006, John M. Cioffi. 2679-2683 [doi]
- Optimized rate allocation for state estimation over noisy channelsLei Bao, Mikael Skoglund, Carlo Fischione, Karl Henrik Johansson. 2684-2688 [doi]
- Iterative channel and data estimation: Framework and analysis via replica methodMikko Vehkaperä, Keigo Takeuchi, Ralf R. Müller, Toshiyuki Tanaka. 2689-2693 [doi]
- Optimal code length for bursty sources with deadlinesTara Javidi, Raghava N. Swamy. 2694-2698 [doi]
- On linear balancing setsArya Mazumdar, Ron M. Roth, Pascal O. Vontobel. 2699-2703 [doi]
- Optimal, systematic q-ary codes correcting all asymmetric errors of limited magnitudeNoha Elarief, Bella Bose. 2704-2707 [doi]
- On systematic variable length unordered codesLaura Pezza, Luca G. Tallini, Bella Bose. 2708-2712 [doi]
- Decoding frequency permutation arrays under infinite normShi-Chun Tsai, Min-Zheng Shieh. 2713-2717 [doi]
- Differential privacy with compressionShuheng Zhou, Katrina Ligett, Larry A. Wasserman. 2718-2722 [doi]
- Binary causal-adversary channelsMichael Langberg, Sidharth Jaggi, Bikash Kumar Dey. 2723-2727 [doi]
- Information embedding with reversible stegotextOrna Sumszyk, Yossef Steinberg. 2728-2732 [doi]
- Using Kolmogorov complexity for understanding some limitations on steganographyBoris Ryabko, Daniil Ryabko. 2733-2736 [doi]
- Recovering a code's length and synchronization from a noisy intercepted bitstreamMathieu Cluzeau, Matthieu Finiasz. 2737-2741 [doi]
- Throughput enhancements in point-to-multipoint cognitive systemsNadia Jamal, Hamidreza Ebrahimzadeh Saffar, Patrick Mitran. 2742-2746 [doi]
- A characterization of max-min SIR-balanced power allocation with applicationsMichal Kaliszan, Marcin Wiczanowski, Slawomir Stanczak, Nicholas Bambos. 2747-2751 [doi]
- On the design of PN codes in decentralized networksKamyar Moshksar, Amir K. Khandani. 2752-2756 [doi]
- MIMO Gaussian broadcast channels with confidential messagesRuoheng Liu, Tie Liu, H. Vincent Poor, Shlomo Shamai. 2757-2761 [doi]
- Secret-key sharing based on layered broadcast coding over fading channelsXiaojun Tang, H. Vincent Poor, Ruoheng Liu, Predrag Spasojevic. 2762-2766 [doi]
- The secrecy capacity of the semi-deterministic broadcast channelWei Kang, Nan Liu. 2767-2771 [doi]
- The secrecy capacity region of the degraded vector Gaussian broadcast channelGhadamali Bagherikaram, Abolfazl S. Motahari, Amir K. Khandani. 2772-2776 [doi]
- Comments on "broadcast channels with arbitrarily correlated sources"Gerhard Kramer, Chandra Nair. 2777-2779 [doi]
- Correlated sources over broadcast channelsPaolo Minero, Young Han Kim. 2780-2784 [doi]
- Hybrid digital-analog joint source-channel coding for broadcasting correlated Gaussian sourcesHamid Behroozi, Fady Alajaji, Tamás Linder. 2785-2789 [doi]
- Hybrid coding for Gaussian broadcast channels with Gaussian sourcesRajiv Soundararajan, Sriram Vishwanath. 2790-2794 [doi]
- Fast computation of Gröbner bases of ideals of F[x, y]Yindong Chen, Yao Lu, Peizhong Lu. 2795-2798 [doi]
- Rank q-cyclic and pseudo-q-cyclic codesErnst M. Gabidulin. 2799-2802 [doi]
- On Jacket transforms over finite fieldsMoon Ho Lee, Yuri L. Borissov. 2803-2807 [doi]
- An SDP primal-dual algorithm for approximating the Lovász-theta functionT.-H. Hubert Chan, Kevin L. Chang, Rajiv Raman. 2808-2812 [doi]
- Space-time codes that are approximately universal for the parallel, multi-block and cooperative DDF channelsPetros Elia, P. Vijay Kumar. 2813-2817 [doi]
- Ideal structure of the Silver codeAvik Ray, Ghaya Rekaya-Ben Othman, P. Vijay Kumar, K. Vinodh. 2818-2822 [doi]
- The Aladdin-Pythagoras space-time codeJoseph Jean Boutros, Hugues Randriambololona. 2823-2827 [doi]
- Distributed differential space-time codes based on Weyl's reciprocityHaiquan Wang, Zhijin Zhao. 2828-2832 [doi]
- Delay-throughput tradeoff for supportive two-tier networksLong Gao, Shuguang Cui, Changchuan Yin, Rui Zhang 0006. 2833-2837 [doi]
- An adaptive opportunistic routing scheme for wireless ad-hoc networksAbhijeet Bhorkar, Bhaskar D. Rao, Mohammad Naghshvar, Tara Javidi. 2838-2842 [doi]
- Delay-throughput tradeoff for overlaid wireless networks of different prioritiesChangchuan Yin, Long Gao, Shuguang Cui. 2843-2847 [doi]
- MIMO compute-and-forwardJiening Zhan, Uri Erez, Michael Gastpar, Bobak Nazer. 2848-2852 [doi]
- Nonlinear network code for high throughput broadcasting with retransmissionsQiang Li, See Ho Ting, Chin Keong Ho. 2853-2857 [doi]
- Fast encoding and decoding of Gabidulin codesDanilo Silva, Frank R. Kschischang. 2858-2862 [doi]
- One family of algebraic codes for network codingMartin Bossert, Ernst M. Gabidulin. 2863-2866 [doi]
- Packing and covering properties of subspace codesMaximilien Gadouleau, Zhiyuan Yan. 2867-2871 [doi]
- A new construction method for networks from matroidsAlex Sprintson, Salim Y. El Rouayheb, Costas N. Georghiades. 2872-2876 [doi]
- Distributed least square for consensus building in sensor networksFernando Pérez-Cruz, Sanjeev R. Kulkarni. 2877-2881 [doi]
- Detection error exponent for spatially dependent samples in random networksAnimashree Anandkumar, Alan S. Willsky, Lang Tong. 2882-2886 [doi]
- On multicasting with streaming burst-erasure codesJatinder P. Singh, Ashish Khisti. 2887-2891 [doi]
- A novel signaling for communication on MIMO Y channel: Signal space alignment for network codingNamyoon Lee, Jong-Bu Lim. 2892-2896 [doi]