Table of Contents

• A generalized probabilistic data association multiuser detectorYufei Huang, Jianqiu Michelle Zhang. [doi]
• On achievable rate regions for the Gaussian interference channelIgal Sason. 1 [doi]
• Capacity approaching codes for relay channelsZheng Zhang, Israfil Bahceci, Tolga M. Duman. 2 [doi]
• An achievable rate for the multiple level relay channelLiang-Liang Xie, P. R. Kumar. 3 [doi]
• Improved achievable rates for user cooperation and relay channelsMohammad Ali Khojastepour, Ashutosh Sabharwal, Behnaam Aazhang. 4 [doi]
• Distance properties of expander codesAlexander Barg, Gilles Zémor. 5 [doi]
• On the trade-off between rate and performance of expander codes on AWGN channelsSouvik Dihidar, Steven W. McLaughlin, Prasad Tetali. 6 [doi]
• The average weight distribution of Tanner code ensembles and a way to modify them to improve their weight distributionJean-Pierre Tillich. 7 [doi]
• On nearly-MDS expander codesRon M. Roth, Vitaly Skachek. 8 [doi]
• On the redundancy of HMM patternsAnand K. Dhulipala, Alon Orlitsky. 9 [doi]
• On the entropy of a Hidden Markov processPhilippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski. 10 [doi]
• Large deviations performance of predictors for Markov sourcesErez Sabbag, Neri Merhav. 11 [doi]
• On the entropy rate of a hidden Markov modelSebastian Egner, Vladimir B. Balakirsky, Ludo Tolhuizen, Stan Baggen, Henk D. L. Hollmann. 12 [doi]
• Efficient key agreement and signature schemes using compact representations in GF(p/sup 10/)Kenneth J. Giuliani, Guang Gong. 13 [doi]
• Attacks on a secure group communication scheme with hierarchical access controlWilli Geiselmann, Rainer Steinwandt. 14 [doi]
• Secret key agreement from correlated source outputs using LDPC matricesJun Muramatsu. 15 [doi]
• Optimal multiple assignments based on integer programming in secret sharing schemesMitsugu Iwamoto, Hirosuke Yamamoto, Hirohisa Ogawa. 16 [doi]
• Efficient routing in wireless networks with random node distributionMartin Haenggi. 17 [doi]
• Realizing MIMO gains without user cooperation in large single-antenna wireless networksHelmut Bölcskei, Rohit U. Nabar. 18 [doi]
• Fast transmission in ad hoc networksPaul Balister, Béla Bollobás, Martin Haenggi, Mark Walters. 19 [doi]
• The feasibility of matchings in a wireless networkSteven A. Borbash, Anthony Ephremides. 20 [doi]
• On the optimality of coloring with a latticeYael Merksamer, Tuvi Etzion. 21 [doi]
• Optimal t-interleaving on toriAnxiao Jiang, Matthew Cook 0001, Jehoshua Bruck. 22 [doi]
• Optimal interleaving schemes for correcting 2-D cluster errorsWen-Qing Xu, Solomon W. Golomb. 23 [doi]
• Prediction and adaptive coding of sources with large or infinite alphabetBoris Ryabko, Jaakko Astola. 24 [doi]
• Relative redundancy: a more stringent performance guarantee for universal compressionAlon Orlitsky, Narayana P. Santhanam, Junan Zhang. 25 [doi]
• Code design for lossless multiterminal networksVladimir Stankovic 0001, Angelos D. Liveris, Zixiang Xiong, Costas N. Georghiades. 26 [doi]
• Average case universal lossless compression with unknown alphabetsGil I. Shamir. 27 [doi]
• The weak information projectionPeter Harremoës. 28 [doi]
• A distribution dependent refinement of Pinsker's inequalityErik Ordentlich, Marcelo J. Weinberger. 29 [doi]
• Information closures of exponential familiesImre Csiszár, Frantisek Matús. 30 [doi]
• Jensen-Shannon divergence and Hilbert space embeddingBent Fuglede, Flemming Topsøe. 31 [doi]
• On optimal multiresolution source-channel coding across degraded broadcast channelsErtem Tuncel. 32 [doi]
• Cut sets and information flow in networks of two-way channelsGerhard Kramer, Serap A. Savari. 33 [doi]
• Cut-set arguments for source-channel networksMichael Gastpar. 34 [doi]
• Zero-error communication over networksJürg Wullschleger. 35 [doi]
• Raptor codesAmin Shokrollahi. 36 [doi]
• Rateless codes on noisy channelsRavi Palanki, Jonathan S. Yedidia. 37 [doi]
• Raptor codes on symmetric channelsOmid Etesami, Mehdi Molkaraie, Amin Shokrollahi. 38 [doi]
• Finite length analysis of LT codesRichard M. Karp, Michael Luby, Amin Shokrollahi. 39 [doi]
• Entropy measures of physics via complexityGiorgio Kaniadakis, Flemming Topsøe. 40 [doi]
• On the maximum entropy theorem for complex random vectorsGeorg Tauboeck. 41 [doi]
• On the relation between the Shannon entropy and the von Neumann entropySiu-Wai Ho, Raymond W. Yeung. 42 [doi]
• On minimum entropy graph coloringsJean Cardinal, Samuel Fiorini, Gilles Van Assche. 43 [doi]
• The private key capacity region for three terminalsChunxuan Ye, Prakash Narayan. 44 [doi]
• Rates for bit commitment and coin tossing from noisy correlationHideki Imai, Jörn Müller-Quade, Anderson C. A. Nascimento, Andreas J. Winter 0002. 45 [doi]
• Generalized coset schemes for the wire-tap channel: application to biometricsAnderson D. Cohen, Gilles Zémor. 46 [doi]
• Achieving the perfect secrecy for the Gaussian wiretap channel with side informationChaichana Mitrpant, Yuan Luo, A. J. Han Vinck. 47 [doi]
• Capacity-achieving multiple coding for MIMO Rayleigh fading systemsJianhan Liu, Jinghu Chen, Anders Høst-Madsen, Marc P. C. Fossorier. 48 [doi]
• Space-time codes from property-LMehrdad Shamsi, Ian F. Blake. 49 [doi]
• An iterative channel estimation scheme for beamforming transmission and detection in MIMO systemsYang Tang, Branka Vucetic, Yonghui Li 0001. 50 [doi]
• Detectors and asymptotic analysis for bandwidth-efficient space-time multiple-access systemsYi Wu 0006, Markku J. Juntti, Teng Joon Lim. 51 [doi]
• On bit-interleaved turbo-coded modulation with low error floorsEirik Rosnes, Øyvind Ytrehus. 52 [doi]
• Short-cycle-free interleaver design for increasing minimum squared Euclidean distanceSheryl L. Howard, Siavash Sheikh Zeinoddin, Christian Schlegel, Vincent C. Gaudet. 53 [doi]
• Contention-free interleaversAjit Nimbalker, Thomas E. Fuja, Daniel J. Costello Jr., Keith T. Blankenship, Brian K. Classon. 54 [doi]
• Interleavers for turbo codes that yield a minimum distance growing with blocklengthJoseph J. Boutros, Gilles Zémor. 55 [doi]
• Error resilient LZ'77 scheme and its analysisStefano Lonardi, Wojciech Szpankowski, Mark Daniel Ward. 56 [doi]
• On certain pathwise properties of the sliding-window Lempel Ziv algorithmLuis Alfonso Lastras-Montaño. 57 [doi]
• Bounds on expansion in LZ'77-like codingVittorio Castelli, Luis Alfonso Lastras-Montaño. 58 [doi]
• Linear time universal coding of tree sources via FSM closureAlvaro Martín, Gadiel Seroussi, Marcelo J. Weinberger. 59 [doi]
• On a conjecture of Majani and RumseyXue-Bin Liang. 60 [doi]
• A new proof of Parisi's conjecture for the finite random assignment problemChandra Nair, Balaji Prabhakar, Mayank Sharma. 61 [doi]
• Optimization of matrix monotone functions: saddle-point, worst case noise analysis, and applicationsHolger Boche, Eduard A. Jorswieck. 62 [doi]
• An approximation of the Gilbert-Elliott channel via a queue-based channel modelLibo Zhong, Fady Alajaji, Glen Takahara. 63 [doi]
• A geometrical investigation of the rank-1 Ricean MIMO channel at high SNRJan Hansen, Helmut Bölcskei. 64 [doi]
• Noncoherent MIMO communication: Grassmannian constellations and efficient detectionRamy H. Gohary, Timothy N. Davidson. 65 [doi]
• Optimal linear precoding for BICM over MIMO channelsNicolas Gresset, Joseph J. Boutros, Loïc Brunel. 66 [doi]
• Pseudocodeword weights and stopping setsChristine A. Kelley, Deepak Sridhara, Jun Xu, Joachim Rosenthal. 67 [doi]
• LP decoding corrects a constant fraction of errorsJon Feldman, Tal Malkin, Rocco A. Servedio, Cliff Stein, Martin J. Wainwright. 68 [doi]
• Analysis of an algorithm for irregular LDPC code constructionAditya Ramamoorthy, Richard D. Wesel. 69 [doi]
• Lower bounds on the minimum pseudoweight of linear codesPascal O. Vontobel, Ralf Koetter. 70 [doi]
• Capacity-achieving feedback scheme for Markov channels with channel state informationJialing Liu, Nicola Elia, Sekhar Tatikonda. 71 [doi]
• Linear Gaussian channels: feedback capacity under power constraintsShaohua Yang, Aleksandar Kavcic, Sekhar Tatikonda. 72 [doi]
• On the sufficiency of power control for a class of channels with feedbackDesmond S. Lun, Muriel Médard. 73 [doi]
• On a capacity achieving scheme for the colored Gaussian channel with feedbackAyelet Shahar-Doron, Meir Feder. 74 [doi]
• Pseudonoise sequences based on algebraic function fieldsAndrew Klapper. 75 [doi]
• Algebraic-geometric codes on the erasure channelAndrew Brown 0003, Amin Shokrollahi. 76 [doi]
• A class of algebraic-geometric codes for Lee-Metric and their decodingXin-Wen Wu, Margreta Kuijper, Parampalli Udaya. 77 [doi]
• The missing evaluation codes from order domain theoryHenning E. Andersen, Olav Geil. 78 [doi]
• Information retrieval and processing in sensor networks: deterministic scheduling vs. random accessMin Dong, Lang Tong, Brian M. Sadler. 79 [doi]
• Computing and communicating statistics in sensor networksArvind Giridhar, P. R. Kumar. 80 [doi]
• Delay issues in linear sensory networksCedric Florens, Masoud Sharif, Robert J. McEliece. 81 [doi]
• Sensor network devolution and breakdown in survivor connectivitySrisankar S. Kunniyur, Santosh S. Venkatesh. 82 [doi]
• Recursive construction of Golay sequencesChangho Suh, Chan-Soo Hwang. 83 [doi]
• Generalized binary Udaya-Siddiqi sequencesXiaohu Tang, Parampalli Udaya, Pingzhi Fan. 84 [doi]
• A new optimal double periodical construction of one target two-dimensional arraysOscar Moreno, Solomon W. Golomb. 85 [doi]
• Multisequences with d-perfect propertyXiutao Feng, Quanlong Wang, Zongduo Dai. 86 [doi]
• Sliding-block decodable encoders between (d, k)-constrained systems of equal capacityNavin Kashyap, Paul H. Siegel. 87 [doi]
• An algorithm to enumerate codewords for third-order spectral-null codesChing-Nung Yang, Tse-Shih Chen. 88 [doi]
• On guided scrambling with guaranteed maximum run-length constraintsAdriaan J. de Lind van Wijngaarden, Kees A. Schouhamer Immink. 89 [doi]
• A convolution interpretation of (M, d, k) run-length-limited capacityYogesh Sankarasubramaniam, Steven W. McLaughlin. 90 [doi]
• Variable-to-variable codes with small redundancy ratesMichael Drmota, Wojciech Szpankowski. 91 [doi]
• Bounds on the expected cost of one-to-one codesSerap A. Savari, Akshay Naheta. 92 [doi]
• Redundancy-complexity tradeoff of multiresolution coding for successively refinable sourcesJun Yang, Zhen Zhang. 93 [doi]
• On second-order properties of minimum redundancy block codesYuriy A. Reznik. 94 [doi]
• Generalized unified construction of space-time codes with optimal rate-diversity tradeoffHsiao-feng Lu, P. Vijay Kumar. 95 [doi]
• On the optimality of lattice space-time (LAST) codingHesham El Gamal, Giuseppe Caire, Mohamed Oussama Damen. 96 [doi]
• Diversity/multiplexing tradeoff in ISI channelsLeonard H. Grokop, David N. C. Tse. 97 [doi]
• Permutation codes: achieving the diversity-multiplexing tradeoffSaurabha Tavildar, Pramod Viswanath. 98 [doi]
• Decision-feedback equalization achieves full diversity for finite delay spread channelsAbdelkader Medles, Dirk T. M. Slock. 99 [doi]
• Concentration theorem for tripartite LDPC codesPeyman Meshkat, Hamid Jafarkhani. 100 [doi]
• On the effect of parity-check weights in iterative decodingNandakishore Santhi, Alexander Vardy. 101 [doi]
• Weight distributions of LDPC code ensembles: combinatorics meets statistical physicsChangyan Di, Andrea Montanari, Rüdiger L. Urbanke. 102 [doi]
• Further results on finite-length scaling for iteratively decoded LDPC ensemblesAbdelaziz Amraoui, Rüdiger L. Urbanke, Andrea Montanari, Thomas J. Richardson. 103 [doi]
• On the complexity of exact maximum likelihood decoding on tail-biting trellisesPriti Shankar. 104 [doi]
• Channel configuration of multiple-access channelYoichiro Watanabe, Koichi Kamoi. 105 [doi]
• On the multiple-access channel with rate-limited state information at the encodersYakup Cemal, Yossef Steinberg. 106 [doi]
• Construction of new signature codes for the T-terminal binary adder multiple access channel with partially active usersEdward C. van der Meulen, Saskia Vangheluwe. 107 [doi]
• Achievable rates for multiple-access channels with correlated messagesS. Sandeep Pradhan, Suhan Choi, Kannan Ramchandran. 108 [doi]
• On the structure of the capacity region of the Gaussian multiple access channelNinoslav Marina, Bixio Rimoldi. 109 [doi]
• An analysis of blocking switches using error control codesCan Emre Koksal. 110 [doi]
• Optimal universal schedules for discrete broadcastMichael Langberg, Alexander Sprintson, Jehoshua Bruck. 111 [doi]
• Throughput optimal power and rate control for queued multiaccess and broadcast communicationsEdmund M. Yeh, Aaron S. Cohen. 112 [doi]
• Scheduling for efficient data broadcast over two channelsKevin Foltz, Lihao Xu, Jehoshua Bruck. 113 [doi]
• Large deviation in a two-servers system with dynamic routingE. A. Pechersky, Yuri M. Suhov, Nikita D. Vvedenskaya. 114 [doi]
• Communicating to colocated ad-hoc receiving nodes in a fading environmentMichael Katz, Shlomo Shamai. 115 [doi]
• Robust coding schemes for distributed sensor networks with unreliable sensorsJun Chen, Toby Berger. 116 [doi]
• Coding and routing complexity in sensor networksSekhar Tatikonda, Kannan Ramchandran. 117 [doi]
• On interacting encoders and decoders in multiuser settingsStark C. Draper, Brendan J. Frey, Frank R. Kschischang. 118 [doi]
• Rate region of the quadratic Gaussian CEO problemVinod M. Prabhakaran, David N. C. Tse, Kannan Ramchandran. 119 [doi]
• Determinants of binary circulant matricesGerard Maze, Hugo Parlier. 120 [doi]
• Multiple-shift complementary sequences and their peak-to-average power ratio valuesYan Xin 0002, Ivan J. Fair. 121 [doi]
• Linear complexity over F/sub p/ of Sidel'nikov sequencesTor Helleseth, John Erik Mathiassen, Martijn Maas, Toon Segers. 122 [doi]
• Asymptotic behavior of normalized linear complexity of ultimately non-periodic binary sequencesZongduo Dai, Shaoquan Jiang, Kyoki Imamura, Guang Gong. 123 [doi]
• Results on the nonlinear span of binary sequencesPanagiotis Rizomiliotis, Nicholas Kalouptsidis. 124 [doi]
• STBCs with optimal diversity-multiplexing tradeoff for 2, 3 and 4 transmit antennasVummintala Shashidhar, B. Sundar Rajan, P. Vijay Kumar. 125 [doi]
• Information-lossless STBCs from crossed-product algebrasVummintala Shashidhar, B. Sundar Rajan, B. A. Sethuraman. 126 [doi]
• High-throughput error correcting space-time block codesPhilippa A. Martin, Desmond P. Taylor. 127 [doi]
• On the decoding and diversity-multiplexing gain tradeoff of a recent multilevel construction of space-time codesP. Vijay Kumar, Hsiao-feng Lu, Sameer A. Pawar. 128 [doi]
• Linear equalization via factor graphsRobert J. Drost, Andrew C. Singer. 129 [doi]
• Minimum mean square error equalization using priors for two-dimensional intersymbol interferenceNaveen Singla, Joseph A. O'Sullivan. 130 [doi]
• Bayesian and nonBayesian methods for iterative joint decoding and detection in the presence of phase noiseGiulio Colavolpe, Alan Barbieri, Giuseppe Caire, Nicolas Bonneau. 131 [doi]
• Joint delayed-decision feedback sequence estimation with adaptive state allocationPeter A. Hoeher, Sabah Badri-Hoeher, Shiyang Deng, Claudiu Krakowski, Wen Xu. 132 [doi]
• On the soft-decision in the iterative receiver for coded MIMO systemsJinho Choi 0001, Yi Hong 0001, Jinhong Yuan. 133 [doi]
• A family of quantum protocolsIgor Devetak, Aram Wettroth Harrow, Andreas J. Winter 0002. 134 [doi]
• On intrinsic informationMatthias Christandl, Renato Renner. 135 [doi]
• Security of quantum key distribution with imperfect devicesDaniel Gottesman, Hoi-Kwong Lo, Norbert Lütkenhaus, John Preskill. 136 [doi]
• Quantum key distribution with vacua or dim pulses as decoy statesHoi-Kwong Lo. 137 [doi]
• Reliability of Calderbank-Shor-Steane codes and security of quantum key distributionMitsuru Hamada. 138 [doi]
• Language evolution and information theoryRudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe. 139 [doi]
• Minimax regret portfolios for restricted stock sequencesThomas M. Cover. 140 [doi]
• An information theoretic model for physical uncloneable functionsPim Tuyls, Boris Skoric, S. Stallinga, Ton H. Akkermans, W. Ophey. 141 [doi]
• A differential approach to a polynomial equivalence problemLudovic Perret, Abdelmejid Bayad. 142 [doi]
• A comparison of network coding and tree packingYunnan Wu, Philip A. Chou, Kamal Jain. 143 [doi]
• Byzantine modification detection in multicast networks using randomized network codingTracey Ho, Ben Leong, Ralf Koetter, Muriel Médard, Michelle Effros, David R. Karger. 144 [doi]
• Subtree decomposition for network codingChristina Fragouli, Emina Soljanin. 145 [doi]
• Convolutional network codesElona Erez, Meir Feder. 146 [doi]
• Maximum likelihood decoding of trellis codes in fading channels with no receiver CSI is a polynomial-complexity problemChun-Hao Hsu, Achilleas Anastasopoulos. 147 [doi]
• The effect of channel side information at transmitter on coding complexityVijay Nagarajan, Youjian Liu, Jilei Hou. 148 [doi]
• Entropy amplification by aperiodic noise and side information problemsAaron S. Cohen, Ram Zamir. 149 [doi]
• Coding for the variably coherent channelOliver M. Collins. 150 [doi]
• Puncturing for finite length low-density parity-check codesJeongseok Ha, Jaehong Kim, Steven W. McLaughlin. 151 [doi]
• Rate-compatible low-density parity-check codesTao Tian, Chris Jones, John D. Villasenor. 152 [doi]
• Rate-compatible array LDPC codesAjay Dholakia, Sedat Ölçer. 153 [doi]
• Optimal puncturing for multiple parallel concatenated codesFredrik Brännström, Lars K. Rasmussen, Alex J. Grant. 154 [doi]
• Rotationally invariant space time constellationsJun Shi 0001, Richard D. Wesel. 155 [doi]
• Low-density parity-check space-time codes: performance analysis and code constructionYuankai Wang, Reza Omrani, Keith M. Chugg, P. Vijay Kumar. 156 [doi]
• Upper bound analysis of diversity for unitary space time constellationsGuangyue Han, Joachim Rosenthal. 157 [doi]
• On the BCJR-like Trellis for space-time group codesJarkko Hiltunen, Jyrki T. Lahtonen, Anu Nikkanen. 158 [doi]
• Block codes for the hard-square modelIsmail Demirkan, Jack K. Wolf. 159 [doi]
• Finite state models of constrained 2D dataJørn Justesen. 160 [doi]
• Analysis of bit-stuffing codes and lower bounds on capacity for 2-D constrained arrays using quasistationary measuresSøren Forchhammer. 161 [doi]
• Capacity bounds for the hard-triangle modelZsigmond Nagy, Kenneth Zeger. 162 [doi]
• Universal lossless source controlled channel decodingKai Xie, Gil I. Shamir. 163 [doi]
• The binary reflected Gray code is optimal for M-PSKErik Agrell, Johan Lassing, Erik G. Ström, Tony Ottosson. 164 [doi]
• Channel decoding of systematically encoded unknown redundant sourcesErik Ordentlich, Gadiel Seroussi, Sergio Verdú, Krishnamurthy Viswanathan, Marcelo J. Weinberger, Tsachy Weissman. 165 [doi]
• Source-controlled turbo coding of nonuniform memoryless sources based on unequal energy allocationFelipe Cabarcas, Richard Demo Souza, Javier Garcia-Frias. 166 [doi]
• A principle of minimum expected riskMaya R. Gupta. 167 [doi]
• Maximum entropy models: convergence rates and applications in dynamic system monitoringGang Liang, Bin Yu 0001, Nina Taft. 168 [doi]
• Optimal Bregman prediction and Jensen's equalityArindam Banerjee, Xin Guo, Hui Wang 0003. 169 [doi]
• Consistent estimation of the basic neighborhood of Markov random fieldsImre Csiszár, Zsolt Talata. 170 [doi]
• Minimum redundancy tree for key distribution in secure multicastSiu-Ping Chan, Chi-Wah Kok. 171 [doi]
• Information-theoretic approach to privacy protection of biometric templatesJasper Goseling, Pim Tuyls. 172 [doi]
• A point-subset compression algorithm for fiber-based certificates of authenticityDarko Kirovski. 173 [doi]
• The capacity region of the Gaussian MIMO broadcast channelHanan Weingarten, Yossef Steinberg, Shlomo Shamai. 174 [doi]
• Scaling laws of sum rate using time-sharing, DPC, and beamforming for MIMO broadcast channelsMasoud Sharif, Babak Hassibi. 175 [doi]
• Broadcast channels with cooperating receivers: a downlink for the sensor reachback problemRon Dabora, Sergio D. Servetto. 176 [doi]
• Minimax duality of Gaussian vector broadcast channelsWei Yu 0001, Tian Lan. 177 [doi]
• Computation of information rates by particle methodsJustin Dauwels, Hans-Andrea Loeliger. 178 [doi]
• Blahut-Arimoto algorithms for computing channel capacity and rate-distortion with side informationFrédéric Dupuis, Wei Yu, Frans M. J. Willems. 179 [doi]
• Numerical capacity analysis of time varying fading channels using finite state Markov modelsParastoo Sadeghi, Predrag B. Rapajic, Sarah J. Johnson. 180 [doi]
• A generalization of Arimoto-Blahut algorithmMohammad Rezaeian, Alex J. Grant. 181 [doi]
• On multiple burst-correcting shortened cyclic codesMario Blaum, Bruce Wilson, Luis Javier García-Villalba, Shaohua Yang. 182 [doi]
• Quasicyclic irreducible Goppa codesJohn A. Ryan, Patrick Fitzpatrick. 183 [doi]
• On existence of good self-dual quasicyclic codesBikash Kumar Dey. 184 [doi]
• Bounds on the minimum distances of a class of q-ary images of q/sup m/-ary irreducible cyclic codesIsaac Woungang, Alireza Sadeghian, William W. Melek. 185 [doi]
• Improving the diversity product of space-time Hamiltonian constellationsTerasan Niyomsataya, Ali Miri, Monica Nevins. 186 [doi]
• Higher order differential matrix modulationGerhard A. Bauch. 187 [doi]
• On optimal cyclotomic lattices and diagonal-single-layer space-time block codesGenyuan Wang, Xiang-Gen Xia. 188 [doi]
• On the random coding exponent of multiple antenna systems using space-time block codesJoakim Jaldén, Mikael Skoglund, Björn E. Ottersten. 189 [doi]
• A Ramsey theory approach to ghostbustingNavin Kashyap, Paul H. Siegel, Alexander Vardy. 190 [doi]
• An improvement to the bit stuffing algorithmSharon Aviran, Paul H. Siegel, Jack K. Wolf. 191 [doi]
• Tradeoff functions for constrained systems with unconstrained positionsTze-Lei Poo, Panu Chaichanavong, Brian H. Marcus. 192 [doi]
• Encoding algorithms for 2 dimensional run-length-limited constraintsHiroshi Kamabe. 193 [doi]
• On joint information embedding and lossy compressionAlina Maor, Neri Merhav. 194 [doi]
• Uniquely decodable multiple access source codesQian Zhao, Michelle Effros. 195 [doi]
• On causal and semicausal codes for joint information embedding and source codingNeri Merhav, Erik Ordentlich. 196 [doi]
• Fixed binning schemes: an operational duality between channel and source coding problems with side informationHua Wang, Pramod Viswanath. 197 [doi]
• Universal piecewise linear least squares predictionDavid Luengo, Suleyman Serdar Kozat, Andrew C. Singer. 198 [doi]
• Universal minimax discrete denoising under channel uncertaintyGeorge M. Gemelos, Styrmir Sigurjonsson, Tsachy Weissman. 199 [doi]
• On the optimality of symbol by symbol filtering and denoisingErik Ordentlich, Tsachy Weissman. 200 [doi]
• Universal denoising for the finite-input-general-output channelAmir Dembo, Tsachy Weissman. 201 [doi]
• Fighting three pirates with scattering codesHans Georg Schaathun. 202 [doi]
• Random coding technique for digital fingerprinting codes: fighting two pirates revisitedG. R. Blakley, Gregory A. Kabatiansky. 203 [doi]
• Good ternary 2-traceability codes existGregory A. Kabatiansky. 204 [doi]
• n)Khoongming Khoo, Swee-Huay Heng. 205 [doi]
• Performance of low-density parity-check codes with linear minimum distanceHossein Pishro-Nik, Faramarz Fekri. 206 [doi]
• Capacity-achieving ensembles for the binary erasure channel with bounded complexityHenry D. Pfister, Igal Sason, Rüdiger L. Urbanke. 207 [doi]
• Asymptotic weight and stopping set distributions for detailedly represented irregular LDPC code ensemblesRyoji Ikegaya, Kenta Kasai, Tomoharu Shibuya, Kohichi Sakaniwa. 208 [doi]
• Relations between belief propagation on erasure and symmetric channelsOmid Etesami. 209 [doi]
• Compressing encrypted sources using side-information codingPrakash Ishwar, Vinod M. Prabhakaran, Kannan Ramchandran. 210 [doi]
• Encoder side information is useful in source codingEmin Martinian, Gregory W. Wornell, Ram Zamir. 211 [doi]
• Source coding with feedforward: Gaussian sourcesS. Sandeep Pradhan. 212 [doi]
• Joint power and bandwidth allocation in downlink transmissionKrishnan Kumaran, Harish Viswanathan. 213 [doi]
• Collaborative algorithms for bandwidth and allocation in wireless networksAnanth Subramanian, Ali H. Sayed. 214 [doi]
• Capacity and dirty paper coding for Gaussian broadcast channels with common informationNihar Jindal, Andrea Goldsmith. 215 [doi]
• Water filling for uncoded communications over parallel Gaussian channelsMax H. M. Costa, Fabio A. L. Gomes. 216 [doi]
• The error exponent for finite-hypothesis channel identificationPatrick Mitran, Aleksandar Kavcic. 217 [doi]
• CPM reception combining complexity reduction techniques for schemes on minimum Euclidian distance upper bound and MSKFrancisco A. T. B. N. Monteiro, António J. C. B. Rodrigues. 218 [doi]
• Towards an information theoretic framework for object recognitionM. Brandon Westover, Joseph A. O'Sullivan. 219 [doi]
• Asymptotic robust Neyman-Pearson hypothesis testing based on moment classesCharuhas Pandit, Sean P. Meyn, Venugopal V. Veeravalli. 220 [doi]
• On hierarchical type coveringErtem Tuncel, Jayanth Nayak, Kenneth Rose. 221 [doi]
• Nonasymptotic upper bounds on the probability of the epsilon-atypical set for Markov chainsLuis Alfonso Lastras-Montaño. 222 [doi]
• On universal typesGadiel Seroussi. 223 [doi]
• Reliable channel regions for good codes transmitted over parallel channelsRuoheng Liu, Predrag Spasojevic, Emina Soljanin. 224 [doi]
• Maxwell's construction: the hidden bridge between maximum-likelihood and iterative decodingCyril Measson, Andrea Montanari, Rüdiger L. Urbanke. 225 [doi]
• Analysis of Bin models with applications in coding theoryOlgica Milenkovic. 226 [doi]
• On lower bounds for the capacity of deletion channelsEleni Drinea, Michael Mitzenmacher. 227 [doi]
• Coding for insertion/deletion error propagation effects associated with fixed length decoding windowsWillem A. Clarke, Hendrik C. Ferreira. 228 [doi]
• Insertion/deletion channels: reduced-state lower bounds on channel capacitiesAleksandar Kavcic, Ravi H. Motwani. 229 [doi]
• Reconstruction of a linear scramblerMathieu Cluzeau. 230 [doi]
• Privacy amplification secure against an adversary with selectable knowledgeRobert König, Ueli Maurer, Renato Renner. 231 [doi]
• Extracting randomness from generalized symbol-fixing and Markov sourcesRobert König, Ueli Maurer. 232 [doi]
• Smooth Renyi entropy and applicationsRenato Renner, Stefan Wolf 0001. 233 [doi]
• A new algorithm for cryptanalysis of filtered LFSRs: the "probability-matching" algorithmSabine Leveiller. 234 [doi]
• Explicit construction of families of LDPC codes with no 4-cyclesJon-Lark Kim, Uri N. Peled. 235 [doi]
• Grouping-and-shifting designs for structured LDPC codes with large girthJin Lu, José M. F. Moura, Urs Niesen. 236 [doi]
• Construction of good LDPC codes using dilation matricesMarcus Greferath, Michael E. O'Sullivan, Roxana Smarandache. 237 [doi]
• Methodologies for designing LDPC codes using protographs and circulantsJeremy Thorpe, Kenneth S. Andrews, Sam Dolinar. 238 [doi]
• Construction of quasicyclic LDPC codes based on the minimum weight codewords of Reed-Solomon codesLei Chen 0008, Ivana Djurdjevic, Jie Xu. 239 [doi]
• On the capacity of vector antenna MIMO systemsSandeep H. Krishnamurthy, Anand S. Konanur, Gianluca Lazzi, Brian L. Hughes. 240 [doi]
• Asymptotic capacity analysis of transmit antenna selectionShahab Sanayei, Aria Nosratinia. 241 [doi]
• The effect of line of sight on the asymptotic capacity of MIMO systemsLaura Cottatellucci, Mérouane Debbah. 242 [doi]
• Source-field wave-field concentration and dimension: towards spatial information contentRodney A. Kennedy, Thushara D. Abhayapala. 243 [doi]
• Limits to multiantenna capacity of spatially selective channelsTony S. Pollock, Thushara D. Abhayapala, Rodney A. Kennedy. 244 [doi]
• Order optimal energy efficient transmission policies in the small delay regimeRandall A. Berry. 245 [doi]
• Distributed scheduling in wireless data networks with service differentiationPiyush Gupta, Yogesh Sankarasubramaniam, Alexander L. Stolyar. 246 [doi]
• Delay optimal multiaccess communication for general packet length distributionsEdmund M. Yeh. 247 [doi]
• Delay guarantee versus throughput in broadcast fading channelsMasoud Sharif, Babak Hassibi. 248 [doi]
• Information bounds and asymptotically optimal procedures for detecting changes in decentralized decision systemsYajun Mei. 249 [doi]
• A simple method to reach detection consensus in massively distributed sensor networksYao-Wing Hong, Lih Feng Cheow, Anna Scaglione. 250 [doi]
• Classification in sensor networksVenkatesh Saligrama, Murat Alanyali, Onur Savas, Shuchin Aeron. 251 [doi]
• Adaptive signaling schemes for detection in wireless sensor networksJean-François Chamberland, Venugopal V. Veeravalli. 252 [doi]
• Vandermonde-cocyclic codes and a suitable DFTKiran T. Gowda, B. Sundar Rajan. 253 [doi]
• Consta-dihedral codes and their transform domain characterizationVummintala Shashidhar, B. Sundar Rajan. 254 [doi]
• Single user tracing superimposed codesMiklós Csürös, Miklós Ruszinkó. 255 [doi]
• Partition codesArkadii G. D'yachkov, Vyacheslav V. Rykov, David C. Torney, Sergey Yekhanin. 256 [doi]
• New results and applications of superimposed codes (and related combinatorial structures) to the design of efficient group testing proceduresAnnalisa De Bonis, Ugo Vaccaro. 257 [doi]
• Limited-trial chase-like bounded-distance decodingJos H. Weber, Marc P. C. Fossorier. 258 [doi]
• Soft-decision decoding of linear block codes using preprocessingYingquan Wu, Ralf Koetter, Christoforos N. Hadjicostis. 259 [doi]
• Sparse factor graph representations of Reed-Solomon and related codesJonathan S. Yedidia. 260 [doi]
• Iterative soft decision decoding of Reed Solomon codes based on adaptive parity check matricesJing Jiang 0010, Krishna R. Narayanan. 261 [doi]
• On the dynamics of continuous-time analog iterative decodingSaied Hemati, Amir H. Banihashemi. 262 [doi]
• Coded optimal partial response signalingFredrik Rusek, John B. Anderson. 263 [doi]
• An analysis on optimal rates of BDB encoders for RLL and MTR systemsPanu Chaichanavong. 264 [doi]
• Average transition density constraints for mitigating transition noise in magnetic recordingRoy D. Cideciyan, Thomas Mittelholzer. 265 [doi]
• On the data-processing inequality in the mismatch caseDieter-Michael Arnold. 266 [doi]
• On near-capacity coding systems for partial-response channelsJoseph B. Soriaga, Paul H. Siegel. 267 [doi]
• Diversity and multiplexing tradeoff bounds for cooperative diversity protocolsNarayan Prasad, Mahesh K. Varanasi. 268 [doi]
• Forwarding strategies for Gaussian parallel-relay networksIvana Maric, Roy D. Yates. 269 [doi]
• The outage behavior of coded cooperationTodd E. Hunter, Shahab Sanayei, Aria Nosratinia. 270 [doi]
• Capacity of ad-hoc networks with node cooperationNihar Jindal, Urbashi Mitra, Andrea Goldsmith. 271 [doi]
• On the achievable rate for receiver cooperation in ad-hoc networksAnders Høst-Madsen. 272 [doi]
• 2) and companion matrix based decodingVidya Kumar, Olgica Milenkovic, Bane Vasic. 273 [doi]
• On regular quasicyclic LDPC codes from binomialsRoxana Smarandache, Pascal O. Vontobel. 274 [doi]
• Low-density parity-check codes with rates very close to the capacity of the q-ary symmetric channel for large qAmin Shokrollahi, Wei Wang. 275 [doi]
• An efficient encoding method for LDPC codes based on cyclic shiftHachiro Fujita, Kohichi Sakaniwa. 276 [doi]
• Low-density parity-check codes with fast decoding convergence speedXudong Ma, En-Hui Yang. 277 [doi]
• Spectral efficiency of joint multiple cell-site processors for randomly spread DS-CDMA systemsOren Somekh, Benjamin M. Zaidel, Shlomo Shamai. 278 [doi]
• Multiple access and time division: a new lookYalin Evren Sagduyu, Anthony Ephremides. 279 [doi]
• An approach to capacity analysis of coarsely coordinated low power multiple access systemsTarik Muharemovic, Ashutosh Sabharwal, Behnaam Aazhang. 280 [doi]
• Window decoding for the multiaccess channel with generalized feedbackJ. Nicholas Laneman, Gerhard Kramer. 281 [doi]
• Asymptotic spectral efficiency of spatially correlated MIMO multiple-access channels with arbitrary signaling inputs for joint and separate decodingChao-Kai Wen, Kai-Kit Wong. 282 [doi]
• Exponential diversity achieving spatio-temporal power allocation scheme for MIMO fading channelsPremkumar Karumbu, Arun Rangarajan, Vinod Sharma. 283 [doi]
• Space-time precoding with mean and covariance feedback: implications for wideband systemsGwen Barriac, Upamanyu Madhow. 284 [doi]
• Progressive union bound of space-time block codes and its saddlepoint approximationMadhavan Vajapeyam, Jifeng Geng, Urbashi Mitra. 285 [doi]
• A complete family of good quasiorthogonal STBC and a new family of orthogonal STBC for four transmit antennasYinggang Du, Kam Tai Chan. 286 [doi]
• Selection diversity in multiple antenna systems with matrix modulationPirjo Pasanen, Olav Tirkkonen. 287 [doi]
• High-SNR power offset in multiantenna communicationAngel Lozano, Antonia Maria Tulino, Sergio Verdú. 288 [doi]
• Optical MIMO transmission with multipulse PPMStephen G. Wilson, Maïté Brandt-Pearce, Michael Baedke, Qianling Cao. 289 [doi]
• Asymptotic capacity of beamforming with limited feedbackWiroonsak Santipach, Michael L. Honig. 290 [doi]
• How good is an isotropic gaussian input on a MIMO Ricean channel?Daniel Hösli, Amos Lapidoth. 291 [doi]
• A scalable architecture of a structured LDPC decoderJason Kwok-San Lee, Benjamin Lee, Jeremy Thorpe, Kenneth S. Andrews, Sam Dolinar, Jon Hamkins. 292 [doi]
• Density evolution analysis of device mismatch in analog decodersChris Winstead, Christian Schlegel. 293 [doi]
• Analysis of reliability-based incremental redundancy with convolutional codesEugene Visotsky, Yakun Sun, Michael L. Honig, Vinayak Tripathi. 294 [doi]
• A repeat request strategy based on sliding window decoding of convolutional codesJürgen Freudenberger, Martin Bossert, Sergo Shavgulidze. 295 [doi]
• An analog turbo decoder for the UMTS standardAlexandre Graell i Amat, Guido Montorsi, Sergio Benedetto, Daniele Vogrig, Andrea Neviani, Andrea Gerosa. 296 [doi]
• Estimating the optimal support and the rate of convergence to the Panter-Dite formula for a Laplacian sourceVictoria Yee, David L. Neuhoff. 297 [doi]
• Rapid near-optimal VQ design with a deterministic data netMichelle Effros, Leonard J. Schulman. 298 [doi]
• Near rate-distortion bound performance of sparse matrix codesTatsuto Murayama. 299 [doi]
• Lagrangian global optimization of two-description scalar quantizersSorina Dumitrescu, Xiaolin Wu 0001. 300 [doi]
• Improved convergence rates in empirical vector quantizer designAndrás Antos, László Györfi, András György. 301 [doi]
• Using universal coding approach to randomness testingBoris Ryabko, V. A. Monarev, Yu. I. Shokin. 302 [doi]
• Complexity-regularized multiresolution density estimationRebecca M. Willett, Robert D. Nowak. 303 [doi]
• Blind quality estimation for corrupted source signals based on a-posteriori probabilitiesRagnar Thobaben, Ingmar Land. 304 [doi]
• Asymptotic optimality of finite-memory detectionGianLuigi Ferrari, Giulio Colavolpe, Riccardo Raheli. 305 [doi]
• Algorithms for modeling distributions over large alphabetsAlon Orlitsky, Sajama, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang. 306 [doi]
• Closed form designs of complex orthogonal space-time block codes of rates (k+1)/(2k) for 2k-1 or 2k transmit antennasKejie Lu, Shengli Fu, Xiang-Gen Xia. 307 [doi]
• The golden code: a 2 x 2 full-rate space-time code with non-vanishing determinantsJean-Claude Belfiore, Ghaya Rekaya, Emanuele Viterbo. 308 [doi]
• Construction of quasi orthogonal STBC with minimum decoding complexityChau Yuen, Yong Liang Guan, Tjeng Thiang Tjhung. 309 [doi]
• Construction and analysis of a new 4 x 4 orthogonal space-time block codeA. Robert Calderbank, Suhas N. Diggavi, Sushanta Das, Naofal Al-Dhahir. 310 [doi]
• On the free distance of LDPC convolutional codesArvind Sridharan, Dmitri V. Truhachev, Michael Lentmaier, Daniel J. Costello Jr., Kamil Sh. Zigangirov. 311 [doi]
• A new upper bound on the minimum distance of turbo codesAlberto Perotti, Sergio Benedetto. 313 [doi]
• An upper bound on the minimum distance of serially concatenated convolutional codesAlberto Perotti, Sergio Benedetto. 314 [doi]
• On the effect of channel estimation error with superimposed training upon information ratesAzadeh Vosoughi, Anna Scaglione. 315 [doi]
• Temporally correlated flat-fading channels with imperfect receiver CSI: a cutoff rate analysisSaswat Misra, Ananthram Swami, Lang Tong. 316 [doi]
• Performance analysis of optimum multiuser detector under phase mismatchToshiyuki Tanaka. 317 [doi]
• The effect of CSI imperfection on the performance of SVD based adaptive modulation in MIMO systemsZhendong Zhou, Branka Vucetic. 318 [doi]
• Coding performance of various type-I HARQ schemes with BICMJung-Fu Cheng. 319 [doi]
• On the scalability of H-ARQ systems in wireless multicastStefania Sesia, Giuseppe Caire, Guillaume Vivier. 320 [doi]
• Matching air-interface with backbone: end-to-end resource allocation in hybrid networksMung Chiang. 321 [doi]
• Minimum distance bounds of irregular QC-LDPC codes and their applicationsMin-Ho Shin, Joon-Sung Kim, Hong-Yeop Song. 321 [doi]
• Quantum pseudo-telepathy and the kochen-specker theoremRenato Renner, Stefan Wolf 0001. 322 [doi]
• Universal distortion-free entanglement concentrationKeiji Matsumoto, Masahito Hayashi. 323 [doi]
• Information capacity of bosonic channelsVittorio Giovannetti, S. Guha, S. Lloyd, Lorenzo Maccone, Jeffrey H. Shapiro, Brent J. Yen, Horace P. Yuen. 324 [doi]
• On feedback and the classical capacity of a noisy quantum channelGarry Bowen, Rajagopal Nagarajan. 325 [doi]
• On polylogarithmic decoding complexity for reed-muller codesIlya Dumer. 326 [doi]
• Probabilistic decoding of interleaved RS-codes on the q-ary symmetric channelAndrew Brown 0003, Lorenz Minder, Amin Shokrollahi. 327 [doi]
• On the performance of integrated interleaving coding schemesXiangyu Tang, Ralf Koetter. 328 [doi]
• Decoding of concatenated codes with interleaved outer codesJørn Justesen, Christian Thommesen, Tom Høholdt. 329 [doi]
• Approaching the slepian-wolf boundary using practical channel codesJavier Garcia-Frias, Felipe Cabarcas. 330 [doi]
• Lossy source coding under a maximum distortion constraint with decoder side-informationJayanth Nayak, Ertem Tuncel, Kenneth Rose. 331 [doi]
• A new source-splitting approach to the slepian-wolf problemTodd P. Coleman, Anna H. Lee, Muriel Médard, Michelle Effros. 332 [doi]
• Layered priority encoded transmission for video streaming to heterogeneous clientsRamaprabhu Janakiraman, Lihao Xu. 333 [doi]
• Extended carrier-hopping prime codes for optical and wireless CDMA systemsWing C. Kwong, Guu-chang Yang, Cheng-Yuan Chang. 334 [doi]
• Space diversity for the multimode optical fiber channelZhijun Zhao, Richard E. Blahut. 335 [doi]
• Multipulse PPM on memoryless channelsJon Hamkins, Bruce E. Moision. 336 [doi]
• Capacity of the generalized PPM channelJon Hamkins, Matthew Klimesh, Robert J. McEliece, Bruce E. Moision. 337 [doi]
• Four antenna space-time lattice constellations from division algebrasJarkko Hiltunen, Camilla Hollanti, Jyrki Lahtonen. 338 [doi]
• Trace-orthonormal full diversity cyclotomic linear dispersion codesJian-Kang Zhang, Jing Liu, Kon Max Wong. 339 [doi]
• Designs and full-rank STBCs from DFT domain description of cyclic codesUdupi Sripati, Vummintala Shashidhar, B. Sundar Rajan. 340 [doi]
• Performance bounds for space-time block codes with antenna selectionXiang Nian Zeng, Ali Ghrayeb. 341 [doi]
• Filling-in some of the decoding gap between belief propagation (BP) and maximum a posteriori (MAP) for convolutional codesPeter C. Massey. 342 [doi]
• Belief-propagation with information correction: improved near maximum-likelihood decoding of low-density parity-check codesNedeljko Varnica, Marc P. C. Fossorier. 343 [doi]
• On APP-decoding using BEASTIrina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov, Maja Loncar. 344 [doi]
• Soft-input soft-output decoding algorithm of linear block codes based on minimum distance searchJun Asatani, Takuya Koumoto, Toru Fujiwara, Tadao Kasami. 345 [doi]
• Simple tight bounds on capacity for the peak-limited discrete-time channelAndrew L. McKellips. 346 [doi]
• Mutual information and MMSE in gaussian channelsDongning Guo, Shlomo Shamai, Sergio Verdú. 347 [doi]
• On the discreteness of the capacity-achieving probability measure of conditional gaussian channelsTerence H. Chan, Frank R. Kschischang. 348 [doi]
• Markov processes asymptotically achieve the capacity of finite-state intersymbol interference channelsJiangxin Chen, Paul H. Siegel. 349 [doi]
• Asymptotically optimal power allocation with MMSE receiversWeimin Xiao. 350 [doi]
• Distributed power and admission control for time-varying wireless networksTim Holliday, Andrea Goldsmith, Nick Bambos, Peter W. Glynn. 351 [doi]
• A semi-algebraic approach to multiuser beamforming and power controlHolger Boche, Martin Schubert. 352 [doi]
• Capacity region of power controlled fading CDMA: transmit strategies and convexity issuesOnur Kaya, Sennur Ulukus. 353 [doi]
• Remarks on Clifford codesAndreas Klappenecker, Martin Rötteler. 354 [doi]
• On quantum MDS codesMartin Rötteler, Markus Grassl, Thomas Beth. 355 [doi]
• Universal non-destructive estimation of quantum relative entropyAlexei Kaltchenko. 356 [doi]
• Entropy measures and catalysis of bipartite quantum state transformationsMatthew Klimesh. 357 [doi]
• On the maximal rate of square quasi-orthogonal designsMd. Zafar Ali Khan, B. Sundar Rajan. 358 [doi]
• Generalization and applications of McEliece's theoremOscar Moreno, Francis N. Castro. 359 [doi]
• Association schemes and metrics on a finite groupVladimir Sidelnikov. 360 [doi]
• A system of polynomials for the complex hamming spacesVladimir I. Levenshtein. 361 [doi]
• On successive refinement for the Wyner-Ziv problemYossef Steinberg, Neri Merhav. 362 [doi]
• On hierarchical joint source-channel codingYossef Steinberg, Neri Merhav. 363 [doi]
• Progressive coding of information with progressively coded side informationJia Wang, Jun Sun. 364 [doi]
• Communication and distributional complexity of joint probability mass functionsSidharth Jaggi, Michelle Effros. 365 [doi]
• Optimal optical orthogonal codes with lambda > 1Reza Omrani, Oscar Moreno, P. Vijay Kumar. 366 [doi]
• Multiple-wavelength optical orthogonal codes under prime-sequence permutationsGuu-chang Yang, Wing C. Kwong, Cheng-Yuan Chang. 367 [doi]
• Frequency hopping sequences with optimal partial autocorrelation propertyYu-Chang Eun, Seok-Yong Jin, Yun-Pyo Hong, Hong-Yeop Song. 368 [doi]
• Scaling laws in random heterogeneous networksAlex Reznik, Sanjeev R. Kulkarni, Sergio Verdú. 369 [doi]
• The transport capacity of wireless networks over fading channelsFeng Xue, Liang-Liang Xie, P. R. Kumar. 370 [doi]
• A lower bound to the scaling behavior of sensor networksMichael Gastpar, Martin Vetterli. 371 [doi]
• Information theoretic upper bounds on the capacity of large extended ad-hoc wireless networksOlivier Lévêque, I. Emre Telatar. 372 [doi]
• Designing good LDPC codes for markov-modulated channelsAndrew W. Eckford, Frank R. Kschischang, Subbarayan Pasupathy. 373 [doi]
• Decoding of linear codes with low-density generator matrix over finite-state binary markov channelsHanqing Lou, Javier Garcia-Frias. 374 [doi]
• Turbo-like codes for the block-fading channelAlbert Guillen i Fabregas, Giuseppe Caire. 375 [doi]
• Analysis of LDPC decoding for correlated and uncorrelated block fading channelsXiaowei Jin, Andrew W. Eckford, Thomas E. Fuja. 376 [doi]
• Efficient variable length channel coding for unknown DMCsStark C. Draper, Brendan J. Frey, Frank R. Kschischang. 377 [doi]
• The zero-error capacity of compound channelsJayanth Nayak, Kenneth Rose. 378 [doi]
• Optimal feedback schemes over unknown channelsAslan Tchamkerten, Emre Telatar. 379 [doi]
• Optimal pulses for ultra-wide band communication systems on gaussian and dense multi-path channelsBurak Berksoy, Nilesh Bhuvanendran, Lei Wei. 380 [doi]
• Noncoherent eigenbeamforming for a wideband cellular uplinkNoah Jacobsen, Gwen Barriac, Upamanyu Madhow. 381 [doi]
• Power spectra of UWB time-hopping modulated signals: a shot noise approachPierre Brémaud, Andrea Ridolfi. 382 [doi]
• Semicoherent PPM for wideband communicationsUlrich G. Schuster, Moritz Borgmann, Helmut Bölcskei. 383 [doi]
• Improved list decoding of generalized reed-solomon and alternant codes over ringsMarc Andre Armand. 384 [doi]
• Reduced complexity interpolation for soft-decoding of reed-solomon codesArshad Ahmed, Ralf Koetter, Naresh R. Shanbhag. 385 [doi]
• Polynomial matrix-chain interpolation in sudan-type reed-solomon decodersFarzad Parvaresh, Alexander Vardy. 386 [doi]
• Divide-and-conquer interpolation for list decoding of reed-solomon codesJun Ma 0006, Peter Trifonov, Alexander Vardy. 387 [doi]
• Bit loading algorithms for OFDMYaniv George, Ofer Amrani. 388 [doi]
• Generalized bounds on the crest-factor distribution of OFDM signals with applications to code designSimon Litsyn, Gerhard Wunder. 389 [doi]
• Unequal Error Protected Image Transmission over Multilevel coded Wavelet Packet Multicarrier Modulation SystemXinying Gao, Haixia Zhang, Dongfeng Yuan. 390 [doi]
• System capacity of wideband OFDM communications over fading channels without channel knowledgeDieter Schafhuber, Helmut Bölcskei, Gerald Matz. 391 [doi]
• Joint source-channel cooperation: diversity versus spectral efficiencyDeniz Gündüz, Elza Erkip. 392 [doi]
• Source-channel diversity approaches for multimedia communicationJ. Nicholas Laneman, Emin Martinian, Gregory W. Wornell. 393 [doi]
• Adaptive joint source/channel rate allocation policies for delay sensitive applications over fading channelsC. Thejaswi, Vinod Sharma. 394 [doi]
• On the performance of parallel concatenated joint source-channel coding with variable-length codesJörg Kliewer. 395 [doi]
• Cross-symbol codesRon M. Roth, Gadiel Seroussi. 396 [doi]
• Two-dimensional burst-correcting codesMoshe Schwartz 0001, Tuvi Etzion. 397 [doi]
• Fast decoding of rank-codes with rank errors and column erasuresGerd Richter, Simon Plass. 398 [doi]
• On the capacity of AWGN relay channels with linear relaying functionsSina Zahedi, Mehdi Mohseni, Abbas El Gamal. 399 [doi]
• Diversity gains and clustering in wireless relayingMelda Yuksel, Elza Erkip. 400 [doi]
• On the capacity of wireless erasure networksRadhika Gowaikar, Amir F. Dana, Ravi Palanki, Babak Hassibi, Michelle Effros. 401 [doi]
• On energy efficiency of relay transmissionsYingwei Yao, Xiaodong Cai, Georgios B. Giannakis. 402 [doi]
• The impact of relaying on the capacity of broadcast channelsYingbin Liang, Venugopal V. Veeravalli. 403 [doi]
• Finite length serial concatenation of SPC codes with conv. codesLei Wei. 404 [doi]
• Codes with good slope for serially concatenated trellis coded modulationBernd Baumgartner, Axel Hof, Martin Bossert. 405 [doi]
• A new look at the error-correcting capabilities of convolutional codesSabine Ertl, Rolf Johannesson, Victor A. Pavlushkov. 406 [doi]
• Design of turbo codes using high rate nonsystematic convolutional encodersFrancesca Vatta, Bartolo Scanavino, Adrish Banerjee, Daniel J. Costello Jr.. 407 [doi]
• Optimal constructions of space-time codes over multiple fading blocksHsiao-feng Francis Lu, P. Vijay Kumar. 408 [doi]
• Partitioning techniques for design of multilevel codes for Rayleigh fading channelsSiddhartha Mallik, Ralf Koetter. 409 [doi]
• Bounds on the performance of rotated lattice constellationsEva Bayer-Flückiger, Frédérique E. Oggier, Emanuele Viterbo. 410 [doi]
• Closed form capacity expressions for space time block codes over fading channelsHao Zhang, T. Aaron Gulliver. 411 [doi]
• Diversity order analysis of training codes for MIMO block fading channelsPranav Dayal, Shivratna Giri Srinivasan, Mahesh K. Varanasi. 412 [doi]
• Near-optimal signaling for wideband-fading channelsXinzhou Wu, R. Srikant. 413 [doi]
• Benefits of correlated MIMO schemes for wideband communicationWenyi Zhang, J. Nicholas Laneman. 414 [doi]
• The capacity of spread-spectrum Rayleigh fading channels in the presence of channel uncertaintyRichard J. Barton. 415 [doi]
• Channel coherence in the low SNR regimeLizhong Zheng, David N. C. Tse, Muriel Médard. 416 [doi]
• The Gaussian interference channel at low SNRChaitanya Rao, Babak Hassibi. 417 [doi]
• Adaptive and iterative soft-decision list decodingFeng Cai, Marc Andre Armand, Mehul Motani. 418 [doi]
• List decoding of concatenated codes: improved performance estimatesAlexander Barg, Andrew McGregor 0001. 419 [doi]
• Exponential error bounds for algebraic soft-decision decoding of Reed Solomon codesNiranjan Ratnakar, Ralf Koetter. 420 [doi]
• Performance enhancements for algebraic soft decision decoding of Reed-Solomon codesMostafa El-Khamy, Robert J. McEliece, Jonathan Harel. 421 [doi]
• On signals with very high peak-to-average power ratioGregory Freiman, Simon Litsyn, Alexander A. Yudin. 422 [doi]
• On the PAPR of binary Reed-Muller OFDM codesKaustuvmani Manji, B. Sundar Rajan. 423 [doi]
• Combined block coded modulation and peak-to-average power ratio reduction in OFDM systemsHoushou Chen, Hsinying Liang, Mao-Ching Chiu. 424 [doi]
• ICI self cancellation - Golay complementary Reed-Muller code scheme for OFDM systemsJae-Hyun Park, Jae-Yup Lee, Sang-Won Lee, Song-Nam Hong, Dong-Joon Shin. 425 [doi]
• Crest-factor analysis of carrier interferometry MC-CDMA and OFDM systemsGerhard Wunder, Kenneth G. Paterson. 426 [doi]
• Robust predictive quantization: a new analysis and optimization frameworkAlyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal, Kannan Ramchandran. 427 [doi]
• Frog-in-the-box index codes with maximum likelihood decoding for robust scalar quantizationIlju Na, David L. Neuhoff. 428 [doi]
• Cell density functions and effective channel code rates for quantizers with uniform decoders and channel optimized encodersBenjamin Farber, Kenneth Zeger. 429 [doi]
• First-order multiplexed source codes for error-resilient entropy codingHervé Jégou, Christine Guillemot. 430 [doi]
• Source coding using a class of universal hash functionsHiroki Koga. 431 [doi]
• Sum capacity of binary signatures that minimize the total squared correlationFrederik Vanhaverbeke, Marc Moeneclaey. 432 [doi]
• Isometric multisignature multiuser MC-CDMA in frequency-selective fadingMatthew J. M. Peacock, Iain B. Collings, Michael L. Honig. 433 [doi]
• An asymptotic analysis of band-limited DS/SSMA systemsYeon Kyoon Jeong, Joon Ho Cho, James S. Lehnert. 434 [doi]
• A max-min fair approach to optimize the CDMA capacity regionAteet Kapur, Mahesh K. Varanasi. 435 [doi]
• Blind bandwidth-efficient schemes for CDMA on dispersive MIMO channelsEmanuele Grossi, Marco Lops, Luca Venturino. 436 [doi]
• Throughput scaling in wireless networks with restricted mobilityAurelie C. Lozano, Sanjeev R. Kulkarni, Pramod Viswanath. 437 [doi]
• Closing the gap in the capacity of random wireless networksMassimo Franceschetti, Olivier Dousse, David N. C. Tse, Patrick Thiran. 438 [doi]
• Throughput-delay trade-off in energy constrained wireless networksAbbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah. 439 [doi]
• Throughput and delay in random wireless networks: 1-D mobility is just as good as 2-DJames P. Mammen, Devavrat Shah. 440 [doi]
• EXIT functions for binary memoryless symmetric channelsEran Sharon, Alexei Ashikhmin, Simon Litsyn. 441 [doi]
• Turbo codes and Shannon's condition for reliable communicationMichael Lentmaier, Dmitri V. Truhachev, Kamil Sh. Zigangirov, Daniel J. Costello Jr.. 442 [doi]
• Bounds on information combining for the accumulator of repeat-accumulate codes without Gaussian assumptionIngmar Land, Peter A. Hoeher, Jossy Sayir. 443 [doi]
• Non-gaussian behaviour of extrinsic log-valuesNicholas Letzepis, Alex J. Grant. 444 [doi]
• On the reliability exponent of the geometric server timing channelGuy Nakibly, Shraga I. Bross. 445 [doi]
• Error exponent region for Gaussian multiple access channelsLihua Weng, Achilleas Anastasopoulos, S. Sandeep Pradhan. 446 [doi]
• Feedback, queueing, and the reliability of the ideal Poisson channel above capacityAaron B. Wagner, Venkat Anantharam. 447 [doi]
• On the random coding error exponents of the single-user and the multiple-access Gel'fand-Pinsker channelsAnelia Somekh-Baruch, Neri Merhav. 448 [doi]
• Unequal error protection using low-density parity-check codesNazanin Rahnavard, Faramarz Fekri. 449 [doi]
• Optimization of LDPC codes for UEP channelsCharly Poulliat, David Declercq, Inbar Fijalkow. 450 [doi]
• Reconstruction of permutations distorted by single reversal errorsElena V. Konstantinova. 451 [doi]
• On unequal error protection for information symbols via active distancesVictor A. Pavlushkov, Rolf Johannesson, Victor V. Zyablov. 452 [doi]
• Quasiperfect codes with small distanceTuvi Etzion, Beniamin Mounits. 453 [doi]
• New good linear codes by special puncturingsBeniamin Grassl, Greg White. 454 [doi]
• Nonintersecting subspaces based on finite alphabetsFrédérique E. Oggier, Neil J. A. Sloane, Suhas N. Diggavi, A. Robert Calderbank. 455 [doi]
• Linear codes with complementary duals meet the Gilbert-Varshamov boundNicolas Sendrier. 456 [doi]
• Convolutional codes with cyclic structureHeide Gluesing-Luerssen, Barbara Langfeld, Wiland Schmale. 457 [doi]
• On convolutional codes and sphere packing boundsEirik Rosnes, Øyvind Ytrehus. 458 [doi]
• Blind recognition of punctured convolutional codesPeizhong Lu, Li Shen, Xiangyang Luo, Yan Zou. 459 [doi]
• Analysis of convolutional codes on the erasure channelBrian M. Kurkoski, Paul H. Siegel, Jack K. Wolf. 460 [doi]
• Minimum description length vs. maximum likelihood in lossy data compressionMokshay Madiman, Matthew T. Harrison, Ioannis Kontoyiannis. 461 [doi]
• Coding unstable scalar Markov processes into two streamsAnant Sahai. 462 [doi]
• Efficient algorithms and minimax bounds for zero-delay lossy source codingAndrás György, Tamás Linder, Gábor Lugosi. 463 [doi]
• The empirical distribution of rate-constrained source codesTsachy Weissman, Erik Ordentlich. 464 [doi]
• Consistency in a model for distributed learning with specialistsJoel B. Predd, Sanjeev R. Kulkarni, H. Vincent Poor. 465 [doi]
• Entropic graphs for intrinsic dimension estimation in manifold learningJose A. Costa, Alfred O. Hero III. 466 [doi]
• Adaptive regression estimation with multilayer feedforward neural networksMichael Kohler, Adam Krzyzak. 467 [doi]
• PAC learning for Markov decision processes and dynamic gamesRahul Jain 0002, Pravin Varaiya. 468 [doi]
• Capacity scaling in wireless ad-hoc networks with P/sub e/Shuchin Aeron, Venkatesh Saligrama. 469 [doi]
• Power bandwidth trade-off for sensory and ad-hoc wireless networksAmir F. Dana, Babak Hassibi. 470 [doi]
• Scaling laws for correlated data gatheringRazvan Cristescu, Baltasar Beferull-Lozano, Martin Vetterli. 471 [doi]
• The effect of interference on the capacity of multihop wireless networksMurali S. Kodialam, Thyaga Nandagopal. 472 [doi]
• Estimating LDPC codeword error rates via importance samplingBo Xia, William E. Ryan. 473 [doi]
• A simple method of approximating the error floor of turbo codes with S-type permutorsAxel Huebner, Daniel J. Costello Jr.. 474 [doi]
• Approximate algorithms for computing the minimum distance of low-density parity-check codesXiao-Yu Hu, Marc P. C. Fossorier, Evangelos Eleftheriou. 475 [doi]
• Tight bounds for LDPC codes under MAP decodingAndrea Montanari. 476 [doi]
• On the computation of the joint source-channel error exponent for memoryless systemYangfan Zhong, Fady Alajaji, L. Lorne Campbell. 477 [doi]
• Error exponents for channel coding and signal constellation designJianyi Huang, Sean P. Meyn, Muriel Médard. 478 [doi]
• Statistical mechanical evaluation of error exponents for lossy data compressionTadaaki Hosaka, Yoshiyuki Kabashima. 479 [doi]
• Achievable rates and decoding error probability for parallel channels with dependent noise and restricted number of active usersVladimir B. Balakirsky, A. J. Han Vinck. 480 [doi]
• Probability of undetected error for a class of unidirectional error detecting codesTorleiv Kløve, Paul Oprisan, Bella Bose. 481 [doi]
• On two upper bounds on the size of t-EC-AUED codesBella Bose, Torleiv Kløve. 482 [doi]
• Low complexity code design for the 2-user Gaussian multiple access channelAline Roumy, David Declercq, Eric Fabre. 483 [doi]
• Distributed decoding in a cellular multiple-access channelEmre Aktas, Jamie S. Evans, Stephen V. Hanly. 484 [doi]
• Weight enumerators of duadic and quadratic residue codesPhilippe Gaborit, Carmen-Simona Nedeloaia, Alfred Wassermann. 485 [doi]
• Bounds on distance distributions in codes of known sizeAlexei Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn. 486 [doi]
• Bounds on codes derived by counting components in Varshamov graphsKatie O'Brien, Patrick Fitzpatrick. 487 [doi]
• A mass formula for /spl Zopf//sub 4/ cyclic codes of length 2/sup e/Taher Abualrub, Ali Ghrayeb, Robert H. Oehmke. 488 [doi]
• Reduced-complexity iterative decoding using a variable-size trellis structureDhammika Bokolamulla, Tor M. Aulin. 489 [doi]
• Reduced complexity decoding strategies for LDPC convolutional codesAli Emre Pusane, Michael Lentmaier, Kamil Sh. Zigangirov, Daniel J. Costello Jr.. 490 [doi]
• A Simple parallel dual code decoding algorithm for convolutional codes with high throughput and low latencyYu Liao, John C. Kieffer. 491 [doi]
• Forward-only iterative decoding of convolutional self-orthogonal codesDavid Haccoun, Yu-Cheng He, Christian Cardinal. 492 [doi]
• Error-rate dependence of nonbandlimited signals with finite rate of innovationIvana Jovanovic, Baltasar Beferull-Lozano. 493 [doi]
• Optimal quantization in neural codingMark D. McDonnell, Derek Abbott. 494 [doi]
• Performance of low rate entropy-constrained scalar quantizersDaniel Marco, David L. Neuhoff. 495 [doi]
• Good trellis source codes at fractional ratesTomas Eriksson, John B. Anderson, Mirek Novak. 496 [doi]
• Hyper-bent functions and cyclic codesClaude Carlet, Pascale Gaborit. 497 [doi]
• New p-ary bent sequencesYoung-Sik Kim, Ji-Woong Jang, Jong-Seon No. 498 [doi]
• Cubic Boolean functions with highest resiliencyClaude Carlet, Philippe Charpin. 499 [doi]
• On some properties of symmetric Boolean functionsMarion Videau. 500 [doi]
• A study of low-complexity and low-latency MIMO detectorsChristoph Windpassinger, Lutz H.-J. Lampe, Robert F. H. Fischer, Thorsten Hehn. 501 [doi]
• Optimal estimator-detector receivers for space-time block codingOlivier Roy, Sylvie Perreau, Alex J. Grant. 502 [doi]
• On estimating the symbol APP in MIMO systemsAdriel P. Kind, Alex J. Grant. 503 [doi]
• Asymptotically tight bound on SER of MIMO zero-forcing receivers with correlated fadingMario Kießling, Joachim Speidel. 504 [doi]
• Accumulate repeat accumulate codesAliazam Abbasfar, Dariush Divsalar, Kung Yao. 505 [doi]
• Low-density mirror-concatenated codes: a generalization of irregular repeat-and- accumulate codesSam Dolinar, Kenneth S. Andrews. 506 [doi]
• Variable-rate turbo bit-interleaved coded modulationJianghong Luo, Ruoheng Liu, Predrag Spasojevic. 507 [doi]
• Enhancement of turbo codes using cyclic redundancy check with interleaver optimisationAndrew John Rogers, Martin Tomlinson, Marcel Adrian Ambroze, Mohammed Zaki Ahmed. 508 [doi]
• Asymptotic design and analysis of linear detectors for CDMA systemsLaura Cottatellucci, Ralf R. Müller, Mérouane Debbah. 509 [doi]
• The cross-entropy method for blind multiuser detectionZaifei Liu, Arnaud Doucet, Sumeetpal S. Singh. 510 [doi]
• Differential bandwidth and equivalent bandwidth for overloaded multiuser communicationsJoon Ho Cho. 511 [doi]
• On sequence design for a synchronous CDMA channelRajesh Sundaresan. 512 [doi]
• Serially concatenated continuous phase modulation with ring convolutional codesMing Xiao, Tor M. Aulin. 513 [doi]
• Binary shaping for low-duty-cycle communicationsRichard J. Barron. 514 [doi]
• Embedded turbo coding in pattern position modulation for ultra wideband radio systemsChunyu Bi, Joseph Y. Hui, Lars Bodenheimer, Holger Spielberg. 515 [doi]
• Design of woven coded CPFSK via hierarchical code structureStefan Kempf, Sergo Shavgulidze, Martin Bossert. 516 [doi]
• Virtual radar approach to event localization in sensor networksBharath Ananthasubramaniam, Upamanyu Madhow. 517 [doi]
• On diffusive source localization using dumb sensorsSaravanan Vijayakumaran, Yoav Levinbook, Tan F. Wong. 518 [doi]
• Adaptive sampling for wireless sensor networksRebecca M. Willett, Aline Martin, Robert D. Nowak. 519 [doi]
• Decentralized estimation in an inhomogeneous environmentZhi-Quan Luo, Jin-Jun Xiao. 520 [doi]
• On the thinnest coverings of ellipsoidsIlya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov. 521 [doi]
• Statistical approach to ML decoding of linear block codes on symmetric channelsHaris Vikalo, Babak Hassibi. 522 [doi]
• Miscorrection probability beyond the minimum distanceYuval Cassuto, Jehoshua Bruck. 523 [doi]
• Minimum basis search algorithm for nearly maximum likelihood decoding of block codesMichael Ben-Yishai, Jakov Snyders. 524 [doi]
• A generalization of MDS codesYuan Luo, Fang-Wei Fu, Chaichana Mitrpant, A. J. Han Vinck. 525 [doi]
• MDS self-dual codesJon-Lark Kim, Yoonjin Lee. 526 [doi]
• Matrix characterization of near-MDS codes over Z/sub m/ and Abelian groupsG. Viswanath, B. Sundar Rajan. 527 [doi]
• On q-ary Grey-Rankin bound and codes meeting this boundStefan M. Dodunekov, Tor Helleseth, Victor A. Zinoviev. 528 [doi]
• Improving the performance of linear parallel interference cancellation for CDMA using a method of the statistical mechanicsAkira Shojiguchi, Toshiyuki Tanaka, Akira Mizutani, Takumi Mizuno, Masato Okada. 530 [doi]
• Application of maximal ratio combining for iterative multiuser decodingTao Lin, Lars K. Rasmussen. 531 [doi]
• Multiuser detection based on reduced complexity probabilistic data associationPeng Hui Tan, Lars K. Rasmussen. 532 [doi]
• A close-to-capacity dirty paper coding schemeStephan ten Brink, Uri Erez. 533 [doi]
• Multiple user writing on dirty paperYoung-Han Kim 0001, Arak Sutivong, Styrmir Sigurjonsson. 534 [doi]
• Writing on many pieces of dirty paper at once: the binary caseAshish Khisti, Uri Erez, Gregory W. Wornell. 535 [doi]
• Random coding bound of information hiding E-capacityMariam E. Haroutunian, Smbat Tonoyan. 536 [doi]
• Product lattice codesAmir J. Salomon, Ofer Amrani. 537 [doi]
• Channel dependent tree pruning for the sphere decoderHarold Artés. 538 [doi]
• MMSE-GDFE lattice decoding for solving under-determined linear systems with integer unknownsMohamed Oussama Damen, Hesham El Gamal, Giuseppe Caire. 539 [doi]
• Derivation on bit error probability of coded QAM using integer codesHristo Kostadinov, Hiroyoshi Morita, Nikolai L. Manev. 540 [doi]
• The uniqueness of the capacity-achieving distribution over noncoherent flat-fading channelsMajid Fozunbal, Steven W. McLaughlin, Ronald W. Schafer. 541 [doi]
• Capacity of pilot-aided MIMO communication systemsHaidong Zhu, Rong-Rong Chen, Behrouz Farhang-Boroujeny. 542 [doi]
• Spectral efficiency of peak power limited Rician block-fading channelsMustafa Cenk Gursoy, H. Vincent Poor, Sergio Verdú. 543 [doi]
• Duality bounds on the cut-off rate with applications to Ricean fadingAmos Lapidoth, Natalia Miliou. 544 [doi]
• On the secondary constructions of resilient functionsClaude Carlet. 545 [doi]
• On the zeta functions of two towers of function fieldsKenneth W. Shum, Ian F. Blake, V. Kumar Murty. 546 [doi]
• Low-weight left-to-right binary signed-digit representation of N integersXiaoyu Ruan, Rajendra S. Katti. 547 [doi]
• On the vector decomposition problem for m-torsion points on an elliptic curveNegar Kiyavash, Iwan M. Duursma. 548 [doi]
• Arithmetic homophonic coding with dummy symbolsAndrey Fionov. 549 [doi]
• Rigid body target modeling for tracking and identificationLang Hong, Kefu Xue. 550 [doi]
• Detection and localization of an anomaly from noisy projectionsLionel Fillatre, Igor V. Nikiforov. 551 [doi]
• Joint multiple target tracking and classification in collaborative sensor networksTom Vercauteren, Dong Guo 0003, Xiaodong Wang. 552 [doi]
• Receiver design for rapidly time-varying channelsChristian Sgraja, Jürgen Lindner, S. Unnikrishna Pillai. 553 [doi]
• List sequence turbo decoding techniquesCarl Fredrik Leanderson, Carl-Erik W. Sundberg. 554 [doi]
• 8-PSK turbo equalization with the list-sequential (LISS) algorithmChristian Kuhn 0001, Joachim Hagenauer. 555 [doi]
• Waveform synthesis using list-decoding of codes over the real alphabetRavi-Kiran Gopalan, Oliver M. Collins. 556 [doi]
• Finding a list of best paths in a trellisGeorg Schmidt, Vladimir R. Sidorenko, Victor V. Zyablov, Martin Bossert. 557 [doi]
• Causal coding of individual sequences and the Lempel-Ziv differential entropyTamás Linder, Ram Zamir. 558 [doi]
• Memoryless individual sequencesAndrew B. Nobel. 559 [doi]
• Signal sampling and recovery under long-memory errorsM. Pawlak, U. Stadtmiiller. 560 [doi]
• Finite-state rate-distortion for individual sequencesDharmendra S. Modha, Daniela Pucci de Farias. 562 [doi]
• Applicability of the sample path method of ergodic processes to individual sequencesShigeaki Kuzuoka, Tomohiko Uyematsu. 562 [doi]
• Surflets: a sparse representation for multidimensional functions containing smooth discontinuitiesVenkat Chandrasekaran, Michael B. Wakin, Dror Baron, Richard G. Baraniuk. 563 [doi]
• Filter bank frame-expansion with erasures-a para-pseudo inverse based reconstructionRavi H. Motwani, Christine Guillemot. 564 [doi]
• Factorization of two-channel 2D paraunitary filter banks over fields of characteristic twoFarshid Delgosha, Faramarz Fekri. 565 [doi]