Abstract is missing.
- Critical node lifetimes in random networks via the chen-stein methodMassimo Franceschetti, Ronald W. J. Meester. 1-5 [doi]
- On sensor network lifetime and data distortionAman Kansal, Aditya Ramamoorthy, Mani B. Srivastava, Gregory J. Pottie. 6-10 [doi]
- Network routing capacityJillian Cannons, Randall Dougherty, Christopher F. Freiling, Kenneth Zeger. 11-13 [doi]
- Balanced aggregation trees for routing correlated data in wireless sensor networksHuiyu Luo, Gregory J. Pottie. 14-18 [doi]
- Search process and probabilistic bifix approachDragana Bajic, Cedomir Stefanovic, Dejan Vukobratovic. 19-22 [doi]
- A T-decomposition algorithm with O(n log n) time and space complexityJia Yang, Ulrich Speidel. 23-27 [doi]
- Achievable rates for pattern recognition: binary and Gaussian casesM. Brandon Westover, Joseph A. O'Sullivan. 28-32 [doi]
- Pattern recognition system design based on LDPC matricesJoseph A. O'Sullivan, Po-Hsiang Lai. 33-36 [doi]
- EXIT charts for non-binary LDPC codes over arbitrary discrete-memoryless channelsAmir Bennatan, David Burshtein. 37-41 [doi]
- Lower bounds on the spectrum and error rate LDPC code ensemblesOhad Barak, David Burshtein. 42-46 [doi]
- Upper bounds on the rate of LDPC codes as a function of minimum distanceYael Ben-Haim, Simon Litsyn. 47-51 [doi]
- Block Error Iterative Decoding Capacity for LDPC CodesHui Jin, Thomas Richardson. 52-56 [doi]
- Cognitive multiple access networksNatasha Devroye, Patrick Mitran, Vahid Tarokh. 57-61 [doi]
- Distributed rate splitting in Gaussian and discrete memoryless multiple-access channelsJian Cao, Edmund M. Yeh. 62-66 [doi]
- Real-time coding for multiple access channelsXiaojie Gao, Leonard J. Schulman. 67-71 [doi]
- On multiple user channels with state information at the transmittersStyrmir Sigurjonsson, Young-Han Kim 0001. 72-76 [doi]
- Discriminatory source coding for a noiseless broadcast channelLeonard H. Grokop, Anant Sahai, Michael Gastpar. 77-81 [doi]
- On the rate loss and construction of source codes for broadcast channelsHanying Feng, Michelle Effros. 82-86 [doi]
- On source decoding based on finite-bandwidth soft informationNiklas Wernersson, Mikael Skoglund. 87-91 [doi]
- Correlated source coding for fusion storage and selective retrievalJayanth Nayak, Sharadh Ramaswamy, Kenneth Rose. 92-96 [doi]
- Ultra-wideband channel modeling on the basis of information-theoretic criteriaUlrich G. Schuster, Helmut Bölcskei, Giuseppe Durisi. 97-101 [doi]
- Power spectra of multipath faded pulse trainsAndrea Ridolfi, Moe Z. Win. 102-106 [doi]
- On synchronization of wideband impulsive systems in multipathDana Porrat, Urbashi Mitra. 107-111 [doi]
- Multi-tone FSK with feedbackCheng Luo, Muriel Médard, Lizhong Zheng, Desmond S. Lun. 112-116 [doi]
- On perfect integer codesUlrich Tamm. 117-120 [doi]
- On subcodes of codes in rank metricErnst M. Gabidulin, Pierre Loidreau. 121-123 [doi]
- New linear codes over Z/sub ps/ via the trace mapAsha Rao, Nimalsiri Pinnawala. 124-126 [doi]
- Improved constructions and bounds for 2-D optical orthogonal codesReza Omrani, P. Vijay Kumar. 127-131 [doi]
- Sensing capacity for Markov random fieldsYaron Rachlin, Rohit Negi, Pradeep K. Khosla. 132-136 [doi]
- Scalable feedback control for distributed beamforming in sensor networksRaghu Mudumbai, João P. Hespanha, Upamanyu Madhow, Gwen Barriac. 137-141 [doi]
- On multiple-access communication system for general correlated sources with an array of general independent channelsKen-ichi Iwata. 142-146 [doi]
- A coding theorem for network information flow with correlated sourcesJoão Barros, Sergio D. Servetto. 147-151 [doi]
- Universal estimation of divergence for continuous distributions via data-dependent partitionsQing Wang, Sanjeev R. Kulkarni, Sergio Verdú. 152-156 [doi]
- Conservation of mutual and directed informationJames L. Massey, Peter C. Massey. 157-158 [doi]
- On the discontinuity of the Shannon information measuresSiu-Wai Ho, Raymond W. Yeung. 159-163 [doi]
- Martingales and information divergencePeter Harremoës. 164-168 [doi]
- Repeat-accumulate codes that approach the Gilbert-Varshamov boundAndrew Brown 0003, Michael Luby, Amin Shokrollahi. 169-173 [doi]
- Structured eIRA codes with low floorsYifei Zhang, William E. Ryan, Yan Li. 174-178 [doi]
- Constructions for irregular repeat-accumulate codesSarah J. Johnson, Steven R. Weller. 179-183 [doi]
- Near-capacity dirty-paper code designs based on TCQ and IRA codesYong Sun, Angelos D. Liveris, Vladimir Stankovic 0001, Zixiang Xiong. 184-188 [doi]
- A tree search method for iterative decoding of underdetermined multiuser systemsAdriel P. Kind, Alex J. Grant. 189-193 [doi]
- Structure of replica-symmetric solutions for randomly-spread CDMAToshiyuki Tanaka. 194-198 [doi]
- Performance of synchronous multirate CDMA via statistical physicsDongning Guo. 199-203 [doi]
- Equivalence of large chip-synchronous and symbol-synchronous CDMA systemsChien-Hwa Hwang. 204-208 [doi]
- Sending a lossy version of the innovations process is suboptimal in QG rate-distortionKwang Taik Kim, Toby Berger. 209-213 [doi]
- Semantic compaction, transmission, and compression codesFrans M. J. Willems, Ton Kalker. 214-218 [doi]
- On the quadratic AWGN CEO problem and non-gaussian sourcesKrishnan Eswaran, Michael Gastpar. 219-223 [doi]
- Lossy transmission over slow-fading AWGN channels: a comparison of progressive and superposition and hybrid approachesStefania Sesia, Giuseppe Caire, Guillaume Vivier. 224-228 [doi]
- Trellis-based equalization for sparse ISI channels revisitedJan Mietzner, Sabah Badri-Hoeher, Ingmar Land, Peter A. Hoeher. 229-233 [doi]
- On BCJR state metric quantization for turbo equalizationBrian M. Kurkoski, Kazuhiko Yamaguchi, Kingo Kobayashi. 234-238 [doi]
- A successive decoding strategy for channels with memoryTeng Li, Oliver M. Collins. 239-243 [doi]
- Disjoint identifying-codes for arbitrary graphsMoshe Laifenfeld, Ari Trachtenberg. 244-248 [doi]
- Constant weight codes: a geometric approachChao Tian, Vinay A. Vaishampayan, N. J. A. Sloane. 249-253 [doi]
- On the perfect t-dominating set problem in circulant graphs and codes over gaussian integersCarmen Martínez, Ramón Beivide, Jaime Gutierrez 0001, Ernst M. Gabidulin. 254-258 [doi]
- Improved Johnson bounds for optical orthogonal codes with /spl lambda/ > 1 and some optimal constructionsReza Omrani, Oscar Moreno, P. Vijay Kumar. 259-263 [doi]
- Insufficiency of linear coding in network information flowRandall Dougherty, Christopher F. Freiling, Kenneth Zeger. 264-267 [doi]
- Rainbow network problems and multiple description codingXiaolin Wu 0001, Bin Ma, Nima Sarshar. 268-272 [doi]
- On theory of linear network codingShuo-Yen Robert Li, Ning Cai 0001, Raymond W. Yeung. 273-277 [doi]
- On random network coding based information disseminationSupratim Deb, Muriel Médard, Clifford Choute. 278-282 [doi]
- New results on DNA codesArkady G. D'yachkov, Anthony J. Macula, Thomas E. Renz, Pavel A. Vilenkin, I. K. Ismagilov. 283-287 [doi]
- DNA codes that avoid secondary structuresOlgica Milenkovic, Navin Kashyap. 288-292 [doi]
- On the value of a well chosen bit to the seller in an auctionBruce E. Hajek. 293-296 [doi]
- More on reconstructing strings from random traces: insertions and deletionsSampath Kannan, Andrew McGregor 0001. 297-301 [doi]
- Near perfect decoding of LDPC codesXiaofei Huang. 302-306 [doi]
- The benefit of thresholding in LP decoding of LDPC codesJon Feldman, Ralf Koetter, Pascal O. Vontobel. 307-311 [doi]
- Hybrid decoding of irregular LDPC codesPirouz Zarrinkhat, Amir H. Banihashemi. 312-316 [doi]
- Decoding of expander codes at rates close to capacityAlexei Ashikhmin, Vitaly Skachek. 317-321 [doi]
- Performance of decorrelating receiver in multipath Rician fading channelsKegen Yu, Ian Oppermann. 322-326 [doi]
- A relationship between the SINR of MMSE and ALS receiversMatthew J. M. Peacock, Iain B. Collings, Michael L. Honig. 327-331 [doi]
- Iterative multiuser detection based on Monte Carlo probabilistic data associationZhenning Shi, Mark C. Reed. 332-336 [doi]
- When to synchronize in uplink CDMANicolas Bonneau, Eitan Altman, Mérouane Debbah, Giuseppe Caire. 337-341 [doi]
- Entropy of quantized data at high sampling ratesDaniel Marco, David L. Neuhoff. 342-346 [doi]
- A fast, flexible and robust design method for noisy channel scalar quantizationPaul J. Pelzl, David L. Neuhoff. 347-351 [doi]
- A complexity-regularized quantization approach to nonlinear dimensionality reductionMaxim Raginsky. 352-356 [doi]
- Index assignment for scalar quantization with M-ary phase shift keyingH. Y. Chan, Wai Ho Mow, C. S. Leung. 357-361 [doi]
- Approximating the error probability for the independent rayleigh fading channelJean-Claude Belfiore, Emanuele Viterbo. 362 [doi]
- A novel class of low-complexity SISO algorithms for phase-uncertain communicationsMichele Franceschini, GianLuigi Ferrari, Riccardo Raheli, Aldo Curtoni. 363-367 [doi]
- Analysis and design of low density parity check codes for non-coherent block fading channelsXiaowei Jin, Andrew W. Eckford, Thomas E. Fuja. 368-372 [doi]
- Manufacturing training symbols from future bitsHao Zhou, Oliver M. Collins. 373-377 [doi]
- Structures of non-GDJ golay sequencesYing Li, Yi-Chan Kao. 378-381 [doi]
- Relations between the local weight distributions of a linear block code, its extended code, and its even weight subcodeKenji Yasunaga, Toru Fujiwara. 382-386 [doi]
- On multimode polarity-switch codes of rate 1 - 1/nHiroyoshi Morita, Masahiko Satoh, Adriaan J. de Lind van Wijngaarden. 387-391 [doi]
- Mitigation of MAIs by the second encoding scheme in TTFR-based optical CDMA systemsTakaya Miyazawa, Iwao Sasase. 392-396 [doi]
- Capacity gain from transmitter and receiver cooperationChris T. K. Ng, Andrea J. Goldsmith. 397-401 [doi]
- Boosting reliability over AWGN networks with average power constraints and noiseless feedbackAnant Sahai, Stark C. Draper, Michael Gastpar. 402-406 [doi]
- The discrete memoryless compound multiple access channel with conferencing encodersIvana Maric, Roy D. Yates, Gerhard Kramer. 407-410 [doi]
- Cooperation vs. hierarchy: an information-theoretic comparisonLalitha Sankaranarayanan, Gerhard Kramer, Narayan B. Mandayam. 411-415 [doi]
- Feedback capacity of the first-order moving average Gaussian channelYoung-Han Kim 0001. 416-420 [doi]
- Multinomial representation of majority logic codingJohn B. Moore, Keng T. Tan. 421-424 [doi]
- Computing Bayesian Cramer-Rao boundsJustin Dauwels. 425-429 [doi]
- Worst-case randomized interactive communicationHugues Mercier, Pierre McKenzie, Stefan Wolf 0001. 430-434 [doi]
- Encoding information into constant weight wordsNicolas Sendrier. 435-438 [doi]
- On the spread of random interleaversArya Mazumdar, Adrish Banerjee, Ajit Kumar Chaturvedi. 439-443 [doi]
- An LDPCC decoding algorithm based on bowman-levin approximation -comparison with bp and CCCP-Masato Inoue, Miho Komiya, Yoshiyuki Kabashima. 444-448 [doi]
- Improved min-sum decoding algorithms for irregular LDPC codesJinghu Chen, R. Michael Tanner, Christopher Jones, Yan Li. 449-453 [doi]
- Replica shuffled iterative decodingJuntan Zhang, Yige Wang, Marc P. C. Fossorier, Jonathan S. Yedidia. 454-458 [doi]
- Memory-efficient decoding of LDPC codesJason Kwok-San Lee, Jeremy Thorpe. 459-463 [doi]
- Extended minsum algorithm for decoding LDPC codes over GF(/sub q/David Declercq, Marc P. C. Fossorier. 464-468 [doi]
- On the design of binary sequences with maximum nonlinear spanPanagiotis Rizomiliotis. 469-473 [doi]
- Reconstruction of signed permutations from their distorted patternsElena V. Konstantinova. 474-477 [doi]
- Multiterminal random number generation in of separate coding systemsYasutada Oohama. 478-481 [doi]
- New construction of low correlation zone sequences from hadamard matricesXiaohu Tang, Parampalli Udaya. 482-486 [doi]
- Binary sequence sets with low correlation zoneJi-Woong Jang, Jong-Seon No, Habong Chung, Xiaohu Tang. 487-490 [doi]
- Weakly universal LZ-extended codes for sources with countable alphabetR. K. Bansal, Jay Deep Sau. 491-494 [doi]
- On the pointwise redundancy of the LZ78 algorithmEn-Hui Yang, Lihua Song, Gil I. Shamir, John C. Kieffer. 495-499 [doi]
- Redundancy of symbol decomposition algorithms for memoryless sourceTsutomu Kawabata, You Yanagisawa. 500-504 [doi]
- An extension of asymptotically sufficient statistic method for pointwise strong universalityMitsuharu Arimura, Hiroshi Nagaoka. 505-509 [doi]
- Fundamental limits of diversity-embedded codes over fading channelsSuhas N. Diggavi, David N. C. Tse. 510-514 [doi]
- Capacity bounds for noncoherent fading channels with a peak constraintVignesh Sethuraman, Bruce E. Hajek, Krishna R. Narayanan. 515-519 [doi]
- Approaching capacity on correlated fading channels with unknown stateTeng Li, Xiaowei Jin, Oliver M. Collins. 520-524 [doi]
- The effect of memory order on the capacity of finite-state Markov and flat-fading channelsParastoo Sadeghi, Predrag B. Rapajic, Zarko B. Krusevac. 525-529 [doi]
- Capacity of the MIMO optical fading channelKaushik Chakraborty. 530-534 [doi]
- Optimal conflict-avoiding codes for three active usersVladimir I. Levenshtein, Vladimir D. Tonchev. 535-537 [doi]
- Near BER optimal partial response codesVladimir Rusek, John B. Anderson. 538-542 [doi]
- A fixed-rate bit stuffing approach for high efficiency k-constrained codesYogesh Sankarasubramaniam, Steven W. McLaughlin. 543-547 [doi]
- Performance of product codes on channels with memorySundararajan Sankaranarayanan, Evangelos Eleftheriou. 548-552 [doi]
- Most balanced overload response in sensor networksLeonidas Georgiadis, Leandros Tassiulas. 553-557 [doi]
- Load balancing with migration penaltiesVivek F. Farias, Ciamac C. Moallemi, Balaji Prabhakar. 558-562 [doi]
- On the capacity of multiple unicast sessions in undirected graphsKamal Jain, Vijay V. Vazirani, Raymond W. Yeung, Gideon Yuval. 563-567 [doi]
- Calculating blocking probabilities for loss networks based on probabilistic graphical modelsJian Ni, Sekhar Tatikonda. 568-572 [doi]
- A statistical view of universal stock market portfoliosCengiz Y. Belentepe, Abraham J. Wyner. 573-577 [doi]
- Minimum estimation and combining generalized selection combining (MEC-GSC)Mohamed-Slim Alouini, Hong-Chuan Yang. 578-582 [doi]
- Expectation maximization as message passingJustin Dauwels, Sascha Korl, Hans-Andrea Loeliger. 583-586 [doi]
- An application of minimum description length clustering to partitioning learning curvesDaniel J. Navarro, Michael D. Lee. 587-591 [doi]
- Braided convolutional codesWei Zhang 0061, Michael Lentmaier, Daniel J. Costello Jr., Kamil Sh. Zigangirov. 592-596 [doi]
- Laminated turbo codesAxel Huebner, Michael Lentmaier, Kamil Sh. Zigangirov, Daniel J. Costello Jr.. 597-601 [doi]
- On the construction of good families of rate-compatible punctured turbo codesEirik Rosnes, Øyvind Ytrehus. 602-606 [doi]
- Analysis and design of rate compatible serial concatenated convolutional codesAlexandre Graell i Amat, Guido Montorsi, Francesca Vatta. 607-611 [doi]
- Closed-form expressions for the SEP of QAM diversity combining in uncertain channelsChristian Sgraja, Jürgen Lindner. 612-616 [doi]
- Detection error probabilities in noncoherent channelsDaniel J. Ryan, I. Vaughan L. Clarkson, Iain B. Collings. 617-621 [doi]
- On the performance of turbo codes in quasi-static fading channelsMiguel R. D. Rodrigues, Ioannis Chatzigeorgiou, Ian J. Wassell, Rolando A. Carrasco. 622-626 [doi]
- Bounds on the capacity of the blockwise noncoherent APSK-AWGN channelsDaniel C. Cunha, Jaime Portugheis. 627-630 [doi]
- Two-way joint source-channel coding with a fidelity criterionAlina Maor, Neri Merhav. 631-635 [doi]
- Hierarchical and joint source-channel coding with coded state information at the transmitterYakup Cemal, Yossef Steinberg. 636-640 [doi]
- Lossless joint source-channel coding across broadcast channels with decoder side informationErtem Tuncel. 641-645 [doi]
- Wideband non-coherent MIMO capacitySiddharth Ray, Muriel Médard, Lizhong Zheng. 646-650 [doi]
- On the capacity of noncoherent wideband MIMO-OFDM systemsMoritz Borgmann, Helmut Bölcskei. 651-655 [doi]
- MIMO outage capacity in the high SNR regimeNarayan Prasad, Mahesh K. Varanasi. 656-660 [doi]
- The fading number and degrees of freedom in non-coherent MIMO fading channels: a peace pipeTobias Koch, Amos Lapidoth. 661-665 [doi]
- Lower bounds on the capacity of asymmetric two-dimensional (d, /spl infin/)-constraintsJiangxin Chen, Paul H. Siegel. 666-670 [doi]
- Channel combining and splitting for cutoff rate improvementErdal Arikan. 671-675 [doi]
- Reed-Solomon convolutional codesHeide Gluesing-Luerssen, Wiland Schmale. 676-679 [doi]
- Augmented product codes and latticesAmir J. Salomon, Ofer Amrani. 680-684 [doi]
- A game theoretic analysis of distributed power control for spread spectrum ad hoc networksJianwei Huang, Randall A. Berry, Michael L. Honig. 685-689 [doi]
- An opportunistic power control algorithm with fairnessKin Kwong Leung, Chi Wan Sung, Vijay K. Bhargava. 690-694 [doi]
- The infeasible SIR region is not a convex setHolger Boche, Slawomir Stanczak. 695-699 [doi]
- A non-cooperative power control game in delay-constrained multiple-access networksFarhad Meshkati, H. Vincent Poor, Stuart C. Schwartz. 700-704 [doi]
- Gradient of mutual information in linear vector Gaussian channelsDaniel P. Palomar, Sergio Verdú. 705-708 [doi]
- Bounds on mutual information rates of noisy channels with timing errorsWei Zeng, Jitender Tokas, Ravi Motwani, Aleksandar Kavcic. 709-713 [doi]
- Uniform decomposition of mutual information using MMSE decision feedback detectionJian-Kang Zhang, Timothy N. Davidson, Kon Max Wong. 714-718 [doi]
- Additive non-Gaussian noise channels: mutual information and conditional mean estimationDongning Guo, Shlomo Shamai, Sergio Verdú. 719-723 [doi]
- A comparison of adaptive belief propagation and the best graph algorithm for the decoding of linear block codesAditi Kothiyal, Oscar Y. Takeshita. 724-728 [doi]
- The serial and parallel belief propagation algorithmsPeng Hui Tan, Lars K. Rasmussen. 729-733 [doi]
- A convergence proof for the turbo decoder as an instance of the gauss-seidel iterationJohn MacLaren Walsh, Phillip A. Regalia, C. Richard Johnson Jr.. 734-738 [doi]
- Bit error probability of bit-interleaved coded modulation (BICM) in wireless environmentsSalam A. Zummo, Ping-Cheng Yeh, Wayne E. Stark. 739 [doi]
- Design of recursive inner codes for SCTCMAnders Nilsson, Tor M. Aulin. 740-744 [doi]
- Analysis of serial concatenation schemes for non-binary modulationsFabio Fagnani, Federica Garin. 745-749 [doi]
- General CPM and its capacityKrishnan Padmanabhan, Shyam Ranganathan, Srinath P. Sundaravaradhan, Oliver M. Collins. 750-754 [doi]
- Context tree estimation for not necessarily finite memory processes, via BIC and MDLImre Csiszár, Zsolt Talata. 755-759 [doi]
- MDL model selection using the ML plug-in codeSteven de Rooij, Peter Grünwald. 760-764 [doi]
- Universal delay-limited simulationNeri Merhav, Gadiel Seroussi, Marcelo J. Weinberger. 765-769 [doi]
- The cost of uncorrelation and non-cooperation in MIMO channelsTal Philosof, Ram Zamir. 770-774 [doi]
- Achievable data rates of frequency selective Rayleigh fading MIMO burst channelsOlli Piirainen, Markku J. Juntti. 775-779 [doi]
- Bounds on the ergodic capacity of training-based multiple-antenna systemsSimeon Furrer, Dirk Dahlhaus. 780-784 [doi]
- Statistical properties of complex noncentral wishart matrices and MIMO capacityMatthew R. McKay, Iain B. Collings. 785-789 [doi]
- Improved upper bounds for codes with unequal error protectionShraga I. Bross, Simon Litsyn. 790-794 [doi]
- Improving the upper bounds on the covering radii of Reed-Muller codesClaude Carlet, Sihem Mesnager. 795-799 [doi]
- Gallager bounds for linear codes in binary-input output-symmetric memoryless channelsAlfonso Martinez, Albert Guillén i Fàbregas, Giuseppe Caire. 800-804 [doi]
- Relaxation bounds on the minimum pseudo-weight of linear block codesPanu Chaichanavong, Paul H. Siegel. 805-809 [doi]
- Rateless coding for wireless relay channelsJeff Castura, Yongyi Mao. 810-814 [doi]
- Cooperative diversity in wireless relay networks with multiple-antenna nodesYindi Jing, Babak Hassibi. 815-819 [doi]
- Broadcast-relay channel: capacity region boundsAlex Reznik, Sanjeev R. Kulkarni, Sergio Verdú. 820-824 [doi]
- Detection and localization of events in imaging sensor netsBharath Ananthasubramaniam, Upamanyu Madhow. 825-829 [doi]
- Serial distributed detection for wireless sensor networksIsrafil Bahceci, Ghassan Al-Regib, Yucel Altunbasak. 830-834 [doi]
- Extensions of error exponent analysis in hypothesis testingErtem Tuncel. 835-839 [doi]
- Construction and analysis of rate-compatible punctured concatenated zigzag codesSong-Nam Hong, Hyeong-Gun Joo, Dong-Joon Shin. 840-844 [doi]
- Tree-based construction of LDPC codesDeepak Sridhara, Christine A. Kelley, Joachim Rosenthal. 845-849 [doi]
- Asymptotically good codes with high iterative decoding performancesIryna Andriyanova, Jean-Pierre Tillich, Jean-Claude Carlach. 850-854 [doi]
- An algebraic method for constructing efficiently encodable irregular LDPC codesHachiro Fujita, Maki Ohata, Kohichi Sakaniwa. 855-859 [doi]
- New quaternary low correlation zone sequencesSang-Hyo Kim, Ji-Woong Jang, Kyoung-Young Song, Jong-Seon No, Habong Chung. 860-864 [doi]
- A closed-form solution for the finite length constant modulus receiverChristophe Laot, Nicolas Le Josse. 865-869 [doi]
- A group-theoretic approach to the WSSUS pulse design problemPeter Jung 0001, Gerhard Wunder. 870-874 [doi]
- "AWGN"-signal transmission in hyperbolic spacesEdson Agustini, Sueli I. R. Costa. 875-878 [doi]
- Uncertainty, monogamy and locking of quantum correlationsMatthias Christandl, Andreas J. Winter 0002. 879-883 [doi]
- Capacity theorems for quantum multiple access channelsJon T. Yard, Igor Devetak, Patrick M. Hayden. 884-888 [doi]
- Inefficiency and classical communication bounds for conversion between partially entangled pure bipartite quantum statesBen Fortescue, Hoi-Kwong Lo. 889-892 [doi]
- Remarks on concavity of the auxiliary function appearing in quantum reliability function in classical-quantum channelsJun Ichi Fujii, Ritsuo Nakamoto, Kenjiro Yanagi. 893-895 [doi]
- Explicit space-time codes that achieve the diversity-multiplexing gain tradeoffPetros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar, Hsiao-feng Lu. 896-900 [doi]
- Achieving the DMD tradeoff of the MIMO-ARQ channelSameer A. Pawar, K. Raj Kumar, P. Vijay Kumar, Petros Elia, B. A. Sethuraman. 901-905 [doi]
- Achieving coherent capacity of correlated MIMO channels in the low-power regime with non-flashy signaling schemesVasanthan Raghavan, Akbar M. Sayeed. 906-910 [doi]
- Full diversity distributed space-time trellis codes for asynchronous cooperative communicationsYabo Li, Xiang-Gen Xia. 911-915 [doi]
- Algebraic lower bounds on the free distance convolutional codesKristine Lally. 916-920 [doi]
- New upper bounds on A(n, d)Beniamin Mounits, Tuvi Etzion, Simon Litsyn. 921-925 [doi]
- The partition weight enumerator of MDS codes and its applicationsMostafa El-Khamy, Robert J. McEliece. 926-930 [doi]
- On the second moment of the distance distribution of binary codesRon M. Roth, Gadiel Seroussi. 931-935 [doi]
- Relaying protocols for two co-located usersMichael Katz, Shlomo Shamai. 936-940 [doi]
- Outage-optimal relaying in the low SNR regimeAmir Salman Avestimehr, David N. C. Tse. 941-945 [doi]
- An achievability result for random networksRadhika Gowaikar, Bertrand M. Hochwald, Babak Hassibi. 946-950 [doi]
- On the pre-log of Gaussian fading relay channelsTobias Koch, Gerhard Kramer. 951-955 [doi]
- Sampling-reconstruction procedure with jitter of Gaussian processesVladimir A. Kazakov, Daniel S. Rodríguez. 956-960 [doi]
- On frames with stable oversampled filter banksLi Chai, Jingxin Zhang, Cishen Zhang, Edoardo Mosca. 961-965 [doi]
- A geometric interpretation of the rihaczek time-frequency distribution for stochastic signalsPeter J. Schreier, Louis L. Scharf, Alfred Hanssen. 966-969 [doi]
- The two dimensional Mazo limitFredrik Rusek, John B. Anderson. 970-974 [doi]
- On the stopping distance and the stopping redundancy of codesMoshe Schwartz 0001, Alexander Vardy. 975-979 [doi]
- On the minimal pseudo-codewords of codes from finite geometriesPascal O. Vontobel, Roxana Smarandache, Negar Kiyavash, Jason Teutsch, Dejan Vukobratovic. 980-984 [doi]
- Stopping set distributions of two-edge type LDPC code ensemblesRyoji Ikegaya, Kenta Kasai, Yuji Shimoyama, Tomoharu Shibuya, Kohichi Sakaniwa. 985-989 [doi]
- Design of an LDPC code with low error floorSang Hyun Lee, Kwang Soon Kim, Jae Kyun Kwon, Yun Hee Kim, Jae Young Ahn. 990-994 [doi]
- LDPC code ensembles for incremental redundancy hybrid ARQNedeljko Varnica, Emina Soljanin, Philip Whiting. 995-999 [doi]
- Applications of sparse approximation in communicationsAnna C. Gilbert, Joel A. Tropp. 1000-1004 [doi]
- Biologically inspired amorphous communicationsLei Wei. 1005 [doi]
- A generalised Hadamard transformK. J. Horadam. 1006-1008 [doi]
- Continuous waveforms from a binary modulatorJagadish Venkataraman, Oliver M. Collins. 1009-1012 [doi]
- Noise tolerance of the BB84 protocol with random privacy amplificationShun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu. 1013-1017 [doi]
- Quantum block and convolutional codes from self-orthogonal product codesMarkus Grassl, Martin Rötteler. 1018-1022 [doi]
- Nonbinary quantum Reed-Muller codesPradeep Kiran Sarvepalli, Andreas Klappenecker. 1023-1027 [doi]
- Simple rate-1/3 convolutional and tail-biting quantum error-correcting codesG. David Forney Jr., Saikat Guha. 1028-1032 [doi]
- On the dimensionality of spatial fields with restricted angle of arrivalGlenn Dickins, Michael Williams, Leif W. Hanlen. 1033-1037 [doi]
- Antenna array geometry and coding performanceWeijun Zhu, Heechoon Lee, Daniel N. Liu, Michael P. Fitz. 1038-1042 [doi]
- A new high rate serially concatenated space-time codeYing Li 0002, Xudong Guo, Jun-hong Hui, Xinmei Wang. 1043-1047 [doi]
- Performance of space-time coded continuous phase modulated signals over different fading environmentsDhammika Bokolamulla, Tor M. Aulin. 1048-1052 [doi]
- Closest point search in lattices using sequential decodingNaftali Sommer, Meir Feder, Ofir Shalvi. 1053-1057 [doi]
- A modified state reduction algorithm for computing weight enumerators for convolutional codesEdward K. S. Au, Wai Ho Mow. 1058-1062 [doi]
- Encoding and distance estimation of product convolutional codesMartin Bossert, Carlos Medina, Vladimir Sidorenko. 1063-1067 [doi]
- On the distance optimality of permutation mappingsTheo G. Swart, Ian de Beer, Hendrik C. Ferreira. 1068-1072 [doi]
- Construction of constant weight code and some upper boundsFanxin Zeng. 1073-1077 [doi]
- Relay-without-delayAbbas El Gamal, Navid Hassanpour. 1078-1080 [doi]
- On the throughput improvement due to limited complexity processing at relay nodesDaniela Tuninetti, Christina Fragouli. 1081-1085 [doi]
- New coding strategies for the relay channelHon-Fah Chong, Mehul Motani, Hari Krishna Garg. 1086-1090 [doi]
- Myopic coding in multiple relay channelsLawrence Ong, Mehul Motani. 1091-1095 [doi]
- Designing bent functions and resilient functions from known ones, without extending their number of variablesClaude Carlet. 1096-1100 [doi]
- On the construction of balanced boolean functions with a good algebraic immunityClaude Carlet, Philippe Gaborit. 1101-1105 [doi]
- Alinear weakness in the Klimov-Shamir T-functionHåvard Molland, Tor Helleseth. 1106-1110 [doi]
- Comparison of boolean function designKhoongming Khoo, Guat-Ee Tan, Hian-Kiat Lee, Guang Gong. 1111-1115 [doi]
- Stochastic iterative decodersChris Winstead, Vincent C. Gaudet, Anthony Rapley, Christian Schlegel. 1116-1120 [doi]
- A direct approach for decoding product codesKobi Ovadya, Ofer Amrani. 1121-1125 [doi]
- Estimating the list size for BEAST-APP decodingMaja Loncar, Rolf Johannesson, Irina E. Bocharova, Boris D. Kudryashov. 1126-1130 [doi]
- A degree-matched check node approximation for LDPC decodingSheryl L. Howard, Christian Schlegel, Vincent C. Gaudet. 1131-1135 [doi]
- New codes for OFDM with low PMEPRKai-Uwe Schmidt, Adolf Finger. 1136-1140 [doi]
- A PTS OFDM scheme with low computational complexityDae-Woon Lim, Seok-Joong Heo, Jong-Seon No, Habong Chung. 1141-1144 [doi]
- Comparison of code design requirements for single- and multi-carrier transmission over frequency-selective MIMO channelRobert F. H. Fischer, Clemens Stierstorfer. 1145-1149 [doi]
- High speed turbo TCM coded OFDM system for UWB channelsYanxia Wang, Libo Yang, Lei Wei 0003. 1150 [doi]
- A universal online caching algorithm based on pattern matchingGopal Pandurangan, Wojciech Szpankowski. 1151-1155 [doi]
- A statistic for measuring the influence of side information in investmentCharles Mathis, Thomas M. Cover. 1156-1157 [doi]
- A universal scheme for learningVivek F. Farias, Ciamac C. Moallemi, Benjamin Van Roy, Tsachy Weissman. 1158-1162 [doi]
- Tracking the best quantizerAndrás György, Tamás Linder, Gábor Lugosi. 1163-1167 [doi]
- On optimal quasi-orthogonal space-time block codes with minimum decoding complexityHaiquan Wang, Dong Wang, Xiang-Gen Xia. 1168-1172 [doi]
- Families of unitary matrices achieving full diversityFrédérique E. Oggier, Emmanuel Lequeu. 1173-1177 [doi]
- STBC-schemes with non-vanishing determinant for certain number of transmit antennasKiran T. Gowda, B. Sundar Rajan. 1178-1182 [doi]
- Soft-decision decoding of RS codesJørn Justesen. 1183-1185 [doi]
- Performance analysis of algebraic soft decoding of reed-solomon codes over binary symmetric and erasure channelsJing Jiang 0010, Krishna R. Narayanan. 1186-1190 [doi]
- On the decoding radius of Lee-metric decoding of algebraic-geometric codesXin-Wen Wu, Margreta Kuijper, Parampalli Udaya. 1191-1195 [doi]
- Application of Groebner bases techniques for searching new sequences with good periodic correlation propertiesVitaly V. Shorin, Pierre Loidreau. 1196-1200 [doi]
- Communication via decentralized processingAmichai Sanderovich, Shlomo Shamai, Yossef Steinberg, Gerhard Kramer. 1201-1205 [doi]
- Throughput optimal control of cooperative relay networksEdmund M. Yeh, Randall A. Berry. 1206-1210 [doi]
- Distributed orthogonalization in large interference relay networksVeniamin I. Morgenshtern, Helmut Bölcskei, Rohit U. Nabar. 1211-1215 [doi]
- Rate-constrained relaying: achievable rates and protocol comparisonsAshutosh Sabharwal, Urbashi Mitra. 1216-1220 [doi]
- Strongly secure ramp secret sharing schemesMitsugu Iwamoto, Hirosuke Yamamoto. 1221-1225 [doi]
- Information theoretical approach to mobile codeKathy Cartrysse, Jan C. A. van der Lubbe. 1226-1230 [doi]
- Cryptanalysis of Shannon-Fano-Elias codesRajendra S. Katti, Xiaoyu Ruan. 1231-1235 [doi]
- Extremal problems of information combiningYibo Jiang, Alexei Ashikhmin, Ralf Koetter, Andrew C. Singer. 1236-1240 [doi]
- Maximum a posteriori decoding and turbo codes for general memoryless channelsCyril Méasson, Rüdiger L. Urbanke, Andrea Montanari, Thomas J. Richardson. 1241-1245 [doi]
- Finite-length analysis of turbo decoding on the binary erasure channelEirik Rosnes, Øyvind Ytrehus. 1246-1250 [doi]
- Turbo stopping sets: the uniform interleaver and efficient enumerationEirik Rosnes, Øyvind Ytrehus. 1251-1255 [doi]
- Tradeoff between PAPR reduction and decoding complexity in transformed OFDM systemsVijay Ahirwar, B. Sundar Rajan. 1256-1260 [doi]
- Trellis pruning for peak-to-average power ratio reductionMei Chen, Oliver M. Collins. 1261-1265 [doi]
- Threshold method to reduce PAPR in wavelet based multicarrier modulation systemsHaixia Zhang 0001, Dongfeng Yuan, Feng Zhao 0002. 1266-1269 [doi]
- Multi-directional context sets with applications to universal denoising and compressionErik Ordentlich, Marcelo J. Weinberger, Tsachy Weissman. 1270-1274 [doi]
- Efficient algorithms for discrete universal denoising for channels with memoryCiprian Doru Giurcaneanu, Bin Yu. 1275-1279 [doi]
- Context and denoising based decoding of non-systematic turbo codes for redundant dataKai Xie, Gil I. Shamir. 1280-1284 [doi]
- Discrete universal filtering via hidden Markov modellingTaesup Moon, Tsachy Weissman. 1285-1289 [doi]
- Dense full-diversity matrix lattices for four transmit antenna MISO channelJarkko Hiltunen, Camilla Hollanti, Jyrki T. Lahtonen. 1290-1294 [doi]
- Some lattice based diagonal and full rate space-time block codesHuiyong Liao, Haiquan Wang, Xiang-Gen Xia. 1295-1299 [doi]
- LLLl lattice-basis reduction achieves the maximum diversity in MIMO systemsMahmoud Taherzadeh, Amin Mobasher, Amir K. Khandani. 1300-1304 [doi]
- Space frequency codes from spherical codesOliver Henkel. 1305-1309 [doi]
- Verification decoding of raptor codesRichard M. Karp, Michael Luby, Amin Shokrollahi. 1310-1314 [doi]
- Multilevel expander codesAlexander Barg, Gilles Zémor. 1315-1319 [doi]
- A low-complexity soft-decision decoder for extended BCH and RS-like codesFijo Therattil, Andrew Thangaraj. 1320-1324 [doi]
- Approximate MAP decoding on tail-biting trellisesMadhu Achuthan Syamala, Priti Shankar. 1325-1328 [doi]
- Throughput-delay scaling in wireless networks with constant-size packetsAbbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah. 1329-1333 [doi]
- Scaling laws for one-dimensional ad hoc wireless networksOlivier Lévêque, Emmanuel Preissmann. 1334-1337 [doi]
- Transport capacity of Gaussian multiple access and broadcast channels with a large number of nodesGautam A. Gupta, Stavros Toumpis, JJossySayir, Ralf R. Müller. 1338-1342 [doi]
- Information rates of multidimensional front-ends for digital storage channels with data-dependent transition noiseRiccardo Pighi, Riccardo Raheli, Fabio Cappelletti. 1343-1347 [doi]
- On achievable rates of multistage decoding on two-dimensional ISi channelsJoseph B. Soriaga, Paul H. Siegel, Jack K. Wolf, Marcus Marrow. 1348-1352 [doi]
- Joint equalization and decoding for nonlinear two-dimensional intersymbol interference channelsNaveen Singla, Joseph A. O'Sullivan. 1353-1357 [doi]
- On the erasure recoverability of MDS codes under concurrent updatesMarcos K. Aguilera, Ramaprabhu Janakiraman, Lihao Xu. 1358-1362 [doi]
- Design of irregular concatenated zigzag codesSong-Nam Hong, Dong-Joon Shin. 1363-1366 [doi]
- Improved reversible LDPC codesDavid Haley, Alex J. Grant. 1367-1371 [doi]
- Terminated LDPC convolutional codes with thresholds close to capacityMichael Lentmaier, Arvind Sridharan, Kamil Sh. Zigangirov, Daniel J. Costello Jr.. 1372-1376 [doi]
- Low-rate generalized low-density parity-check codes with hadamard constraintsGuosen Yue, Ping Li, Xiaodong Wang. 1377-1381 [doi]
- On the universality of Burnashev's error exponentAslan Tchamkerten, I. Emre Telatar. 1382-1385 [doi]
- On the joint source-channel coding error exponent for systems with memoryYangfan Zhong, Fady Alajaji, L. Lorne Campbell. 1386-1390 [doi]
- On the use of training sequences for channel estimationAslan Tchamkerten, I. Emre Telatar. 1391-1395 [doi]
- Sequential random binning for streaming distributed source codingStark C. Draper, Cheng Chang, Anant Sahai. 1396-1400 [doi]
- Density evolution for the simultaneous decoding of LDPC-based slepian-wolf source codesAndrew W. Eckford, Wei Yu. 1401-1405 [doi]
- An improved outer bound for the multiterminal source-coding problemAaron B. Wagner, Venkat Anantharam. 1406-1410 [doi]
- On optimal transforms and quantization schemes in gaussian distributed source codingOzgun Y. Bursalioglu, Ertem Tuncel. 1411-1415 [doi]
- Monotonicity results for coherent single-user and multiple-access MIMO Rician channelsDaniel Hösli, Amos Lapidoth. 1416-1420 [doi]
- Effect of transmit antenna correlation on multiuser diversityDaeyoung Park, Seung Young Park. 1421-1425 [doi]
- Memory-based opportunistic multi-user beamformingMarios Kountouris, David Gesbert. 1426-1430 [doi]
- Transmit beamforming with cooperative base stationsBoon Loong Ng, Jamie S. Evans, Stephen V. Hanly, Defne Aktas. 1431-1435 [doi]
- Rates of convergence for adaptive regression estimates with multiple hidden layer feedforward neural networksMichael Kohler, Adam Krzyzak. 1436-1440 [doi]
- Optimal linear decentralized estimation in a bandwidth constrained sensor networkZhi-Quan Luo, Georgios B. Giannakis, Shuzhong Zhang. 1441-1445 [doi]
- Non-data-aided parameter estimation in an additive white gaussian noise channelFredrik Brännström, Lars K. Rasmussen. 1446-1450 [doi]
- Analysis of a discrete complex sinusoid frequency estimator based on single-delay multiplication methodSithamparanathan Kandeepan, Sam Reisenfeld. 1451-1454 [doi]
- Correction of adversarial errors in networksSidharth Jaggi, Michael Langberg, Tracey Ho, Michelle Effros. 1455-1459 [doi]
- Error correction with feedback for asymmetric errorsPaul Oprisan, Bella Bose. 1460-1463 [doi]
- Identifying codes in random networksAlan M. Frieze, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, Clifford D. Smyth. 1464-1467 [doi]
- Time-varying maximum transition run constraintsTze-Lei Poo, Brian H. Marcus. 1468-1472 [doi]
- On the design of efficient constrained parity-check codes for optical recordingKui Cai, Kees A. Schouhamer Immink. 1473-1477 [doi]
- Two-dimensional bit-stuffing schemes with multiple transformersSharon Aviran, Paul H. Siegel, Jack K. Wolf. 1478-1482 [doi]
- On the number of encoder states for capacity approaching d = 1 codesKui Cai, Kees A. Schouhamer Immink. 1483-1487 [doi]
- Complexity-optimized low-density parity-check codes for gallager decoding algorithm BWei Yu 0001, Masoud Ardakani, Benjamin P. Smith, Frank R. Kschischang. 1488-1492 [doi]
- Lossy source encoding via message-passing and decimation over generalized codewords of LDGM codesMartin J. Wainwright, Elitza N. Maneva. 1493-1497 [doi]
- On achieving capacity on the wire tap channel using LDPC codesAndrew Thangaraj, Souvik Dihidar, A. Robert Calderbank, Steven W. McLaughlin, Jean-Marc Merolla. 1498-1502 [doi]
- Modified RA codes suitable for BPSK modulated systems with non-data-aided carrier recoveryWangrok Oh, Kyungwhoon Cheun, Youhan Kim. 1503-1505 [doi]
- Coding for the feedback Gel'fand-Pinsker channel and the feedforward Wyner-Ziv sourceNeri Merhav, Tsachy Weissman. 1506-1510 [doi]
- A source-channel coding scheme for discrete memoryless channels with feedbackRajesh Manakkal, Bixio Rimoldi. 1511-1515 [doi]
- Communicating using feedback over a binary channel with arbitrary noise sequenceOfer Shayevitz, Meir Feder. 1516-1520 [doi]
- An efficient scheme for reliable error correction with limited feedbackGiuseppe Caire, Shlomo Shamai, Sergio Verdú. 1521-1525 [doi]
- One-to-one code and its anti-redundancyWojciech Szpankowski. 1526-1528 [doi]
- Entropy coding with variable length re-writing systemsHerve Jegou, Christine Guillemot. 1529-1533 [doi]
- Non prefix-free codes for constrained sequencesMarco Dalai, Riccardo Leonardi. 1534-1538 [doi]
- Robust coding for uncertain sources: a minimax approachFarzad Rezaei, Charalambos D. Charalambous. 1539-1543 [doi]
- When is limited feedback for transmit beamforming beneficial?Vasanthan Raghavan, Akbar M. Sayeed, Nigel Boston. 1544-1548 [doi]
- On the information rate of MIMO systems with finite rate channel state feedback and power on/off strategyWei Dai 0001, Youjian Liu, Brian Rider, Vincent K. N. Lau. 1549-1553 [doi]
- An optimal phase control algorithm for MISO systems with finite feedbackKin Kwong Leung, Chi Wan Sung, Tat M. Lok, Vijay K. Bhargava. 1554-1557 [doi]
- A geometrical analysis on transmit antenna selection for spatial multiplexing systems with linear receiversHongyuan Zhang, Huaiyu Dai, Quan Zhou 0002. 1558-1562 [doi]
- Relative entropy and exponential deviation bounds for general Markov chainsIoannis Kontoyiannis, Luis Alfonso Lastras-Montaño, Sean P. Meyn. 1563-1567 [doi]
- Neyman-Pearson detection of Gauss-Markov signals in noise: closed-form error exponent and propertiesYoungchul Sung, Lang Tong, H. Vincent Poor. 1568-1572 [doi]
- Universal codes as a basis for nonparametric testing of serial independence for time seriesBoris Ryabko, Jaakko Astola. 1573-1577 [doi]
- On entropy decomposition and new bounds on the partition functionMehdi Molkaraie, Payam Pakzad. 1578-1582 [doi]
- Coding for the blackwell channel: a survey propagation approachWei Yu 0001, Marko Aleksic. 1583-1587 [doi]
- Progressive d-separating edge set bounds on network coding ratesGerhard Kramer, Serap A. Savari. 1588-1592 [doi]
- On average throughput and alphabet size in network codingChandra Chekuri, Christina Fragouli, Emina Soljanin. 1593-1597 [doi]
- Quantum information theoretical analysis of various constructions for quantum secret sharingKarin Rietjens, Berry Schoenmakers, Pim Tuyls. 1598-1602 [doi]
- Unconditionally secure key distillation from multi-photons in a single-photon polarization based quantum key distributionKiyoshi Tamaki, Hoi-Kwong Lo. 1603-1606 [doi]
- Conference key agreement and quantum sharing of classical secrets with noisy GHZ statesKai Chen 0008, Hoi-Kwong Lo. 1607-1611 [doi]
- Generic security proof of quantum key exchange using squeezed statesKarin Poels, Pim Tuyls, Berry Schoenmakers. 1612-1616 [doi]
- Sparse graph codes for multilevel modulation with signal shapingHarm S. Cronie. 1617-1621 [doi]
- Low-rate LDPC codes with simple protograph structureDariush Divsalar, Sam Dolinar, Christopher R. Jones 0001. 1622-1626 [doi]
- A rate-compatible family of protograph-based LDPC codes built by expurgation and lengtheningSam Dolinar. 1627-1631 [doi]
- Girth analysis of Tanner's (3, 5) QC LDPC codesSunghwan Kim, Jong-Seon No, Habong Chung, Dong-Joon Shin. 1632-1636 [doi]
- Some extensions of Gallager's method to general sources and channelsShengtian Yang, Peiliang Qiu. 1637-1640 [doi]
- On an upper bound of the secrecy capacity for a general wiretap channelHiroki Koga, Naoki Sato. 1641-1645 [doi]
- Information processing in ideal coding schemes with code-symbol decodingIngmar Land, Johannes B. Huber. 1646-1650 [doi]
- Mutual information, synergy and some curious phenomena for simple channelsIoannis Kontoyiannis, Brian Lucena. 1651-1655 [doi]
- Joint source and channel coding using ring convolutional coded CPMZihuai Lin, Tor M. Aulin. 1656-1660 [doi]
- Tradeoff between source and channel coding for erasure channelsSriram N. Kizhakkemadam, Panos Papamichalis, Mandyam D. Srinath, Dinesh Rajan. 1661-1665 [doi]
- On the complexity of joint source-channel decoding of markov sequences over memoryless channelsSorina Dumitrescu, Xiaolin Wu 0001. 1666-1670 [doi]
- Optimizing end-to-end distortion in MIMO systemsTim Holliday, Andrea J. Goldsmith. 1671-1675 [doi]
- On efficient non-coherent detection of Grassmannian constellationsRamy H. Gohary, Timothy N. Davidson. 1676-1680 [doi]
- Efficient MIMO detection by successive projectionKaren Su, Ian J. Wassell. 1681-1685 [doi]
- A near maximum likelihood decoding algorithm for MIMO systems based on semi-definite programmingAmin Mobasher, Mahmoud Taherzadeh, Renata Sotirov, Amir K. Khandani. 1686-1690 [doi]
- On the limits of sphere decodingJoakim Jaldén, Björn E. Ottersten. 1691-1695 [doi]
- Dynamic convergence analysis of adaptive nonlinear filters for narrowband interference rejection in spread spectrum systemsFang Liu, Lee M. Garth. 1696-1700 [doi]
- Spectral factorization, whitening- and estimation filter - stability, smoothness properties and FIR approximation behaviorHolger Boche, Volker Pohl. 1701-1705 [doi]
- Analysis of denoising by sparse approximation with random frame asymptoticsAlyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal, Kannan Ramchandran. 1706-1710 [doi]
- Combining least-squares regressions: an upper-bound on mean-squared errorGilbert Leung, Andrew R. Barron. 1711-1715 [doi]
- On the separation of channel and network coding in aref networksNiranjan Ratnakar, Gerhard Kramer. 1716-1719 [doi]
- Network coding for non-uniform demandsYuval Cassuto, Jehoshua Bruck. 1720-1724 [doi]
- Simplified random network codes for multicast networksAnna H. Lee, Muriel Médard. 1725-1729 [doi]
- Minimal network coding for multicastKapil Bhattad, Niranjan Ratnakar, Ralf Koetter, Krishna R. Narayanan. 1730-1734 [doi]
- Distillation of local purity from quantum statesIgor Devetak. 1735-1739 [doi]
- Mutually unbiased bases are complex projective 2-designsAndreas Klappenecker, Martin Rötteler. 1740-1744 [doi]
- Oblivious transfer and quantum non-localityStefan Wolf 0001, Jürg Wullschleger. 1745-1748 [doi]
- Improved bounds on the size of sparse parity check matricesAssaf Naor, Jacques Verstraëte. 1749-1752 [doi]
- Approaching the shannon limit through parallel concatenation of regular LDGM codesWei Zhong, Huiqiong Chai, Javier Garcia-Frias. 1753-1757 [doi]
- On the asymptotic performance of iterative decoders for product codesMoshe Schwartz 0001, Paul H. Siegel, Alexander Vardy. 1758-1762 [doi]
- Maximum weight matching via max-product belief propagationMohsen Bayati, Devavrat Shah, Mayank Sharma. 1763-1767 [doi]
- A high-speed analog min-sum iterative decoderSaied Hemati, Amir H. Banihashemi, Calvin Plett. 1768-1772 [doi]
- Mercury/waterfilling: optimum power allocation with arbitrary input constellationsAngel Lozano, Antonia Maria Tulino, Sergio Verdú. 1773-1777 [doi]
- Simulation-based estimation of the capacity of full-surface channelsAsif Iqbal Mohammad, William Weeks IV. 1778-1782 [doi]
- Anytime communication over the Gilbert-Eliot channel with noiseless feedbackAnant Sahai, Salman Avestimehr, Paolo Minero. 1783-1787 [doi]
- Ensembles of codes over abelian groupsGiacomo Como, Fabio Fagnani. 1788-1792 [doi]
- n-channel asymmetric multiple-description lattice vector quantizationJan Østergaard, Richard Heusdens, Jesper Jensen 0001. 1793-1797 [doi]
- Near separability of optimal multiple description source codesHanying Feng. 1798-1802 [doi]
- A new class of universal multiple description lattice quantizersJun Chen, Chao Tian, Toby Berger, Sheila S. Hemami. 1803-1807 [doi]
- Diversity and multiplexing tradeoff of multiple beamforming in MIMO channelsLuis Garcia Ordóñez, Alba Pagès-Zamora, Javier R. Fonollosa. 1808-1812 [doi]
- Optimal diversity vs multiplexing tradeoff for frequency selective MIMO channelsAbdelkader Medles, Dirk T. M. Slock. 1813-1817 [doi]
- Optimal transmit covariance for MIMO channels with statistical transmitter side informationLeif W. Hanlen, Alex J. Grant. 1818-1822 [doi]
- The diversity-multiplexing-delay tradeoff in MIMO ARQ channelsHesham El Gamal, Giuseppe Caire, Mohamed Oussama Damen. 1823-1827 [doi]
- Achievable diversity-multiplexing-delay tradeoff in half-duplex ARQ relay channelsTarik Tabet, Sanket Dusad, Raymond Knopp. 1828-1832 [doi]
- Concentration and relative entropy for compound Poisson distributionsMokshay Madiman, Ioannis Kontoyiannis. 1833-1837 [doi]
- Asymptotic filtering and entropy rate of a hidden Markov process in the rare transitions regimeChandra Nair, Erik Ordentlich, Tsachy Weissman. 1838-1842 [doi]
- Convergence of profile based estimatorsAlon Orlitsky, Narayana P. Santhanam, K. Viswanathan, Junan Zhang. 1843-1847 [doi]
- Further results on coding for reliable communication over packet networksDesmond S. Lun, Muriel Médard, Ralf Koetter, Michelle Effros. 1848-1852 [doi]
- Coding schemes for line networksPayam Pakzad, Christina Fragouli, Amin Shokrollahi. 1853-1857 [doi]
- A throughput-delay trade-off in packetized systems with erasuresMikko Vehkaperä, Muriel Médard. 1858-1862 [doi]
- Crosslayer design for distributed MAC and network coding in wireless ad hoc networksYalin Evren Sagduyu, Anthony Ephremides. 1863-1867 [doi]
- A theoretical study of watermarking securityFrançois Cayre, Caroline Fontaine, Teddy Furon. 1868-1872 [doi]
- A secure traitor tracing scheme against key exposureKazuto Ogawa, Goichiro Hanaoka, Hideki Imai. 1873-1877 [doi]
- Traitor tracing against powerful attacksSimon McNicol, Serdar Boztas, Asha Rao. 1878-1882 [doi]
- Turbo block codes for the binary adder channelMaria de Lourdes M. G. Alcoforado, Valdemar Cardoso da Rocha, Garik Markarian. 1883-1887 [doi]
- Capacity approaching turbo coding for half duplex relayingZheng Zhang, Tolga M. Duman. 1888-1892 [doi]
- Non-systematic turbo coding with unequal energy allocation for nonuniform memoryless sourcesRichard Demo Souza, Gil I. Shamir, Javier Garcia-Frias, Kai Xie. 1893-1897 [doi]
- Non-systematic low-density parity-check codes for nonuniform sourcesGil I. Shamir, Joseph J. Boutros. 1898-1902 [doi]
- Optimal power control for multiuser CDMA channelsAnke Feiten, Rudolf Mathar. 1903-1907 [doi]
- A continuous-time extension of welch~s lower bound on total squared correlationJoon Ho Cho. 1908-1912 [doi]
- Maximum correlation of binary signals over fading channelsFung-Ling Chiu, Nam Yul Yu, Guang Gong. 1913-1917 [doi]
- Symmetric capacity of optimal sequences in quasi-scalable CDMA systemsFrederik Vanhaverbeke, Marc Moeneclaey. 1918-1921 [doi]
- On the error exponent of trellis source codingIlan Hen, Neri Merhav. 1922-1926 [doi]
- Perturbations in optimal trellis source code designJohn C. Kieffer. 1927-1931 [doi]
- On the BCJR algorithm for rate-distortion source codingJohn B. Anderson, Norbert Goertz, Tomas Eriksson. 1932-1936 [doi]
- Rateless space-time codingUri Erez, Gregory W. Wornell, Mitchell D. Trott. 1937-1941 [doi]
- Linear toeplitz space time block codesJian-Kang Zhang, Jing Liu, Kon Max Wong. 1942-1946 [doi]
- A lossless layered coding strategy for MIMO systemsYoujian Liu. 1947-1951 [doi]
- Space-time Reed-Muller codes for noncoherent MIMO transmissionAlexei Ashikhmin, A. Robert Calderbank. 1952-1956 [doi]
- Derivation of autocorrelation distributions of Sidel'nikov sequences using cyclotomic numbersYoung-Sik Kim, Jung-Soo Chung, Jong-Seon No, Habong Chung. 1957-1961 [doi]
- Cyclotomic numbers of order 5 over F/sub p//sup n/Jung-Soo Chung, Young-Sik Kim, Tae-Hyung Lim, Jong-Seon No, Habong Chung. 1962-1966 [doi]
- Multiple-sequence BM algorithm can be replaced by a succession of single-sequence BM algorithmShojiro Sakata. 1967-1971 [doi]
- Coset distribution of triple-error-correcting binary primitive BCH codesPascale Charpin, Tor Helleseth, Victor A. Zinoviev. 1972-1976 [doi]
- Network monitoring in multicast networks using network codingTracey Ho, Ben Leong, Yu-Han Chang, Yonggang Wen, Ralf Kötter. 1977-1981 [doi]
- Efficient network codes for cyclic networksElona Erez, Meir Feder. 1982-1986 [doi]
- The encoding complexity of network codingMichael Langberg, Alexander Sprintson, Jehoshua Bruck. 1987-1991 [doi]
- On the optimality of group network codesTerence H. Chan. 1992-1996 [doi]
- A new class of binary sequences with low correlation and large linear complexity from function fieldsHonggang Hu, Lei Hu, Dengguo Feng. 1997-2001 [doi]
- On almost perfect nonlinear mappings over F/sup n//sub 2/Thierry P. Berger, Anne Canteaut, Pascale Charpin, Yann Laigle-Chapuy. 2002-2006 [doi]
- On the linear complexity over F/sub p/ of M-ary Sidel'nikov sequencesYoung-Sik Kim, Jung-Soo Chung, Jong-Seon No, Habong Chung. 2007-2011 [doi]
- A unified analysis for the fast correlation attackMarc P. C. Fossorier, Miodrag J. Mihaljevic, Hideki Imai. 2012-2015 [doi]
- Block turbo equalization for imperfect channel state informationMarkus A. Dangl, Christian Sgraja, Jürgen Lindner. 2016-2020 [doi]
- Turbo equalization based on factor graphsQinghua Guo, Ping Li 0009, Hans-Andrea Loeliger. 2021-2025 [doi]
- Performance analysis of turbo equalization for nonlinear channelsCraig E. Burnet, William G. Cowley. 2026-2030 [doi]
- A new SISO algorithm with application to turbo equalizationMarcin Sikora, Daniel J. Costello Jr.. 2031-2035 [doi]
- Error-correcting signature code for multiple-access adder channelJun Cheng 0001, Koichi Kamoi, Yoichiro Watanabe. 2036-2039 [doi]
- Signature coding for OR channel with asynchronous accessSándor Györi. 2040-2044 [doi]
- Combination Oppermann sequences for spread spectrum systemsGregory Cresp, Hans-Jürgen Zepernick, Hai Huyen Dam. 2045-2049 [doi]
- Matrix construction using cyclic shifts of a columnAndrew Z. Tirkel, Tom E. Hall. 2050-2054 [doi]
- Multi-user diversity without transmitter CSIKambiz Azarian, Young-Han Nam, Hesham El Gamal. 2055-2059 [doi]
- Delay optimal control algorithm for a multiaccess fading channel with peak power constraintMunish Goyal, Anurag Kumar 0001, Vinod Sharma. 2060-2064 [doi]
- The multiplexing gain of wireless networksAnders Høst-Madsen, Aria Nosratinia. 2065-2069 [doi]
- Outage and throughput bounds for stochastic wireless networksMartin Haenggi. 2070-2074 [doi]
- A systematic design of high-rate full-diversity space-frequency codes for MIMO-OFDM systemsKiran T. Gowda, B. Sundar Rajan. 2075-2079 [doi]
- Full-diversity group space-time-frequency (GSTF) codes from cyclic codesUdipi Sripati, B. Sundar Rajan, Vummintala Shashidhar. 2080-2084 [doi]
- Constructions of space-frequency codes for MIMO-OFDM systemsHsiao-feng Lu, Mao-Ching Chiu. 2085-2089 [doi]
- A rate-one full-diversity low-complexity space-time-frequency block code (STFBC) for 4-Tx MIMO-OFDMS. Gowrisankar, B. Sundar Rajan. 2090-2094 [doi]
- New codes from chains of quasi-cyclic codesMarkus Grassl, Greg White. 2095-2099 [doi]
- On symbol permutation invariant balanced codesRaffaele Mascella, Luca G. Tallini. 2100-2104 [doi]
- The new construction of rank codesAlexander Kshevetskiy, Ernst M. Gabidulin. 2105-2108 [doi]
- A class of error control codes for M-spotty byte errors occurred in a limited number of bytesKazuyoshi Suzuki, Mamoru Shimizu, Toshihiko Kashiyama, Eiji Fujiwara. 2109-2113 [doi]
- On the overhead-delay tradeoff in carrier sense collision channelsAhmad Khoshnevis, Ashutosh Sabharwal. 2114-2118 [doi]
- A wireless network can achieve maximum throughput without each node meeting all othersAurelie C. Lozano, Sanjeev R. Kulkarni. 2119-2123 [doi]
- Staleness vs. waiting time in universal discrete broadcastMichael Langberg, Alexander Sprintson, Jehoshua Bruck. 2124-2128 [doi]
- Fundamental tradeoff between burstiness and delay in traffic shapingRaymond W. Yeung. 2129-2132 [doi]
- Secret key and private key constructions for simple multiterminal source modelsChunxuan Ye, Prakash Narayan. 2133-2137 [doi]
- Secrecy capacities for multiterminal channel modelsImre Csiszár, Prakash Narayan. 2138-2141 [doi]
- The secret key~private key capacity region for three terminalsChunxuan Ye, Prakash Narayan. 2142-2146 [doi]
- Secret key agreement under sampling attackJun Muramatsu, Kazuyuki Yoshimura, Kenichi Arai, Peter Davis. 2147-2151 [doi]
- Secrecy capacity of SIMO and slow fading channelsPatricio Parada, Richard E. Blahut. 2152-2155 [doi]
- Enumerators for protograph ensembles of LDPC codesS. L. Fogal, Robert J. McEliece, Jeremy Thorpe. 2156-2160 [doi]
- On the asymptotic weight distribution of regular LDPC ensemblesVishwambhar Rathi. 2161-2165 [doi]
- A probabilistic computation method for the weight distribution of low-density parity-check codesMasanori Hirotomo, Masanori Mohri, Masakatu Morii. 2166-2170 [doi]
- Euclidean geometry codes, minimum weight words and decodable error-patterns using bit-flippingTom Høholdt, Jørn Justesen, Bergtor Jonsson. 2171-2173 [doi]
- On the rates for the general broadcast channel with partially cooperating receiversRon Dabora, Sergio D. Servetto. 2174-2178 [doi]
- Differentiated rate scheduling for gaussian broadcast channelsMasoud Sharif, Amir F. Dana, Babak Hassibi. 2179-2183 [doi]
- Achievable rates for the broadcast channel with states known at the transmitterYossef Steinberg, Shlomo Shamai. 2184-2188 [doi]
- Rate-splitting for the deterministic broadcast channelTodd P. Coleman, Michelle Effros, Emin Martinian, Muriel Médard. 2189-2192 [doi]
- Analyticity of entropy rate in families of hidden markov chainsGuangyue Han, Brian H. Marcus. 2193-2197 [doi]
- Approximations for the entropy rate of a hidden Markov processErik Ordentlich, Tsachy Weissman. 2198-2202 [doi]
- Innovation and pattern entropy of stationary processesAlon Orlitsky, Narayana P. Santhanam, K. Viswanathan, Narayana Zhang. 2203-2207 [doi]
- On the relationship between process and pattern entropy rateGeorge M. Gemelos, Tsachy Weissman. 2208-2212 [doi]
- Space-time constellation design for partial CSI at the receiverJochen Giese, Mikael Skoglund. 2213-2217 [doi]
- Code design for the low SNR noncoherent MIMO block Rayleigh fading channelShivratna Giri Srinivasan, Mahesh K. Varanasi. 2218-2222 [doi]
- Some exact union bound results for maximum likelihood detection in MIMO systemsGöran Lindell. 2223-2227 [doi]
- Codes for error detection, good or not goodIrina Gancheva, Torleiv Kløve. 2228-2231 [doi]
- Error detection with a class of q-ary two-weight codesRossitza Dodunekova, Stefan M. Dodunekov. 2232-2235 [doi]
- Unequal error protection explained by state-transition graphsVictor A. Pavlushkov, Rolf Johannesson, Victor V. Zyablov. 2236-2240 [doi]
- Multitrial decoding of concatenated Reed-Solomon codesGeorg Schmidt, Carolin Huppert, Martin Bossert. 2241-2245 [doi]
- Distributed algorithms for optimal rate-reliability tradeoff in networksJang-Won Lee, Mung Chiang, A. Robert Calderbank. 2246-2250 [doi]
- Broadcast stability in random accessBrooke Shrader, Anthony Ephremides. 2251-2255 [doi]
- On the throughput, capacity and stability regions of random multiple access over standard multi-packet reception channelsJie Luo 0001, Anthony Ephremides. 2256-2260 [doi]
- Stability of scheduled multi-access communication over quasi-static flat fading channels with random coding and independent decodingK. C. V. Kalyanarama Sesha Sayee, Utpal Mukherji. 2261-2265 [doi]
- An authentication scheme based on an low-density parity-check matrixTadashi Wadayama. 2266-2269 [doi]
- Secret, public and quantum correlation cost of triples of random variablesAndreas J. Winter 0002. 2270-2274 [doi]
- Asymptotic optimality of tree-based group key management schemesHideyuki Sakai, Hirosuke Yamamoto. 2275-2279 [doi]
- Collusion of fingerprints via the gradient attackDarko Kirovski. 2280-2284 [doi]
- Constructions of quasi-cyclic LDPC codes for the AWGN and binary erasure channels based on finite fields and affine mappingsLan Lan, Lingqi Zeng, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar. 2285-2289 [doi]
- A class of quasi-cyclic regular LDPC codes from cyclic difference families with girth 8Masaya Fujisawa, Shojiro Sakata. 2290-2294 [doi]
- High-rate quasi-cyclic low-density parity-check codes derived from finite affine planesNorifumi Kamiya. 2295-2299 [doi]
- Encoders for block-circulant LDPC codesKenneth S. Andrews, Sam Dolinar, Jeremy Thorpe. 2300-2304 [doi]
- Extension of quasi-cyclic LDPC codes by liftingSeho Myung, Kyeongcheol Yang. 2305-2309 [doi]
- High SNR analysis of MIMO broadcast channelsNihar Jindal. 2310-2314 [doi]
- The capacity region of multiple input erasure broadcast channelsAmir F. Dana, Babak Hassibi. 2315-2319 [doi]
- Reduced-complexity power allocation in zeroforcing MIMO-OFDM downlink system with multiuser diversityPeter W. C. Chan, Roger Shu Kwan Cheng. 2320-2324 [doi]
- On the user selection for MIMO broadcast channelsAlireza Bayesteh, Amir K. Khandani. 2325-2329 [doi]
- Optimal broadcast scheduling for random-loss channelsCheng Huang, Lihao Xu. 2330-2334 [doi]
- Source coding for a simple multi-hop networkWei-Hsin Gu, Michelle Effros. 2335-2339 [doi]
- A universal lossless compressor with side information based on context tree weightingHaixiao Cai, Sanjeev R. Kulkarni, Sergio Verdú. 2340-2344 [doi]
- Bayes universal coding algorithm for side information context tree modelsToshiyasu Matsushima, Shigeichi Hirasawa. 2345-2348 [doi]
- String matching-based universal source codes for source networks with asymptotically zero feedbackEn-Hui Yang, Da-ke He, Tomohiko Uyematsu, Raymond W. Yeung. 2349-2353 [doi]
- On the achievable information rates of finite-state input two-dimensional channels with memoryOri Shental, Noam Shental, Shlomo Shamai. 2354-2358 [doi]
- On the asymptotic properties of sparse matrix codes in the CEO problemTatsuto Murayama. 2359-2363 [doi]
- Mathematical structures derived from the q-product uniquely determined by tsallis entropyHiroki Suyari, Makoto Tsukada, Yoshinori Uesaka. 2364-2368 [doi]
- Correlation inequalities: a useful tool in the theory of LDPC codesNicolas Macris. 2369-2373 [doi]
- Properties of Kullback-Leibler cross-entropy minimization in nonextensive frameworkAmbedkar Dukkipati, Narasimha Murty Musti, Shalabh Bhatnagar. 2374-2378 [doi]
- Using variable-length error-correcting codes in MPEG-4 videoVictor Buttigieg, Rennie Deguara. 2379-2383 [doi]
- On designing error-correctable codes by biomolecular computationJian-qin Liu, Katsunori Shimohara. 2384-2388 [doi]
- Filterbank decompositions for BCH-codes with applications to soft decoding and code division multiple acces systemsGeert Van Meerbergen, Marc Moonen, Hugo De Man. 2389-2393 [doi]
- Toward a theory of avalanche-creating and error-controlling encoding schemesGrzegorz Malewicz. 2394-2398 [doi]