Volume 33, Number 1, January 1987

Papers

• 
  Peter Elias: Interval and recency rank source coding: Two on-line adaptive variable-length schemes. 3-10
• 
  George V. Moustakides, John B. Thomas: Robust detection of signals in dependent noise. 11-15
• 
  Neil A. Weiss, Kenneth M. Peterson: Harmonic analysis for a class of multiplicative processes. 16-20
• 
  James Ting-Ho Lo, Sze-Kui Ng: Optimal functional expansion for estimation from counting observations. 21-35
• 
  Patrick A. Kelly, William L. Root: Stability in linear detection. 36-46
• 
  Chiaw-Hock Sim: A stochastic process associated with the EAR(l) model. 47-51
• 
  John S. Sadowsky: An asymptotically least-favorable Chernoff bound for a large class of dependent data processes. 52-61
• 
  Sergio Verdú: Maximum likelihood sequence detection for intersymbol interference channels: A new upper bound on error probability. 62-68
• 
  Te Sun Han, Kingo Kobayashi: A dichotomy of functions F(X, Y) of correlated sources (X, Y). 69-76
• 
  Vassil Y. Yorgov: A method for constructing inequivalent self-dual codes with applications to length 56. 77-82
• 
  Eli Gafni, Dimitri P. Bertsekas: Asymptotic optimality of shortest path routing algorithms. 83-90
• 
  Larry A. Dunning: Encoding and decoding for the minimization of message symbol error rates in linear block codes. 91-104
• 
  Mansour Loeloeian, Jean Conan: A transform approach to Goppa codes. 105-115
• 
  Abbas A. El Gamal, Lane A. Hemachandra, Itzhak Shperling, Victor K.-W. Wei: Using simulated annealing to design good codes. 116-123
• 
  Rainer A. Rueppel, Othmar Staffelbach: Products of linear recurring sequences with maximum complexity. 124-131
• 
  Israel Cidon, Moshe Sidi: Erasures and noise in splitting multiple access algorithms. 132-143

Correspondence

• 
  M. R. Schroeder, Neil J. A. Sloane: New permutation codes using Hadamard unscrambling. 144-146
• 
  Kyoki Imamura, Wataru Yoshida: A simple derivation of the Berlekamp- Massey algorithm and some applications. 146-150
• 
  Michele Elia: Algebraic decoding of the (23, 12, 7) Golay code. 150-151
• 
  Juriaan Simonis: Binary even [25, 15, 6] codes do not exist. 151-153
• 
  W. M. C. J. van Overveld: Some construction of new burst-error-correcting codes. 153-
• 
  Hatsukazu Tanaka: Data structure of Huffman codes and its application to efficient encoding and decoding. 154-156
• 
  Bruce L. Montgomery, Julia Abrahams: On the redundancy of optimal binary prefix-condition codes for finite and infinite sources. 156-160
• 
  Bernard C. Picinbono, Michel Bouvet: Constrained Wiener filtering. 160-166
• 
  C. T. Ng, Andrew K. C. Wong: On the nonuniqueness of discretization of two-dimensional probability distribution subject to the maximization of Shannon's entropy. 166-169
• 
  Michael Gutman: On uniform quantization with various distortion measures. 169-171

Reviews and Abstracts

• 
  R. E. Mortensen: Review of 'Random Processes: A Mathematical Approach for Engineers' (Gray, R.M., and Davisson, L.D.; 1986). 172-173

Volume 33, Number 2, March 1987

Papers

• 
  A. Robert Calderbank, Neil J. A. Sloane: New trellis codes based on lattices and cosets. 177-195
• 
  Ephraim Zehavi, Jack K. Wolf: On the performance evaluation of trellis codes. 196-202
• 
  Joseph L. Hibey: Cycle slipping in an optical communication system employing subcarrier angle modulation. 203-209
• 
  Sebastian Engell: New results on the real-time transmission problem. 210-218
• 
  David J. Aldous: Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels. 219-223
• 
  Fan R. K. Chung, Edward G. Coffman Jr., Martin I. Reiman, Burton Simon: The forwarding index of communication networks. 224-232
• 
  Leonidas Georgiadis, Panayota Papantoni-Kazakos: A 0.487 throughput limited sensing algorithm. 233-237
• 
  Alberto Apostolico, Aviezri S. Fraenkel: Robust transmission of unbounded strings using Fibonacci representations. 238-245
• 
  Tjalling J. Tjalkens, Frans M. J. Willems: Variable to fixed-length codes for Markov sources. 246-257
• 
  Murray Rosenblatt: Some models exhibiting non-Gaussian intermittency. 258-262
• 
  Paul C. Shields: The ergodic and entropy theorems revisited. 263-266
• 
  Brian L. Hughes, Prakash Narayan: Gaussian arbitrarily varying channels. 267-284

Correspondence

• 
  Gregory J. Pottie, Desmond P. Taylor: An approach to Ungerboeck coding for rectangular signal sets. 285-290
• 
  Giuliano Benelli, Romano Fantacci: Euclidean distance for combinations of some Hamming codes and binary CPFSK modulation. 290-293
• 
  Bruce L. Montgomery, B. V. K. Vijaya Kumar: On the average codeword length of optimal binary codes for extended sources. 293-296
• 
  John L. Brown Jr.: Detection of a known signal in colored Gaussian noise - A new coordinate approach. 296-298
• 
  Augustus J. E. M. Janssen: Comments on 'Characterizing the radar ambiguity functions' by L. Auslander and R. Tolimieri. 298-
• 
  Howard H. Ma, Jack K. Wolf: Correction to 'Binary unequal error-protection block codes formed from convolutional codes by generalized tail-biting' (Nov 86 776-786). 299-

Volume 33, Number 3, May 1987

Papers

• 
  Jacobus H. van Lint, T. A. Springer: Generalized Reed - Solomon codes from algebraic geometry. 305-309
• 
  Rudolf Ahlswede, Amiram H. Kaspi: Optimal coding strategies for certain permuting channels. 310-314
• 
  Baruch Awerbuch, Robert G. Gallager: A new distributed algorithm to find breadth first search trees. 315-322
• 
  Ronald L. Rivest: Network control by Bayesian broadcast. 323-328
• 
  Loren P. Clare, Izhak Rubin: Performance boundaries for prioritized multiplexing systems. 329-340
• 
  Micha Hofri, Zvi Rosberg: Packet delay under the golden ratio weighted TDM policy in a multiple-access channel. 341-349
• 
  Neil L. Gerr, Stamatis Cambanis: Analysis of adaptive differential PCM of a stationary Gauss - Markov input. 350-359
• 
  Dale H. Mugler, Wolfgang Splettstösser: Linear prediction from samples of a function and its derivatives. 360-366
• 
  Wolfgang Härdle, Rainer Nixdorf: Nonparametric sequential estimation of zeros and extrema of regression functions. 367-372
• 
  Nelson M. Blachman, Robert Machol: Confidence intervals based on one or more observations. 373-382
• 
  Soura Dasgupta, Yih-Fang Huang: Asymptotically convergent modified recursive least-squares with data-dependent updating and forgetting factor for systems with bounded noise. 383-392
• 
  Jitendra K. Tugnait: Identification of linear stochastic systems via second- and fourth-order cumulant matching. 393-407

Correspondence

• 
  Wlodzimierz Greblicki, Miroslaw Pawlak: Necessary and sufficient conditions for Bayes risk consistency of a recursive kernel classification rule. 408-412
• 
  Philippe Delsarte, Yves V. Genin, Yves G. Kamp: Stability of linear predictors and numerical range of a linear operator. 412-415
• 
  John S. Sadowsky: On the robust discrimination of Poisson random counting measures. 415-419
• 
  Attilio J. Rainal: First and second passage times of Rayleigh processes. 419-425
• 
  Ian F. Blake, H. Darabian: Approximations for the probability in the tails of the binomial distribution. 426-428
• 
  Jean Louis Dornstetter: On the equivalence between Berlekamp's and Euclid's algorithms. 428-431
• 
  Michiel H. M. Smid: Duadic codes. 432-
• 
  Jacobus H. Weber, Cornelis de Vroedt, Dick E. Boekee: New upper bounds on the size of codes correcting asymmetric errors. 434-437
• 
  Jan L. P. de Lameillieure: A heuristic algorithm for the construction of a code with limited word length. 438-443
• 
  Katalin Marton: Sequences achieving the boundary of the entropy region for a two-source are virtually memoryless. 443-448
• 
  Kenneth J. Kerpez: The rate-distortion function of a binary symmetric source when side information may be absent. 448-452
• 
  Kees A. Schouhamer Immink, G. F. M. Beenker: Binary transmission codes with higher order spectral zeros at zero frequency. 452-454
• 
  Michael E. Monaco, James M. Lawler: Corrections and additions to 'Error recovery for variable length codes' by J.C. Maxted and J.P. Robinson. 454-456

Volume 33, Number 4, July 1987

Papers

• 
  Robert J. McEliece, Edward C. Posner, Eugene R. Rodemich, Santosh S. Venkatesh: The capacity of the Hopfield associative memory. 461-482
• 
  Lee-Fang Wei: Trellis-coded modulation with multidimensional constellations. 483-501
• 
  Zhen Zhang, Toby Berger: New results in binary multiple descriptions. 502-521
• 
  David L. Neuhoff, Roberto Garcia-Muñoz: Robust source coding of weakly compact classes. 522-530
• 
  Jovan Dj. Golic: On the relationship between the efficiency measures of multicategory information systems. 531-538
• 
  Prakash Narayan, Donald L. Snyder: Signal set design for band-limited memoryless multiple-access channels with soft decision demodulation. 539-556
• 
  Brian H. Marcus, Paul H. Siegel: On codes with spectral nulls at rational submultiples of the symbol frequency. 557-568
• 
  Lewis Pakula: Asymptotic zero distribution of orthogonal polynomials in sinusoidal frequency estimation. 569-576
• 
  Frank K. Hwang, Xian M. Chang: Cutoff points for roll call protocols in multiple access systems. 577-581
• 
  John H. Cozzens, Larry A. Finkelstein: Range and error analysis for a fast Fourier transform computed over Z[{omega}]. 582-590

Correspondence

• 
  Pierce E. Cantrell, Anand K. Ojha: Comparison of generalized Q- function algorithms. 591-596
• 
  Frank K. Hwang, Lawrence A. Shepp: Some inequalities concerning random subsets of a set. 596-598
• 
  Jorma Rissanen, Marl Wax: Measures of mutual and causal dependence between two time series. 598-601
• 
  Jonathan J. Ashley, Paul H. Siegel: A note on the Shannon capacity of run-length-limited codes. 601-605
• 
  H. J. Tiersma: Remarks on codes from Hermitian curves. 605-609

Volume 33, Number 5, September 1987

Papers

• 
  Zhen Zhang, Toby Berger, James L. Massey: Some families of zero- error block codes for the two-user binary adder channel with feedback. 613-619
• 
  Wil J. van Gils: Two-dimensional dot codes for product identification. 620-631
• 
  Christian Thommesen: Error-correcting capabilities of concatenated codes with MDS outer codes on memoryless channels with maximum- likelihood decoding. 632-640
• 
  Te Sun Han, Max H. M. Costa: Broadcast channels with arbitrarily correlated sources. 641-650
• 
  John C. Kieffer: Fixed-rate encoding of nonstationary information sources. 651-655
• 
  Robert M. Gray, Mari O. Dunham, Richard L. Gobbi: Ergodicity of Markov channels. 656-664
• 
  Tom Verhoeff: An updated table of minimum-distance bounds for binary linear codes. 665-680
• 
  Jovan Dj. Golic: On the relationship between the information measures and the Bayes probability of error. 681-693
• 
  Jovan Dj. Golic: On the relationship between the separability measures and the Bayes probability of error. 694-701
• 
  John M. Pollard, Claus-Peter Schnorr: An efficient solution of the congruence x²+ky²=mpmod{n}. 702-709

Correspondence

• 
  Max H. M. Costa, Abbas A. El Gamal: The capacity region of the discrete memoryless interference channel with strong interference. 710-711
• 
  Joy A. Thomas: Feedback can at most double Gaussian multiple access channel capacity. 711-716
• 
  Kristien de Bruyn, Vyacheslav V. Prelov, Edward C. van der Meulen: Reliable transmission of two correlated sources over an asymmetric multiple-access channel. 716-718
• 
  Ying Cheng: New linear codes constructed by concatenating, extending, and shortening methods. 719-721
• 
  Thomas H. E. Ericson, Victor A. Zinoviev: An improvement of the Gilbert bound for constant weight codes. 721-723
• 
  Vera Pless, Vladimir D. Tonchev: Self-dual codes over GF(7). 723-727
• 
  Ludo M. G. M. Tolhuizen: New binary linear block codes. 727-729
• 
  J. Martin Borden, A. J. Han Vinck: On coding for 'stuck-at' defects. 729-735
• 
  Paul Kabaila: On the probability of error for decision-feedback equalizers. 735-738
• 
  Robert M. Gagliardi, J. Robbins, Herbert Taylor: Acquisition sequences in PPM communications. 738-744
• 
  Mohamed H. El-Zahar, Mahmoud K. Khairat: On the weight distribution of the coset leaders of the first-order Reed - Muller code. 744-747
• 
  Xuejia Lai: Condition for the nonsingularity of a feedback shift-register over a general finite field. 747-749
• 
  W. Cary Huffman, Vassil Y. Yorgov: A [72, 36, 16] doubly even code does not have an automorphism of order 11. 749-752

Volume 33, Number 6, November 1987

Obituary

• 
  In Memorium: Yasuo Sugiyama. 757-758

Papers

• 
  Te Sun Han: Hypothesis testing with multiterminal data compression. 759-772
• 
  Thomas J. Flynn, Robert M. Gray: Encoding of correlated observations. 773-787
• 
  Imre Csiszár, Thomas M. Cover, Byoung-Seon Choi: Conditional limit theorems under Markov conditioning. 788-801
• 
  Charles R. Baker: Capacity of the mismatched Gaussian channel. 802-812
• 
  Kingo Kobayashi: Combinatorial structure and capacity of the permuting relay channel. 813-826
• 
  Nariman Farvardin, Vinay A. Vaishampayan: Optimal quantizer design for noisy channels: An approach to combined source - channel coding. 827-838
• 
  John J. O'Reilly, José R. F. da Rocha: Improved error probability evaluation methods for direct detection optical communication systems. 839-848
• 
  Ivan Damgård: Concatenated group codes and their exponents. 849-854
• 
  Ender Ayanoglu, Robert M. Gray: The design of joint source and channel trellis waveform coders. 855-865
• 
  Takeshi Hashimoto: A list-type reduced-constraint generalization of the Viterbi algorithm. 866-876
• 
  Bruce E. Hajek: Locating the maximum of a simple random sequence by sequential search. 877-881
• 
  Robert F. Pawula, Stephen O. Rice: A differential equation related to a random telegraph wave problem--Computer calculation of series solution. 882-888
• 
  Novellone Rozario, Athanasios Papoulis: Spectral estimation from nonconsecutive data. 889-894
• 
  Georgios Tziritas: On the distribution of positive-definite Gaussian quadratic forms. 895-906

Correspondence

• 
  James A. Bucklew: The source coding theorem via Sanov's theorem. 907-909
• 
  Jovan Dj. Golic, Milorad M. Obradovic: A lower bound on the redundancy of D-ary Huffman codes. 910-911
• 
  Wil J. van Gils, Jean-Paul Boly: On combined symbol-and-bit error-control [4, 2] codes over {0, 1}⁸ to be used in the (4, 2) concept fault-tolerant computer. 911-917
• 
  Stefan M. Dodunekov, Tor Helleseth, Nickolai Manev, Øyvind Ytrehus: New bounds on binary linear codes of dimension eight. 917-919
• 
  W. M. C. J. van Overveld: Multiple-burst error-correcting cyclic product codes. 919-923
• 
  Johan P. Hansen: Codes on the Klein quartic, ideals, and decoding. 923-925
• 
  Anselm Blumer: Minimax universal noiseless coding for unifilar and Markov sources. 925-930
• 
  Mansour I. Irshid: Gray code weighting system. 930-931
• 
  Jean-Pierre Adoul: Fast ML decoding algorithm for the Nordstrom - Robinson code. 931-933
• 
  Ernst L. Leiss: On testing for immutability of codes. 934-938
• 
  Franklin S. Weinstein: Some probabilistic properties of the line-of-sight angle error to a remote object. 938-942
• 
  Yoram Baram: A lower bound on the mean square error of reduced-order estimators for nonlinear processes. 942-943