Table of Contents

• Finite-length scaling of irregular LDPC code ensemblesAbdelaziz Amraoui, Rüdiger L. Urbanke, Andrea Montanari. 6-10 [doi]
• BEAST decoding - asymptotic complexityIrina E. Bocharova, Boris D. Kudryashov, Rolf Johannesson. 11-15 [doi]
• Symbol-by-symbol detection of space-time coded continuous phase modulated signals over fast Rayleigh fading channelsDhammika Bokolamulla, Tor M. Aulin. 16-19 [doi]
• Rate-compatible path-pruned convolutional codes and their applications on channels with insertion, deletion and substitution errorsLing Cheng 0001, Hendrik C. Ferreira. 20-25 [doi]
• Duality between packings and coverings of the Hamming spaceGérard D. Cohen, Alexander Vardy. 26-28 [doi]
• Interference management via capacity-achieving codes for the deterministic broadcast channelTodd P. Coleman, Emin Martinian, Michelle Effros, Muriel Médard. 29-33 [doi]
• Fisher information matrix and hyperbolic geometrySueli I. R. Costa, Sandra A. Santos, João E. Strapasson. 34-36 [doi]
• Periodic Oppermann sequences for spread spectrum systemsGregory Cresp, Hans-Jürgen Zepernick, Hai Huyen Dam. 37-41 [doi]
• Steepest descent as message passingJustin Dauwels, Sascha Korl, Hans-Andrea Loeliger. 42-46 [doi]
• Bounds on the performance of sphere decoding of linear block codesMostafa El-Khamy, Haris Vikalo, Babak Hassibi. 47-51 [doi]
• Asymptotically optimum detection for large wireless networks with fadingRavi-Kiran Gopalan, Oliver M. Collins. 52-57 [doi]
• The multivariate merit factor of a Boolean functionT. Aaron Gulliver, Matthew G. Parker. 58-62 [doi]
• Bounds on signature coding for fast frequency hopping with asynchronous accessSándor Györi. 63-67 [doi]
• Maximum entropy and the Edgeworth expansionPeter Harremoës. 68-71 [doi]
• New monomial bent functions over the finite fields of odd characteristicTor Helleseth, Alexander Kholosha. 72-76 [doi]
• A finite-field transform domain construction of binary low-density parity-check codesRobin Horan, Cen Jung Tjhai, Martin Tomlinson, Marcel Ambroze, Mohammed Zaki Ahmed. 77-81 [doi]
• Correlation analysis of random number sequences based on pseudo random binary sequence generationDavid M. Horan, Richard A. Guinee. 82-85 [doi]
• Capacity of M-ary 2-D RLL constraints for optical recording channelsHua Hu, Duanyi Xu, Guosheng Qi. 86-89 [doi]
• Iterative list decodingJørn Justesen, Tom Høholdt, Johann Hjaltason. 90-93 [doi]
• A new method of the codeword reception of systematic codesVladimir A. Kazakov, Miguel Sánchez-Meraz. 94-97 [doi]
• Viterbi algorithm motives in turbo decodingMichael Kerner, Ofer Amrani. 98-102 [doi]
• On the capacity of erasure relay channel: multi-relay caseRamin Khalili, Kavé Salamatian. 103-107 [doi]
• A note on a decoding algorithm of codes on graphs with small loopsNaoto Kobayashi, Toshiyasu Matsushima, Shigeichi Hirasawa. 108-112 [doi]
• Computing the Levenshtein distance of a regular languageStavros Konstantinidis. 113-116 [doi]
• A simple element inverse jacket transform codingMoon Ho Lee, Kenneth Finlayson. 117-119 [doi]
• Generalized signature delegation algorithmChih-Yin Lin, Chen-Hwa Song. 120-122 [doi]
• A new trellis source encoding method and its application on joint source and channel codingZihuai Lin, Tor Aulin. 123-127 [doi]
• Filtering: the case for "noisier" dataBrian Lucena, Ioannis Kontoyiannis. 128-130 [doi]
• Soft-in soft-out Reed-Solomon decoding using critically subsampled filterbanksGeert Van Meerbergen, Marc Moonen, Hugo De Man. 131-136 [doi]
• Multiuser diversity in delay-limited cellular wideband systemsRalf R. Müller, Giuseppe Caire, Raymond Knopp. 137-141 [doi]
• A unif0ed framework for tree search decoding: rediscovering sequential decodingArul D. Murugan, Hesham El Gamal, Mohamed Oussama Damen, Giuseppe Caire. 142-146 [doi]
• Ergodic theorems for algorithmically random sequencesMasahiro Nakamura. 147-150 [doi]
• The mutual information constellationAnders Nilsson, Tor M. Aulin. 151-156 [doi]
• Explicit expression of the interval algorithm for random number generation based on number systemsYasutada Oohama. 157-161 [doi]
• Mutual information of non-coherent Rayleigh fading channels with Gaussian inputRasika R. Perera, Tony S. Pollock, Thushara D. Abhayapala. 162-165 [doi]
• Finite-length analysis of a capacity-achieving ensemble for the binary erasure channelHenry D. Pfister. 166-170 [doi]
• Theoretical analysis of a zero-redundancy estimator with a finite window for memoryless sourceMohammad M. Rashid, Tsutomu Kawabata. 171-175 [doi]
• Decoding of second order Reed-Muller codes with a large number of errorsBassem Sakkour. 176-178 [doi]
• On decoding product latticesAmir J. Salomon, Ofer Amrani. 179-182 [doi]
• Boneh-Shaw fingerprinting and soft decision decodingHans Georg Schaathun, Marcel Fernandez-Muñoz. 183-186 [doi]
• Interleaved Reed-Solomon codes in concatenated code designsGeorg Schmidt, Vladimir R. Sidorenko, Martin Bossert. 187-191 [doi]
• Achieving MIMO channel capacity using multirate layered space-time coding architecturesMathini Sellathurai, Tharmalingam Ratnarajah. 192-196 [doi]
• Design of non-systematic turbo codes for universal source controlled channel decodingGil I. Shamir, Kai Xie. 197-201 [doi]
• Bounds on the entropy of patterns of I.I.D. sequencesGil I. Shamir. 202-206 [doi]
• On polyalphabetic block codesVladimir Sidorenko, Georg Schmidt, Ernst M. Gabidulin, Martin Bossert, Valentin B. Afanassiev. 207-210 [doi]
• Complex M-spotty byte error control codesKazuyoshi Suzuki, Toshihiko Kashiyama, Eiji Fujiwara. 211-215 [doi]
• Analytic algorithmics, combinatorics, and information theoryWojciech Szpankowski. 216 [doi]
• Bayesian approach to a definition of random sequences with respect to parametric modelsHayato Takahashi. 217-220 [doi]
• Further results on mapping functionsAlberto Tarable, Sergio Benedetto. 221-225 [doi]
• Capacity loss in CDMA systems due to the constraint of scalabilityFrederik Vanhaverbeke, Marc Moeneclaey. 226-231 [doi]
• Universal estimation of information measuresSergio Verdú. 232 [doi]
• Universal similarityPaul M. B. Vitányi. 238-243 [doi]
• Stopping set analysis for Hamming codesJos H. Weber, Khaled A. S. Abdel-Ghaffar. 244-247 [doi]
• A construction of resilient functions with satisfying synthetical cryptographic criteriaYongzhuang Wei, Yu-pu Hu. 248-252 [doi]
• Serially concatenated continuous phase modulation with low density generator matrix codes: property, optimization and performance analysisMing Xiao, Tor M. Aulin. 253-257 [doi]
• On performance bounds for serially concatenated codes with the general inner code and interleaverMing Xiao, Tor M. Aulin. 258-262 [doi]
• String parsing-based similarity detectionJia Yang, Ulrich Speidel. 263-267 [doi]
• Universal lossless data embedding without explicit compressionHidetoshi Yokoo. 268-272 [doi]
• Construction of LDPC codes for AWGN and binary erasure channels based on finite fieldsLingqi Zeng, Lan Lan, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar. 273-276 [doi]
• Estimation and decoding strategies for channels with abruptly changing statisticsWufei Zhang, Christian Koller, Andrew W. Eckford, Daniel J. Costello Jr., Thomas E. Fuja, Gil I. Shamir. 277 [doi]