Volume 29,
Number 1,
January 1983
Papers
- Roy L. Adler, Don Coppersmith, Martin Hassner:
Algorithms for sliding block codes - An application of symbolic dynamics to information theory.
5-22
- Adrian Segall:
Distributed network protocols.
23-34
- Ehud D. Karnin, J. W. Greene, Martin E. Hellman:
On secret sharing systems.
35-41
- John C. Kieffer:
Uniqueness of locally optimal quantizer for log-concave density and convex error weighting function.
42-46
- Carl W. Helstrom:
Comparative performance of quantum signals in unimodal and bimodal binary optical communications.
47-59
- Rangasami L. Kashyap, Ramalingam Chellappa:
Estimation and choice of neighbors in spatial-interaction models of images.
60-72
- G. W. Lank:
Theoretical aspects of importance sampling applied to false alarms.
73-82
- Stamatis Cambanis, Elias Masry:
Sampling designs for the detection of signals in noise.
83-104
- R. A. Boyles, William A. Gardner:
Cycloergodic properties of discrete- parameter nonstationary stochastic processes.
105-113
- Tadao Kasami, Shu Lin, Victor K.-W. Wei, Saburo Yamamura:
Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel.
114-130
Correspondence
- Tadao Kasami, Torleiv Kløve, Shu Lin:
Linear block codes for error detection.
131-
- L. R. Vermani, S. L. Jindal:
A note on maximum distance separable (optimal) codes.
136-
- John H. Conway, Vera Pless:
Monomials of orders 7 and 11 cannot be in the group of a (24, 12, 10) self-dual quaternary code.
137-
- Federico Kuhlmann, James A. Bucklew, Gary L. Wise:
Compressors for combined source and channel coding with applications to the generalized Gaussian family.
140-
- Richard A. Games, Agnes Hui Chan:
A fast algorithm for determining the complexity of a binary sequence with period 2n.
144-
- Ehud D. Karnin, Martin E. Hellman:
The largest super-increasing subset of a random set.
146-
- David Avis, Hossam A. ElGindy:
A combinational approach to polygon similarity.
148-
- Yoichiro Watanabe:
An algorithm for determining all the optimal input probability distributions of the DMC.
151-
- Tamer Basar:
The Gaussian test channel with an intelligent jammer.
152-
- John J. Knab:
The sampling window.
157-
- Benjamin Kedem:
A two-dimensional higher order crossings theorem.
159-
- A. Arcese:
On the method of maximum entropy spectrum estimation.
161-
- Jitendra K. Tugnait:
Parameter estimation and linear system identification with randomly interrupted observations.
164-
- R. J. Kenefic, Donald D. Weiner:
Asymptotic receiver operating characteristics for envelope detection of a phase modulated sinusoid.
168-
- Jaakko Astola, A. E. Kananen:
Signal sets derived from Steiner systems.
171-
- Gustav Solomon, M. M. Sweet:
A Golay puzzle.
174-
Reviews and Abstracts
- Sergio Verdú:
A general approach to minimax robust filtering (M.S. Thesis abstr.).
175-
Volume 29,
Number 2,
March 1983
Papers
Correspondence:
Reviews and Abstracts
- Bradley W. Dickinson:
Review of 'CISM Courses and Lectures No. 140' (Kailath, T.; 1981).
321
- Neil J. A. Sloane:
Review of 'New Concepts in Multi-User Communication' (Skwirzynski, J.K., Ed.; 1982).
321
- Michael A. Kaplan:
Review of 'Analysis and Synthesis of Computer Systems' (Gelenbe, E., and Mitrani, I.; 1980).
322
- Michael J. Ferguson:
Review of 'Communication Protocol Modelling' (Sunshine, C.; 1981).
323
Volume 29,
Number 3,
May 1983
Editorial
Papers
- Cornelius Roos:
A new lower bound for the minimum distance of a cyclic code.
330-331
- A. Robert Calderbank:
A square root bound on the minimum weight in quasi-cyclic codes.
332-336
- Harold N. Ward:
Divisors of codeword weights.
337-341
- R. D. Baker, Jacobus H. van Lint, Richard M. Wilson:
On the Preparata and Goethals codes.
342-344
- William M. Kantor:
On the inequivalence of generalized Preparata codes.
345-348
- M. R. Best:
Perfect codes hardly exist.
349-351
- Gérard D. Cohen:
A nonconstructive upper bound on covering radius.
352-353
- Nick J. Patterson, Douglas H. Wiedemann:
The covering radius of the (215, 16) Reed-Muller code is at least 16276.
354-355
- H. F. Mattson Jr.:
Another upper bound on covering radius.
356-358
- E. F. Assmus Jr., Vera Pless:
On the coveting radius of extremal self-dual codes.
359-363
- Neil J. A. Sloane, John G. Thompson:
Cyclic self-dual codes.
364-366
- E. F. Assmus Jr.:
The binary code arising from a 2-design with a nice collection of ovals.
367-369
- Andries E. Brouwer:
On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code.
370-371
- Elwyn R. Berlekamp:
The construction of fast, high-rate, soft decision block decoders.
372-377
- Paul Camion:
Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials.
378-385
- Henk C. A. van Tilborg:
Upper bounds on |C2| for a uniquely decodable code pair (C1, C2) for a two-access binary adder channel.
386-389
- Thomas H. E. Ericson, János Körner:
Successive encoding of correlated sources.
390-395
- Rudolf Ahlswede, Te Sun Han:
On source coding with side information via a multiple-access channel and related problems in multi-user information theory.
396-411
- Boaz Porat, Benjamin Friedlander:
Estimation of spatial and spectral parameters of multiple sources.
412-425
- A. F. Gualtierotti:
On the stability of signal detection.
426-433
- Tor Helleseth:
New constructions of codes meeting the Griesmer bound.
434-438
Correspondence
Volume 29,
Number 4,
July 1983
Papers
- John E. Shore, D. K. Burton:
Discrete utterance speech recognition without time alignment.
473-490
- Peter Elias:
Minimax optimal universal codeword sets.
491-501
- J. L. Martins de Carvalho, J. M. C. Clark:
Characterizing the autocorrelations of binary sequences.
502-508
- R. S. Bucy, José M. F. Moura, A. J. Mallinckrodt:
A Monte Carlo study of absolute phase determination.
509-520
- Alexander Drukarev, Daniel J. Costello Jr.:
Hybrid ARQ error control using sequential decoding.
521-535
- Georg Lindgren:
On the shape and duration of FM-clicks.
536-542
- Andrew J. Viterbi, Audrey M. Viterbi:
Nonlinear estimation of PSK-modulated carrier phase with application to burst digital transmission.
543-550
- Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel:
On the shape of a set of points in the plane.
551-558
- Hiroyoshi Morita, Suguru Arimoto:
SECT - A coding technique for black/white graphics.
559-569
- Peter F. Swaszek, John B. Thomas:
Multidimensional spherical coordinates quantization.
570-575
- Dimitri Kazakos:
Robust noiseless source coding through a game theoretical approach.
576-582
- Meghanad D. Wagh, Salvatore D. Morgera:
A new structured design method for convolutions over finite fields, Part I.
583-594
Correspondence
Reviews and Abstracts
- Ian F. Blake:
Review of 'Introduction to the Theory of Error-Correcting codes' (Pless, V.; 1982).
63
- Peter A. Galko:
Generalized MSK (Ph.D. Thesis abstr.).
631
- Yücel Melek:
A novel approach to noniterative methods in adaptive channel equalization (Ph.D. Thesis abstr.).
631
- Rushdi H. Muammar:
Frequency-hopped multilevel frequency shift keying spread spectrum for mobile radio communication systems (Ph.D. Thesis abstr.).
631
- Vincent C. Vannicola:
'Modelling and Properties of Modulated RF Signals Perturbed by Oscillator Phase Instabilities and Resulting Spectral Dispersion'.
631
- Glenn D. Marcus:
Multiple access protocols with limited information for a finite number of users (Ph.D. Thesis abstr.).
632
- Khalid Sayood:
An algorithm for designing vector quantizers (Ph.D. Thesis abstr.).
632
- Wayne E. Stark:
Coding for frequency-hopped spread-spectrum channels with partial-band interference (Ph.D. Thesis abstr.).
632
- Kenneth S. Vastola:
Topics in robust statistical signal processing (Ph.D. Thesis abstr.).
632
Volume 29,
Number 5,
September 1983
Papers
Correspondence
- K. H. Farrell, Luther D. Rudolph, Carlos R. P. Hartmann, L. D. Nielsen:
Decoding by local optimization.
740-
- Hatsukazu Tanaka, Koji Kakigahara:
Simplified correlation decoding by selecting possible codewords using erasure information.
743-
- Jacques Wolfmann:
A permutation decoding of the (24, 12, 8) Golay code.
748-
- M. Mooser:
Some periodic convolutional codes better than any fixed code.
750
- G. F. M. Beenker, Kees A. Schouhamer Immink:
A generalized method for encoding and decoding run-length-limited binary sequences.
751-
- D. H. Lee:
On the source matching approach for Markov sources.
754-
- T. T. Kadota, Judith B. Seery:
Probability distributions of randomly moving objects on a plane.
756-
- A. Fogel:
Detection in a Rice environment.
761-
- R. J. Webster:
Formulas which approximate the distribution of a sinusoid plus noise.
765-
- D. Ryter:
A method for computing the rate and the correlation of phase slips in tuned phase tracking systems of arbitrary order.
768-
- M. Ohya:
On compound state and mutual information in quantum information theory.
770-
- M. Schlatter, James L. Massey:
Capacity of interconnected ring communication systems with unique loop-free routing.
774-
- Glen G. Langdon Jr., Jorma Rissanen:
Correction to 'A simple general binary source code' (Sep 82 800-803).
778-
Reviews and Abstracts
- Godfried T. Toussaint:
Review of 'Progress in Pattern Recognition' (Kanal, L.N., and Rosenfeld, A., Eds.; 1981).
779-
Volume 29,
Number 6,
November 1983
Papers
Correspondence
Reviews and Abstracts
- Sabah A. Al-Quaddoomi:
Two-Dimensional Binary Codes with Good Autocorrelation.
943
- Alex Netch:
Pairwise phase-locked loop coupling for tracking improvement in nonrigid retrodirective arrays (Ph.D. Thesis abstr.).
943
- Priyadarshan Jakatdar:
Optimal encoding of stationary Gaussian sources with applications in image coding (Ph.D. Thesis abstr.).
944
- Baruch Mazor:
Optimal tree and trellis codes for stationary Gaussian sources (Ph.D. Thesis abstr.).
944
Copyright © Tue Dec 1 16:37:28 2009
by Michael Ley (ley@uni-trier.de)
