2 | -- | 15 | Patrice Abry, Darryl Veitch. Wavelet Analysis of Long-Range-Dependent Traffic |
16 | -- | 31 | Vivek K. Goyal, Martin Vetterli, Nguyen T. Thao. Quantized Overcomplete Expansions in IR:::N:::: Analysis, Synthesis, and Algorithms |
32 | -- | 46 | Brett Ninness. Estimation of 1/f Noise |
47 | -- | 65 | En-Hui Yang, John C. Kieffer. On the Performance of Data Compression Algorithms Based Upon String Matching |
66 | -- | 78 | Yehuda Hershkovits, Jacob Ziv. On Sliding-Window Universal Data Compression with Limited Memory |
79 | -- | 94 | András Méhes, Kenneth Zeger. Binary Lattice Vector Quantization with Linear Block Codes and Affine Index Assignments |
95 | -- | 116 | Yuhong Yang, Andrew R. Barron. An Asymptotic Property of Model Selection Criteria |
117 | -- | 133 | Dharmendra S. Modha, Elias Masry. Memory-Universal Prediction of Stationary Random Processes |
134 | -- | 139 | Eric M. Rains. Shadow Bounds for Self-Dual Codes |
140 | -- | 161 | Andries E. Brouwer, Heikki O. Hämäläinen, Patric R. J. Östergård, Neil J. A. Sloane. Bounds on Mixed Binary/Ternary Codes |
162 | -- | 171 | Amir H. Banihashemi, Amir K. Khandani. On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis |
172 | -- | 180 | Kenneth G. Paterson. Binary Sequence Sets with Favorable Correlations from Difference Sets and MDS Codes |
181 | -- | 196 | Petra Heijnen, Ruud Pellikaan. Generalized Hamming Weights of q-ary Reed-Muller Codes |
197 | -- | 214 | Samuel J. MacMullan, Oliver M. Collins. The Capacity of Binary Channels that Use Linear Codes and Decoders |
215 | -- | 224 | Sivarama Venkatesan, Venkat Anantharam. The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels |
225 | -- | 240 | Rudolf Ahlswede, Imre Csiszár. Common Randomness in Information Theory and Cryptography - Part II: CR Capacity |
241 | -- | 255 | Thanh A. Diep. Capacity of Multilevel Threshold Devices |
256 | -- | 268 | Chuanyi Ji, Demetri Psaltis. Capacity of Two-Layer Feedforward Neural Networks with Binary Weights |
269 | -- | 273 | A. S. Holevo. The Capacity of the Quantum Channel with General Signal States |
273 | -- | 278 | Rüdiger L. Urbanke, Bixio Rimoldi. Lattice Codes Can Achieve Capacity on the AWGN Channel |
278 | -- | 284 | Vinay A. Vaishampayan, J.-C. Batllo. Asymptotic Analysis of Multiple Description Quantizers |
284 | -- | 290 | Sivarama Venkatesan, Venkat Anantharam. Identification Plus Transmission Over Channels with Perfect Feedbac |
290 | -- | 294 | Pascal Véron. Goppa Codes and Trace Operator |
294 | -- | 295 | Dejan E. Lazic, Hakam Kalouti, Thomas Beth. Spectra of Long Primitive Binary BCH Codes Cannot Approach the Binomial Distribution |
296 | -- | 303 | Rafail E. Krichevskiy. Laplace s Law of Succession and Universal Encoding |
304 | -- | 307 | Kyeongcheol Yang, Tor Helleseth. On the Weight Hierarchy of Goethals Codes over Z::4:: |
307 | -- | 311 | Oscar Moreno, Iwan M. Duursma, Jean-Pierre Cherdieu, A. Edouard. Cyclic Subcodes of Generalized Reed-Muller Codes |
311 | -- | 322 | Joe Fields, Philippe Gaborit, Jeffrey S. Leon, Vera Pless. All Self-Dual Z::4:: Codes of Length 15 or Less Are Known |
323 | -- | 328 | Stefka Buyuklieva, Iliya Boukliev. Extremal Self-Dual Codes with an Automorphism of Order 2 |
328 | -- | 333 | Fang-Wei Fu, A. J. Han Vinck, Shi-Yi Shen. On the Constructions of Constant-Weight Codes |
333 | -- | 334 | Vladimir D. Tonchev. Maximum Disjoint Bases and Constant-Weight Codes |
334 | -- | 340 | Shraga I. Bross, Ian F. Blake. Upper Bound for Uniquely Decodable Codes in a Binary Input N-User Adder Channel |
340 | -- | 345 | Khaled A. S. Abdel-Ghaffar, Hendrik C. Ferreira. Systematic Encoding of the Varshamov-Tenengol ts Codes and the Constantin-Rao Codes |
346 | -- | 351 | Adrian Escott, Stephanie Perkins. Binary Huffman Equivalent Codes with a Short Synchronizing Codeword |
351 | -- | 358 | Brian M. Sadler, Amod V. Dandawate. Nonparametric Estimation of the Cyclic Cross Spectrum |
358 | -- | 367 | H. S. Madhusudhana, M. U. Siddiqi. On Blahut s Decoding Algorithms for Two-Dimensional BCH Codes |
367 | -- | 378 | Anne Canteaut, Florent Chabaud. A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to McEliece s Cryptosystem and to Narrow-Sense BCH Codes of Length 511 |
379 | -- | 382 | Apostolos Dollas, William T. Rankin, David McCracken. A New Algorithm for Golomb Ruler Derivation and Proof of the 19 Mark Ruler |
382 | -- | 388 | Tuvi Etzion, Patric R. J. Östergård. Greedy and Heuristic Algorithms for Codes and Colorings |
388 | -- | 398 | Marc P. C. Fossorier, Shu Lin, Jakov Snyders. Reliability-Based Syndrome Decoding of Linear Block Codes |
398 | -- | 409 | L. E. Aguado, Patrick G. Farrell. On Hybrid Stack Decoding Algorithms for Block Codes |
410 | -- | 416 | Vladislav Sorokine, Frank R. Kschischang. A Sequential Decoder for Linear Block Codes with a Variable Bias-Term Metric |
416 | -- | 420 | Osnat Keren, Simon Litsyn. Codes Correcting Phased Burst Erasures |
420 | -- | 431 | Donald L. Bitzer, Ajay Dholakia, Havish Koorapaty, Mladen A. Vouk. On Locally Invertible Rate-1/n Convolutional Encoders |
423 | -- | 431 | Kjell Jørgen Hole, Øyvind Ytrehus. Cosets of Convolutional Codes with Least Possible Maximum Zero- and One-Run Lengths |
431 | -- | 435 | Morteza Esmaeili, T. Aaron Gulliver, Norman P. Secord, Samy A. Mahmoud. A Link Between Quasi-Cyclic Codes and Convolutional Codes |
436 | -- | 0 | Ludo M. G. M. Tolhuizen. Correction to The Generalized Gilbert-Varshamov Bound is Implied by Turin s Theorem |