Volume 44,
Number 1,
January 1998
Papers
- Patrice Abry, Darryl Veitch:
Wavelet Analysis of Long-Range-Dependent Traffic.
2-15
- Vivek K. Goyal, Martin Vetterli, Nguyen T. Thao:
Quantized Overcomplete Expansions in IRN: Analysis, Synthesis, and Algorithms.
16-31
- Brett Ninness:
Estimation of 1/f Noise.
32-46
- En-Hui Yang, John C. Kieffer:
On the Performance of Data Compression Algorithms Based Upon String Matching.
47-65
- Yehuda Hershkovits, Jacob Ziv:
On Sliding-Window Universal Data Compression with Limited Memory.
66-78
- András Méhes, Kenneth Zeger:
Binary Lattice Vector Quantization with Linear Block Codes and Affine Index Assignments.
79-94
- Yuhong Yang, Andrew R. Barron:
An Asymptotic Property of Model Selection Criteria.
95-116
- Dharmendra S. Modha, Elias Masry:
Memory-Universal Prediction of Stationary Random Processes.
117-133
- Eric M. Rains:
Shadow Bounds for Self-Dual Codes.
134-139
- Andries E. Brouwer, Heikki O. Hämäläinen, Patric R. J. Östergård, Neil J. A. Sloane:
Bounds on Mixed Binary/Ternary Codes.
140-161
- Amir H. Banihashemi, Amir K. Khandani:
On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis.
162-171
- Kenneth G. Paterson:
Binary Sequence Sets with Favorable Correlations from Difference Sets and MDS Codes.
172-180
- Petra Heijnen, Ruud Pellikaan:
Generalized Hamming Weights of q-ary Reed-Muller Codes.
181-196
- Samuel J. MacMullan, Oliver M. Collins:
The Capacity of Binary Channels that Use Linear Codes and Decoders.
197-214
- Sivarama Venkatesan, Venkat Anantharam:
The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels.
215-224
- Rudolf Ahlswede, Imre Csiszár:
Common Randomness in Information Theory and Cryptography - Part II: CR Capacity.
225-240
- Thanh A. Diep:
Capacity of Multilevel Threshold Devices.
241-255
- Chuanyi Ji, Demetri Psaltis:
Capacity of Two-Layer Feedforward Neural Networks with Binary Weights.
256-268
Correspondence
- A. S. Holevo:
The Capacity of the Quantum Channel with General Signal States.
269-273
- Rüdiger L. Urbanke, Bixio Rimoldi:
Lattice Codes Can Achieve Capacity on the AWGN Channel.
273-278
- Vinay A. Vaishampayan, J.-C. Batllo:
Asymptotic Analysis of Multiple Description Quantizers.
278-284
- Sivarama Venkatesan, Venkat Anantharam:
Identification Plus Transmission Over Channels with Perfect Feedbac.
284-290
- Pascal Véron:
Goppa Codes and Trace Operator.
290-294
- Dejan E. Lazic, Hakam Kalouti, Thomas Beth:
Spectra of Long Primitive Binary BCH Codes Cannot Approach the Binomial Distribution.
294-295
- Rafail E. Krichevskiy:
Laplace's Law of Succession and Universal Encoding.
296-303
- Kyeongcheol Yang, Tor Helleseth:
On the Weight Hierarchy of Goethals Codes over Z4.
304-307
- Oscar Moreno, Iwan M. Duursma, Jean-Pierre Cherdieu, A. Edouard:
Cyclic Subcodes of Generalized Reed-Muller Codes.
307-311
- Joe Fields, Philippe Gaborit, Jeffrey S. Leon, Vera Pless:
All Self-Dual Z4 Codes of Length 15 or Less Are Known.
311-322
- Stefka Buyuklieva, Iliya Boukliev:
Extremal Self-Dual Codes with an Automorphism of Order 2.
323-328
- Fang-Wei Fu, A. J. Han Vinck, Shi-Yi Shen:
On the Constructions of Constant-Weight Codes.
328-333
- Vladimir D. Tonchev:
Maximum Disjoint Bases and Constant-Weight Codes.
333-334
- Shraga I. Bross, Ian F. Blake:
Upper Bound for Uniquely Decodable Codes in a Binary Input N-User Adder Channel.
334-340
- Khaled A. S. Abdel-Ghaffar, Hendrik C. Ferreira:
Systematic Encoding of the Varshamov-Tenengol'ts Codes and the Constantin-Rao Codes.
340-345
- Adrian Escott, Stephanie Perkins:
Binary Huffman Equivalent Codes with a Short Synchronizing Codeword.
346-351
- Brian M. Sadler, Amod V. Dandawate:
Nonparametric Estimation of the Cyclic Cross Spectrum.
351-358
- H. S. Madhusudhana, M. U. Siddiqi:
On Blahut's Decoding Algorithms for Two-Dimensional BCH Codes.
358-367
- 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.
367-378
- Apostolos Dollas, William T. Rankin, David McCracken:
A New Algorithm for Golomb Ruler Derivation and Proof of the 19 Mark Ruler.
379-382
- Tuvi Etzion, Patric R. J. Östergård:
Greedy and Heuristic Algorithms for Codes and Colorings.
382-388
- Marc P. C. Fossorier, Shu Lin, Jakov Snyders:
Reliability-Based Syndrome Decoding of Linear Block Codes.
388-398
- L. E. Aguado, Patrick G. Farrell:
On Hybrid Stack Decoding Algorithms for Block Codes.
398-409
- Vladislav Sorokine, Frank R. Kschischang:
A Sequential Decoder for Linear Block Codes with a Variable Bias-Term Metric.
410-416
- Osnat Keren, Simon Litsyn:
Codes Correcting Phased Burst Erasures.
416-420
- Donald L. Bitzer, Ajay Dholakia, Havish Koorapaty, Mladen A. Vouk:
On Locally Invertible Rate-1/n Convolutional Encoders.
420-431
- Kjell Jørgen Hole, Øyvind Ytrehus:
Cosets of Convolutional Codes with Least Possible Maximum Zero- and One-Run Lengths.
423-431
- Morteza Esmaeili, T. Aaron Gulliver, Norman P. Secord, Samy A. Mahmoud:
A Link Between Quasi-Cyclic Codes and Convolutional Codes.
431-435
- Ludo M. G. M. Tolhuizen:
Correction to 'The Generalized Gilbert-Varshamov Bound is Implied by Turin's Theorem'.
436
Volume 44,
Number 2,
March 1998
Editorial
- 1997 Information Theory Society Paper Award.
445
Papers
- Anand S. Bedekar, Murat Azizoglu:
The Information-Theoretic Capacity of Discrete-Time Queues.
446-461
- Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio Verdú:
Source Codes as Random Number Generators.
462-471
- Yossef Steinberg:
Resolvability Theory for the Multiple-Access Channel.
472-487
- Amos Lapidoth, Shlomo Shamai:
The Poisson Multiple-Access Channel.
488-501
- Xuming Zhang, David Brady:
Asymptotic Multiuser Efficiencies for Decision-Directed Multiuser Detectors.
502-515
- Rick S. Blum, Matthew C. Deans:
Distributed Random Signal Detection with Multibit Sensor Decisions.
516-524
- Peter L. Bartlett:
The Sample Complexity of Pattern Classification with Neural Networks: The Size of the Weights is More Important than the Size of the Network.
525-536
- Andrew B. Nobel, Gusztáv Morvai, Sanjeev R. Kulkarni:
Density Estimation from an Individual Numerical Sequence.
537-541
- Rudolf Ahlswede, Ning Cai:
Information and Control: Matching Channels.
542-563
- Shlomo Shamai, Sergio Verdú, Ram Zamir:
Systematic Lossy Source/Channel Coding.
564-579
- Ilan Reuven, Yair Be'ery:
Entropy/Length Profiles, Bounds on the Minimal Covering of Bipartite Graphs, and Trellis Complexity of Nonlinear Codes.
580-598
- Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. Levitin:
On a New Class of Codes for Identifying Vertices in Graphs.
599-611
- E. F. Assmus Jr.:
The Category of Linear Codes.
612-629
- Stephan Wesemeyer:
On the Automorphism Group of Various Goppa Codes.
630-643
- Alexander Goldenshluger:
Nonparametric Estimation of Transfer Functions: Rates of Convergence and Adaptation.
644-658
- Tan F. Wong, Tat M. Lok, James S. Lehnert, Michael D. Zoltowski:
A Linear Receiver for Direct-Sequence Spread-Spectrum Multiple-Access Systems with Antenna Arrays and Blind Adaptation.
659-676
- Xiaodong Wang, H. Vincent Poor:
Blind Multiuser Detection: A Subspace Approach.
677-690
- Marc P. C. Fossorier, Shu Lin:
A Unified Method for Evaluating the Error-Correction Radius of Reliability-Based Soft-Decision Algorithms for Linear Block Codes.
691-700
- Amir Said, John B. Anderson:
Bandwidth-Efficient Coded Modulation with Optimized Linear Partial-Response Signals.
701-713
- Toru Fujiwara, Hiroshi Yamamoto, Tadao Kasami, Shu Lin:
A Trellis-Based Recursive Maximum-Likelihood Decoding Algorithm for Binary Linear Block Codes.
714-729
- Mario Blaum, Jehoshua Bruck, Alexander Vardy:
Interleaving Schemes for Multidimensional Cluster Errors.
730-743
- Vahid Tarokh, Nambi Seshadri, A. Robert Calderbank:
Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction.
744-765
Correspondence
- Bane V. Vasic, Steven W. McLaughlin, Olgica Milenkovic:
Shannon Capacity of M-ary Redundant Multitrack Runlength Limited Codes.
766-774
- Wai Ho Mow:
A Tight Upper Bound on Discrete Entropy.
775-778
- David L. Neuhoff, Paul C. Shields:
Simplistic Universal Coding. .
778-781
- Guoqi Qian, Hans R. Künsch:
Some Notes on Rissanen's Stochastic Complexity.
782-786
- Serap A. Savari:
Redundancy of the Lempel-Ziv String Matching Code.
787-791
- Frans M. J. Willems:
The Context-Tree Weighting Method : Extensions.
792-798
- Xiang-dong Hou, Jyrki T. Lahtonen, Sami Koponen:
The Reed-Muller Code R(r, m) Is Not Z4-Linear for 3 <= r <= m-2.
798-799
- W. Cary Huffman:
Decompositions and Extremal Type II Codes over Z4.
800-809
- Iliya Boukliev, Stefka Buyuklieva:
Some New Extremal Self-Dual Codes with Lengths 44, 50, 54, and 58.
809-812
- Han-Ping Tsai, Yih-Jaw Jiang:
Some New Extremal Self-Dual [58, 29, 10] Codes.
813-814
- Jong-Seon No, Solomon W. Golomb, Guang Gong, Hwan-Keun Lee, Peter Gaal:
Binary Pseudorandom Sequences of Period 2n-1 with Ideal Autocorrelation.
814-817
- Solomon W. Golomb, Moe Z. Win:
Recent Results on Polyphase Sequences.
817-824
- Richard D. Wesel, John M. Cioffi:
Achievable Rates for Tomlinson-Harashima Precoding.
824-831
- Harro Osthoff, John B. Anderson, Rolf Johannesson, Chin-foo Lin:
Systematic Feed-Forward Convolutional Encoders Are Better than Other Encoders with an M-Algorithm Decoder.
831-838
- Rolf Johannesson, Zhe-xian Wan, Emma Wittenmark:
Some Structural Properties of Convolutional Codes over Rings.
839-845
- Vitaly Skachek, Tuvi Etzion, Ron M. Roth:
Efficient Encoding Algorithm for Third-Order Spectral-Null Codes.
846-851
- L. Cheded:
Exact Recovery of Higher Order Moments.
851-858
- N. K. Bose, K. J. Boo:
Asymptotic Eigenvalue Distribution of Block-Toeplitz Matrices.
858-861
- David Burshtein:
Typical Error Pattern Recovery of the Hopfield Memory under Error-Tolerant Conditions.
861-865
- Chunming Han, Peter K. Willett, Biao Chen, Douglas Abraham:
A Detection Optimal Min-Max Test for Transient Signals.
866-869
- Tat M. Lok, James S. Lehnert:
An Asymptotic Analysis of DS/SSMA Communication Systems with General Linear Modulation and Error Control Coding.
870-881
- Nelson M. Blachman:
The Shape of Low Excursions of the Envelope of a Signal Plus Noise.
882-886
- László Györfi, Gusztáv Morvai, Sidney Yakowitz:
Limits to Consistent On-Line Forecasting for Ergodic Time Series.
886-892
- Fang-Wei Fu, Shi-Yi Shen:
Hypothesis Testing for Arbitrarily Varying Source with Exponential-Type Constraint.
892-895
- Zhongxing Ye, Toby Berger:
Critical Distortion of Potts Model.
896-899
Volume 44,
Number 3,
May 1998
Papers
- Sergio Benedetto, Dariush Divsalar, Guido Montorsi, Fabrizio Pollara:
Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding.
909-926
- Giuseppe Caire, Giorgio Taricco, Ezio Biglieri:
Bit-Interleaved Coded Modulation.
927-946
- Andrew L. McKellips, Sergio Verdú:
Maximin Performance of Binary-Input Channels with Uncertain Noise Distributions.
947-972
- Amos Lapidoth, Ì. Emre Telatar:
The Compound Channel Capacity of a Class of Finite-State Channels.
973-983
- Yossef Steinberg:
New Converses in the Theory of Identification via Channels.
984-998
- Alain Berlinet, Igor Vajda, Edward C. van der Meulen:
About the Asymptotic Accuracy of Barron Density Estimates.
999-1009
- Assaf J. Zeevi, Ron Meir, Vitaly Maiorov:
Error Bounds for Functional Approximation and Estimation Using Mixtures of Experts.
1010-1025
- Elza Erkip, Thomas M. Cover:
The Efficiency of Investment Information.
1026-1040
- Erdal Arikan, Neri Merhav:
Guessing Subject to Distortion.
1041-1056
- Yasutada Oohama:
The Rate-Distortion Function for the Quadratic Gaussian CEO Problem.
1057-1070
- Akio Fujiwara, Hiroshi Nagaoka:
Operational Capacity and Pseudoclassicality of a Quantum Channel.
1071-1086
- Jean-Yves Le Boudec:
Application of Network Calculus to Guaranteed Service Networks.
1087-1096
- Cheng-Shang Chang:
On Deterministic Traffic Regulation and Service Guarantees : A Systematic Approach by Filtering.
1097-1110
- Roland Averkamp, Christian Houdré:
Some Distributional Properties of the Continuous Wavelet Transform of Random Processes.
1111-1124
- Aswini K. Dey, Clyde F. Martin, Frits H. Ruymgaart:
Input Recovery from Noisy Output Data, Using Regularized Inversion of the Laplace Transform.
1125-1130
- Wen Chen, Shuichi Itoh, Junji Shik:
Irregular Sampling Theorems for Wavelet Subspaces.
1131-1142
- Ivan Damgård, Torben P. Pedersen, Birgit Pfitzmann:
Statistical Secrecy and Multibit Commitments.
1143-1151
- Gui Liang Feng, Xinwen Wu, T. R. N. Rao:
New Double-Byte Error-Correcting Codes for Memory Systems.
1152-1163
- Kenneth G. Paterson, Paul J. G. Lothian:
Bounds on Partial Correlations of Sequences.
1164-1175
Correspondence
- Sven Riedel:
MAP Decoding of Convolutional Codes Using Reciprocal Dual Codes.
1176-1187
- Peter F. Swaszek, William Jones:
How Often Is Hard-Decision Decoding Enough?
1187-1193
- William Weeks IV, Richard E. Blahut:
The Capacity and Coding Gain of Certain Checkerboard Codes.
1193-1203
- Jin G. Goh, Svetislav V. Maric:
The Capacities of Frequency-Hopped Code-Division Multiple-Access Channels.
1204-1211
- Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani:
The 'Art of Trellis Decoding' Is Computationally Hardi - For Large Fields.
1211-1214
- Arvind R. Raghavan, Carl W. Baum:
A Reliability Output Viterbi Algorithm with Applications to Hybrid ARQ.
1214-1216
- Samuel J. MacMullan, Oliver M. Collins:
The Capacity of Orthogonal and Bi-Orthogonal Codes on the Gaussian Channel.
1217-1232
- Yunghsiang S. Han, Carlos R. P. Hartmann, Kishan G. Mehrotra:
Decoding Linear Block Codes Using a Priority-First Search : Performance Analysis and Suboptimal Version.
1233-1246
- Ram Zamir:
A Proof of the Fisher Information Inequality via a Data Processing Argument.
1246-1250
- Rudolf Ahlswede, Ning Cai, Zhen Zhang:
Zero-Error Capacity for Models with Memory and the Enlightened Dictator Channel.
1250-1252
- Eric Bach:
Efficient Prediction of Marsaglia-Zaman Random Number Generators.
1253-1257
- Jovan Dj. Golic:
Periods of Interleaved and Nonuniformly Decimated Sequences.
1257-1260
- Krzysztof Podgórski, Gordon Simons, Yi-Wen Ma:
On Estimation for a Binary-Symmetric Channel.
1260-1272
- Mulan Liu, Peizhong Lu, Gary L. Mullen:
Correlation-Immune Functions over Finite Fields.
1273-1276
- Cunsheng Ding, Tor Helleseth, Weijuan Shan:
On the Linear Complexity of Legendre Sequences.
1276-1278
- Jong-Seon No, Habong Chung, Min-Seon Yun:
Binary Pseudorandom Sequences of Period 2m-1 with Ideal Autocorrelation Generated by the Polynomial zd + (z+1)d.
1278-1282
- Sean A. Ramprashad, T. W. Parks:
Locally Most Powerful Invariant Tests for Signal Detection.
1283-1288
- Marcus Greferath, Ute Vellbinger:
Efficient Decoding of Zpk-Linear Codes.
1288-1291
- Oscar Moreno, Jens Peter Pedersen, Despina Polemi:
An Improved Serre Bound for Elementary Abelian Extensions of Fq(x) and the Generalized Hamming Weights of Duals of BCH Codes.
1291-1293
- Fang-Wei Fu, Shu-Tao Xia:
Binary Constant-Weight Codes for Error Detection.
1294-1299
- William S. Evans, Nicholas Pippenger:
On the Maximum Tolerable Noise for Reliable Computation by Formulas.
1299-1305
- Kenneth G. Paterson, Jonathan Tuliani:
Some New Circuit Codes.
1305-1309
- P. Pucar, J. Sjöberg:
On the Hinge-Finding Algorithm for Hinging Hyperplanes.
1310-1319
- Ioannis Kontoyiannis, Paul H. Algoet, Yuri M. Suhov, A. J. Wyner:
Nonparametric Entropy Estimation for Stationary Processesand Random Fields, with Applications to English Text.
1319-1327
- Zong-Duo Dai, Kyoki Imamura:
Linear Complexity for One-Symbol Substitution of a Periodic Sequence over GF(q).
1328-1331
- Henry J. Landau:
Maximum Entropy and Maximum Likelihood in Spectral Estimation.
1332-1336
- Ernst M. Gabidulin, Juriaan Simonis:
Metrics Generated by Families of Subspaces.
1336-1341
- Serge G. Vladut:
A Note on Authentication Codes from Algebraic Geometry.
1342-1345
Volume 44,
Number 4,
July 1998
Papers
- Ralf Kötter:
A Fast Parallel Implementation of a Berlekamp-Massey Algorithm for Algebraic-Geometric Codes.
1353-1368
- A. Robert Calderbank, Eric M. Rains, Peter W. Shor, Neil J. A. Sloane:
Quantum Error Correction Via Codes Over GF(4).
1369-1387
- Eric M. Rains:
Quantum Weight Enumerators.
1388-1394
- Ron M. Roth, Gadiel Seroussi:
Reduced-Redundancy Product Codes for Burst Error Correction.
1395-1406
- Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek:
Information Distance.
1407-1423
- Kenji Yamanishi:
A Decision-Theoretic Extension of Stochastic Complexity and Its Applications to Learning.
1424-1439
- Zhen Zhang, Raymond W. Yeung:
On Characterization of Entropy Function via Information Inequalities.
1440-1452
- Joseph Boutros, Emanuele Viterbo:
Signal Space Diversity: A Power- and Bandwidth-Efficient Diversity Technique for the Rayleigh Fading Channel.
1453-1467
- Bruno Suard, Guanghan Xu, Hui Liu, Thomas Kailath:
Uplink Channel Capacity of Space-Division-Multiple-Access Schemes.
1468-1476
- Feng-Wen Sun, Harry Leib:
Multiple-Phase Codes for Detection Without Carrier Phase Reference.
1477-1491
- Parampalli Udaya, M. U. Siddiqi:
Optimal Large Linear Complexity Frequency Hopping Patterns Derived from Polynomial Residue Class Rings.
1492-1503
- Jiann-Ching Guey, Mark R. Bell:
Diversity Waveform Sets for Delay-Doppler Imaging.
1504-1522
- Hanks H. Zeng, Lang Tong, C. Richard Johnson Jr.:
Relationships Between the Constant Modulus and Wiener Receivers.
1523-1538
Correspondence
- Giorgio Taricco, Emanuele Viterbo:
Performance of High-Diversity Multidimensional Constellations.
1539-1543
- Claude Carlet:
Z2k-Linear Codes.
1543-1547
- Yaron Shany, Ilan Reuven, Yair Be'ery:
On the Trellis Representation of the Delsarte-Goethals Codes.
1547-1554
- Andreas Faldum, Wolfgang Willems:
A Characterization of MMD Codes.
1555-1558
- Shojiro Sakata, Douglas A. Leonard, Helge Elbrønd Jensen, Tom Høholdt:
Fast Erasure-and-Error Decoding of Algebraic Geometry Codes up to the Feng-Rao Bound.
1558-1564
- John L. Fan, A. Robert Calderbank:
A Modified Concatenated Coding Scheme, with Applications to Magnetic Data Storage.
1565-1574
- Bane V. Vasic:
Spectral Analysis of Maximum Entropy Multitrack Modulation Codes.
1574-1587
- Patrick Perry, Mingche Li, Mao Chao Lin, Zhen Zhang:
Runlength Limited Codes for Single Error-Detection and Single Error-Correction with Mixed Type Errors.
1588-1592
- Khaled A. S. Abdel-Ghaffar, Øyvind Ytrehus:
Difference Set Codes: Codes with Squared Euclidean Distance of Six for Partial Response Channels.
1593-1602
- Rolf Johannesson, Emma Wittenmark:
Two 16-State, Rate R = 2/4 Trellis Codes Whose Free Distances Meet the Heller Bound.
1602-1604
- A. J. Han Vinck, Petr Dolezal, Young Gil Kim:
Convolutional Encoder State Estimation.
1604-1608
- Jørn Justesen, Jakob Dahl Andersen:
Critical Lengths of Error Events in Convolutional Codes.
1608-1611
- Karin Engdahl, Kamil Sh. Zigangirov:
On the Calculation of the Error Probability for a Multilevel Modulation Scheme Using QAM-Signaling.
1612-1620
- Jyoti Bali, B. Sundar Rajan:
Block-Coded PSK Modulation Using Two-Level Group Codes Over Dihedral Groups.
1620-1631
- Vivek P. Telang, Mark A. Herro:
Error Control Coding for the N-User mod-2 Multiple-Access Channel.
1632-1642
- Vladimir B. Balakirsky:
Lower Bounds on the Code Rate for a Model of Data Transmission with Side Information.
1642-1648
- Julia Abrahams:
Variable-Length Unequal Cost Parsing and Coding for Shaping.
1648-1650
- Alistair Moffat, Andrew Turpin:
Efficient Construction of Minimum-Redundancy Codes for Large Alphabets.
1650-1657
- C. Bendjaballah, J. M. Leroy, A. Vourdas:
Rate Distortion and Detection in Quantum Communication.
1658-1665
- Po-Ning Chen, Fady Alajaji:
A Rate-Distortion Theorem for Arbitrary Discrete Sources.
1666-1668
- Marat V. Burnashev:
On One Useful Inequality in Testing of Hypotheses.
1668-1670
- A. Van den Bos:
The Real-Complex Normal Distribution.
1670-1672
- John T. Barnett, Benjamin Kedem:
Zero-Crossing Rates of Mixtures and Products of Gaussian Processes.
1672-1677
- Kutluyil Dogancay, Vikram Krishnamurthy:
Blind On-Line Testing for Equalization Errors in Digital Communication Systems.
1677-1686
- I. J. Fair, Vijay K. Bhargava, Qiang Wang:
On the Power Spectral Density of Self-Synchronizing Scrambled Sequences.
1687-1693
- Cunsheng Ding:
Pattern Distributions of Legendre Sequences.
1693-1698
- Cunsheng Ding:
Autocorrelation Values of Generalized Cyclotomic Sequences of Order Two.
1699-1702
- Weiping Li, Xixian Chen, Yi Wang, Nobuhiro Miki:
Frequency and Symbol Rate Offset Compensating Algorithms for Simultaneous Estimation of Echo and Channel Responses.
1702-1708
Volume 44,
Number 5,
September 1998
Papers
- Boris Tsybakov, Nicolas D. Georganas:
Self-Similar Processes in Communications Networks.
1713-1725
- Meir Feder, Amos Lapidoth:
Universal Decoding for Channels with Memory.
1726-1745
- Amos Lapidoth, Jacob Ziv:
On the Universality of the LZ-Based Decoding Algorithm.
1746-1755
- Erdal Arikan, Neri Merhav:
Joint Source-Channel Coding and Guessing with Application to Sequential Decoding.
1756-1769
- Mordecai J. Golin, Günter Rote:
A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs.
1770-1781
- En-Hui Yang, Zhen Zhang:
An On-Line Universal Lossy Data Compression Algorithm via Continuous Codebook Refinement - Part III: Redundancy Analysis.
1782-1801
- Peter L. Bartlett, Tamás Linder, Gábor Lugosi:
The Minimax Distortion Redundancy in Empirical Quantizer Design.
1802-1813
- Erik Agrell, Thomas Eriksson:
Optimization of Lattices for Quantization.
1814-1828
- Amir H. Banihashemi, Ian F. Blake:
Trellis Complexity and Minimal Trellis Diagrams of Lattices.
1829-1847
- Xue-Dong Dong, Cheong Boon Soh, Erry Gunawan, Li-Zhong Tang:
Groups of Algebraic Integers Used for Coding QAM Signals.
1848-1860
- Masayuki Hattori, Robert J. McEliece, Gustave Solomon:
Subspace Subcodes of Reed-Solomon Codes.
1861-1880
- Johan P. Hansen, Helge Elbrønd Jensen, Ralf Kötter:
Determination of Error Values for Algebraic-Geometry Codes and the Forney Formula.
1881-1886
- Amos Beimel, Benny Chor:
Secret Sharing with Public Reconstruction.
1887-1896
- Dan Boneh, James Shaw:
Collusion-Secure Fingerprinting for Digital Data.
1897-1905
- David Haussler, Jyrki Kivinen, Manfred K. Warmuth:
Sequential Prediction of Individual Sequences Under General Loss Functions.
1906-1925
- John Shawe-Taylor, Peter L. Bartlett, Robert C. Williamson, Martin Anthony:
Structural Risk Minimization Over Data-Dependent Hierarchies.
1926-1940
- Elisabeth Gassiat, Emmanuelle Gautherat:
Identification of Noisy Linear Systems with Discrete Random Input.
1941-1952
Correspondence
- G. H. Khachatrian, S. S. Martirossian:
Code Construction for the T-User Noiseless Adder Channel.
1953-1957
- Chandrasekar Sankaran, Anthony Ephremides:
Solving a Class of Optimum Multiuser Detection Problems with Polynomial Complexity.
1958-1961
- Zoran Cvetkovic, Martin Vetterli:
Error-Rate Characteristics of Oversampled Analog-to-Digital Conversion.
1961-1964
- George V. Moustakides:
Quickest Detection of Abrupt Changes for a Class of Random Processes.
1965-1968
- Zhiyi Chi, Stuart Geman:
On the Consistency of Minimum Complexity Nonparametric Estimation.
1968-1973
- Wee Sun Lee, Peter L. Bartlett, Robert C. Williamson:
The Importance of Convexity in Learning with Squared Loss.
1974-1980
- Karim Benhenni, Stamatis Cambanis:
The Effect of Quantization on the Performance of Sampling Designs.
1981-1992
- Yves Edel, Jürgen Bierbrauer:
Inverting Construction Y1.
1993
- Petra Heijnen, Henk C. A. van Tilborg, Tom Verhoeff, Sander Weijs:
Some New Binary, Quasi-Cyclic Codes.
1994-1996
- Ma Xiao, Wang Xinmei:
Some New Bounds for Q-ary Linear Block Codes.
1996-1998
- Uri Blass, Simon Litsyn:
Several New Lower Bounds on the Size of Codes with Covering Radius One.
1998-2002
- Ulrich Tamm:
Splittings of Cyclic Groups and Perfect Shift Codes.
2003-2009
- Alexei E. Ashikhmin, Alexander Barg:
Minimal Vectors in Linear Codes.
2010-2017
- Marcus Greferath, Ute Vellbinger:
On the Extended Error-Correcting Capabilities of the Quaternary Preparata Codes.
2018-2019
- Adrian Mardjuadi, Jos H. Weber:
Codes for Multiple Localized Burst Error Correction.
2020-2024
- Markus Breitbach, Martin Bossert, Victor V. Zyablov, Vladimir Sidorenko:
Array Codes Correcting a Two-Dimensional Cluster of Errors.
2025-2031
- Tsonka Stefanova Baicheva, Evgenia D. Velikova:
Correction to 'Covering Radii of Ternary Linear Codes of Small Dimensions and Codimensions'.
2032
Volume 44,
Number 6,
October 1998
Information Theory:
1948-1998 - Special Commemorative Issue
- Sergio Verdú:
Information Theory: 1948-1998 - Guest Editorial.
2042-2044
- Aaron D. Wyner, Jacob Ziv, A. J. Wyner:
On the Role of Pattern Matching in Information Theory.
2045-2056
- Sergio Verdú:
Fifty Years of Shannon Theory.
2057-2078
- Paul C. Shields:
The Interactions Between Ergodic Theory and Information Theory.
2079-2093
- Joseph A. O'Sullivan, Richard E. Blahut, Donald L. Snyder:
Information-Theoretic Image Formation.
2094-2123
- Neri Merhav, Meir Feder:
Universal Prediction.
2124-2147
- Amos Lapidoth, P. Narayan:
Reliable Communication Under Channel Uncertainty.
2148-2177
- Sanjeev R. Kulkarni, Gábor Lugosi, Santosh S. Venkatesh:
Learning Pattern Classification - A Survey.
2178-2206
- János Körner, Alon Orlitsky:
Zero-Error Information Theory.
2207-2229
- Thomas Kailath, H. Vincent Poor:
Detection of Stochastic Processes.
2230-2259
- Kees A. Schouhamer Immink, Paul H. Siegel, Jack K. Wolf:
Codes for Digital Recorders.
2260-2299
- Te Sun Han, Shun-ichi Amari:
Statistical Inference Under Multiterminal Data Compression.
2300-2324
- Robert M. Gray, David L. Neuhoff:
Quantization.
2325-2383
- G. David Forney Jr., Gottfried Ungerboeck:
Modulation and Coding for Linear Gaussian Channels.
2384-2415
- Anthony Ephremides, Bruce E. Hajek:
Information Theory and Communication Networks: An Unconsummated Union.
2416-2434
- David L. Donoho, Martin Vetterli, Ronald A. DeVore, Ingrid Daubechies:
Data Compression and Harmonic Analysis.
2435-2476
- Philippe Delsarte, Vladimir I. Levenshtein:
Association Schemes and Coding Theory.
2477-2504
- Imre Csiszár:
The Method of Types.
2505-2523
- Thomas M. Cover:
Comments on Broadcast Channels.
2524-2530
- Daniel J. Costello Jr., Joachim Hagenauer, H. Imai, Stephen B. Wicker:
Applications of Error-Control Coding.
2531-2560
- A. Robert Calderbank:
The Art of Signaling: Fifty Years of Coding Theory.
2561-2595
- Ian F. Blake, Chris Heegard, Tom Høholdt, V. Wei:
Algebraic-Geometry Codes.
2596-2618
- Ezio Biglieri, John G. Proakis, Shlomo Shamai:
Fading Channels: Information-Theoretic and Communication Aspects.
2619-2692
- T. Berger, J. D. Gibson:
Lossy Source Coding.
2693-2723
- Charles H. Bennett, Peter W. Shor:
Quantum Information Theory.
2724-2742
- Andrew R. Barron, Jorma Rissanen, Bin Yu:
The Minimum Description Length Principle in Coding and Modeling.
2743-
Combined List of References
Volume 44,
Number 7,
November 1998
Papers
- Te Sun Han:
An Information-Spectrum Approach to Capacity Theorems for the General Multiple-Access Channel.
2773-2795
- David N. C. Tse, Stephen V. Hanly:
Multiaccess Fading Channels-Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities.
2796-2815
- Stephen V. Hanly, David N. C. Tse:
Multiaccess Fading Channels-Part II: Delay-Limited Capacities.
2816-2831
- Alex J. Grant, Paul D. Alexander:
Random Sequence Multisets for Synchronous Code-Division Multiple-Access Channels.
2832-2836
- Christian Schlegel, Paul D. Alexander, Sumit Roy:
Coded Asynchronous CDMA and Its Efficient Detection.
2837-2847
- Florence Danilo, Harry Leib:
Detection Techniques for Fading Multipath Channels with Unresolved Components.
2848-2863
- Ye (Geoffrey) Li, K. J. Ray Liu:
Adaptive Blind Source Separation and Equalization for Multiple-Input/Multiple-Output Systems.
2864-2876
- James A. Bucklew:
The Blind Simulation Problem and Regenerative Processes.
2877-2891
- Van H. Vu:
On the Infeasibility of Training Neural Networks with Small Mean-Sqared Error.
2892-2900
- Fréderic Champagnat, Jérôme Idier, Yves Goussard:
Stationary Markov Random Fields on a Finite Rectangular Lattice.
2901-2916
- Tze Leung Lai:
Information Bounds and Quick Detection of Parameter Changes in Stochastic Systems.
2917-2929
- Shyang Chang, Yen-Ching Chang, Chen-Yu Chang:
A Minimum Discrepancy Estimator in Parameter Estimation.
2930-2942
- J. Scot Goldstein, Irving S. Reed, Louis L. Scharf:
A Multistage Representation of the Wiener Filter Based on Orthogonal Projections.
2943-2959
- James M. Ooi, Gregory W. Wornell:
Fast Iterative Coding Techniques for Feedback Channels.
2960-2976
- James M. Kroll, Nam C. Phamdo:
Analysis and Design of Trellis Codes Optimized for a Binary Symmetric Markov Source with MAP Detection.
2977-2987
- Emina Soljanin, Costas N. Georghiades:
Multihead Detection for Multitrack Recording Channels.
2988-2997
- Marco Chiani:
Error Probability for Block Codes Over Channels with Block Interference.
2998-3008
- Samuel J. MacMullan, Oliver M. Collins:
A Comparison of Known Codes, Random Codes, and the Best Codes.
3009-3022
- Ching-Cheng Shih, Christopher R. Wulff, Carlos R. P. Hartmann, Chilukuri K. Mohan:
Efficient Heuristic Search Algorithms for Soft-Decision Decoding of Linear Block Codes.
3023-3038
Correspondence
- Ram Zamir, Meir Feder:
On the Volume of the Minkowski Sum of Line Sets and the Entropy-Power Inequality.
3039-3043
- Bertrand M. Hochwald:
Tradeoff Between Source and Channel Coding on a Gaussian Channel.
3044-3055
- Liuyang Yang, Thomas R. Fischer:
A New Trellis Source Code for Memoryless Sources.
3056-3063
- Erik Agrell:
On the Voronoi Neighbor Ratio for Binary Linear Block Codes.
3064-3072
- Ofer Amrani, Yair Be'ery:
Bounded-Distance Decoding: Algorithms, Decision Regions, and Pseudo Nearest Neighbors.
3072-3082
- Marc P. C. Fossorier, Shu Lin, Dojun Rhee:
Bit-Error Probability for Maximum-Likelihood Decoding of Linear Block Codes and Related Soft-Decision Decoding Methods.
3083-3090
- Yunghsiang S. Han:
A New Treatment of Priority-First Search Maximum-Likelihood Soft-Decision Decoding of Linear Block Codes.
3091-3096
- Michael Moher, T. Aaron Gulliver:
Cross-Entropy and Iterative Decoding.
3097-3104
- T. Aaron Gulliver, Masaaki Harada:
Double Circulant Self-Dual Codes Over Z2k.
3105-3123
- Thomas Johansson, Kamil Sh. Zigangirov:
A Simple One-Sweep Algorithm for Optimal APP Symbol Decoding of Linear Block Codes.
3124-3129
- Gary D. Brushe, Robert E. Mahony, John B. Moore:
A Soft Output Hybrid Algorithm for ML/MAP Sequence Estimation.
3129-3134
- Kutluyil Dogancay:
Correlation-Based Testing for the Convergence of Decision Feedback Equalizers.
3134-3140
- Tuvi Etzion:
Perfect Byte-Correcting Codes.
3140-3146
- Chris J. Mitchell:
On Integer-Valued Rational Polynomials and Depth Distributions of Binary Codes.
3146-3150
- James B. Shearer:
Some New Disjoint Golomb Rulers.
3151-3153
- Qing Xiang:
On Balanced Binary Sequences with Two-Level Autocorrelation Functions.
3153-3156
- Alfred M. Bruckstein, Lawrence O'Gorman, Alon Orlitsky:
Design of Shapes for Precise Image Registration.
3156-3162
- Ira S. Moskowitz, Steven J. Greenwald, Myong H. Kang:
An Analysis of the Timed Z-Channel.
3162-3168
- Gérald E. Séguin:
A Lower Bound on the Error Probability for Signals in White Gaussian Noise.
3168-3175
- Dale Youngs:
Minimization Criteria for Frequency Planning in Cellular Radio Systems.
3175-3177
- Evgueni A. Haroutunian:
Acknowledgment.
3177
Copyright © Sun Nov 8 03:51:16 2009
by Michael Ley (ley@uni-trier.de)
