Journal: IEEE Transactions on Information Theory

Volume 29, Issue 6

785 -- 792Takeshi Hashimoto. Source coding for average rate and average distortion: New variable-length coding theorems
793 -- 797John C. Kieffer, James George Dunham. On a type of stochastic stability for a class of encoding schemes
798 -- 806Jan-Erik Stjernvall. Dominance - A relation between distortion measures
807 -- 813Toby Berger, Zhen Zhang. Minimum breakdown degradation in binary source encoding
814 -- 819Jean C. Walrand, Pravin Varaiya. Optimal causal coding - decoding problems
820 -- 824John H. Conway, Neil J. A. Sloane. A fast encoding method for lattice codes and quantizers
825 -- 830Jean C. Walrand. A probabilistic look at networks of quasi-reversible queues
831 -- 842Chris Heegard. Partitioned linear block codes for computer memory with stuck-at defects
843 -- 849Richard A. Games. A generalized recursive construction for de Bruijn sequences
850 -- 853Christian Thommesen. The existence of binary linear concatenated codes with Reed - Solomon outer codes which asymptotically meet the Gilbert- Varshamov bound
854 -- 862P. Vijay Kumar, Robert A. Scholtz. Bounds on the linear span of bent sequences
863 -- 865Shimon Even, Oded Goldreich. DES-like functions can generate the alternating group
866 -- 876Wil J. van Gils. Two topics on linear unequal error protection codes: Bounds on their length and cyclic code classes
877 -- 893Gilles Brassard. Relativized cryptography
894 -- 901J. Silverman, V. E. Vickers, J. L. Sampson. Statistical estimates of the n-bit Gray codes by restricted random generation of permutations of 1 to 2:::n:::
902 -- 909Kiran M. Rege. Min-max linear estimation of band-limited sequences from noisy observations - A deterministic approach
910 -- 913. Pretested Random Tree Protocol for Packet Conflict Resolution
914 -- 0Aurel A. Lazar. The throughput time delay function of an M/M/1 queue
918 -- 0Hirosuke Yamamoto. A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers
924 -- 0Baruch Mazor, William A. Pearlman. A trellis code construction and coding theorem for stationary Gaussian sources
930 -- 0Thomas M. Cover, Abbas A. El Gamal. An information - theoretic proof of Hadamard s inequality
931 -- 0Abbas A. El Gamal. A simple proof of the Ahlswede - Csiszár one-bit theorem
933 -- 0Michele Elia. Some results on the existence of binary linear codes
934 -- 0Marcel J. E. Golay. The merit factor of Legendre sequences
936 -- 0James A. Wiseman. New binary codes constructed by an old technique
937 -- 0V. Z. Marmarelis. Practical estimation of correlation functions of nonstationary Gaussian processes
939 -- 0Bahaa E. A. Saleh, Malvin Carl Teich. Statistical properties of a nonstationary Neyman - Scott cluster process
942 -- 0Rodney W. Johnson, John E. Shore. Comments on and correction to Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy (Jan 80 26-37)
944 -- 0Priyadarshan Jakatdar. Optimal encoding of stationary Gaussian sources with applications in image coding (Ph.D. Thesis abstr.)
944 -- 0Baruch Mazor. Optimal tree and trellis codes for stationary Gaussian sources (Ph.D. Thesis abstr.)

Volume 29, Issue 5

637 -- 649Christian Thommesen, Jørn Justesen. Bounds on distances and error exponents of unit memory codes
650 -- 655Takeshi Hashimoto. Tree encoding of stationary ergodic sources with a fidelity criterion
656 -- 663Jorma Rissanen. A universal data compression system
664 -- 676Stamatis Cambanis, Neil L. Gerr. A simple class of asymptotically optimal quantizers
677 -- 687Harold Vincent Poor. Robust matched filters
688 -- 695J. M. Potter, Brian D. O. Anderson. Statistical inference with partial prior information
696 -- 708Elias Masry. Probability density estimation from sampled data
709 -- 723Michèle Basseville, Albert Benveniste. Sequential detection of abrupt changes in spectral characteristics of digital signals
724 -- 730I. G. Gowda, David G. Kirkpatrick, D. T. Lee, Amnon Naamad. Dynamic Voronoi diagrams
731 -- 739Chris Heegard, Abbas A. El Gamal. On the capacity of computer memory with defects
740 -- 0K. H. Farrell, Luther D. Rudolph, Carlos R. P. Hartmann, L. D. Nielsen. Decoding by local optimization
743 -- 0Hatsukazu Tanaka, Koji Kakigahara. Simplified correlation decoding by selecting possible codewords using erasure information
748 -- 0Jacques Wolfmann. A permutation decoding of the (24, 12, 8) Golay code
750 -- 0M. Mooser. Some periodic convolutional codes better than any fixed code
751 -- 0G. F. M. Beenker, Kees A. Schouhamer Immink. A generalized method for encoding and decoding run-length-limited binary sequences
754 -- 0D. H. Lee. On the source matching approach for Markov sources
756 -- 0T. T. Kadota, Judith B. Seery. Probability distributions of randomly moving objects on a plane
761 -- 0A. Fogel. Detection in a Rice environment
765 -- 0R. J. Webster. Formulas which approximate the distribution of a sinusoid plus noise
768 -- 0D. Ryter. A method for computing the rate and the correlation of phase slips in tuned phase tracking systems of arbitrary order
770 -- 0M. Ohya. On compound state and mutual information in quantum information theory
774 -- 0M. Schlatter, James L. Massey. Capacity of interconnected ring communication systems with unique loop-free routing
778 -- 0Glen G. Langdon Jr., Jorma Rissanen. Correction to A simple general binary source code (Sep 82 800-803)
779 -- 0Godfried T. Toussaint. Review of Progress in Pattern Recognition (Kanal, L.N., and Rosenfeld, A., Eds.; 1981)

Volume 29, Issue 4

63 -- 0Ian F. Blake. Review of Introduction to the Theory of Error-Correcting codes (Pless, V.; 1982)
473 -- 490John E. Shore, D. K. Burton. Discrete utterance speech recognition without time alignment
491 -- 501Peter Elias. Minimax optimal universal codeword sets
502 -- 508J. L. Martins de Carvalho, J. M. C. Clark. Characterizing the autocorrelations of binary sequences
509 -- 520R. S. Bucy, José M. F. Moura, A. J. Mallinckrodt. A Monte Carlo study of absolute phase determination
521 -- 535Alexander Drukarev, Daniel J. Costello Jr.. Hybrid ARQ error control using sequential decoding
536 -- 542Georg Lindgren. On the shape and duration of FM-clicks
543 -- 550Andrew J. Viterbi, Audrey M. Viterbi. Nonlinear estimation of PSK-modulated carrier phase with application to burst digital transmission
551 -- 558Herbert Edelsbrunner, David G. Kirkpatrick, Raimund Seidel. On the shape of a set of points in the plane
559 -- 569Hiroyoshi Morita, Suguru Arimoto. SECT - A coding technique for black/white graphics
570 -- 575Peter F. Swaszek, John B. Thomas. Multidimensional spherical coordinates quantization
576 -- 582Dimitri Kazakos. Robust noiseless source coding through a game theoretical approach
583 -- 594Meghanad D. Wagh, Salvatore D. Morgera. A new structured design method for convolutions over finite fields, Part I
595 -- 0Charles P. Downey, John K. Karlof. Group codes for the M-receiver Gaussian broadcast channel
597 -- 0Tom Høholdt, Jørn Justesen. Ternary sequences with perfect periodic autocorrelation
600 -- 0Unjeng Cheng, Solomon W. Golomb. On the characteristics of PN sequences
600 -- 0J. Martin Borden. A low-rate bound for asymmetric error-correcting codes
602 -- 0Aydano B. Carleial. Outer bounds on the capacity of interference channels
606 -- 0R. Sorace. Trellis coding for a multiple-access channel
612 -- 0M. Krzysko. The discriminant analysis of multivariate time series
614 -- 0George V. Moustakides, Saleem A. Kassam. Robust Wiener filters for random signals in correlated noise
619 -- 0R. Jalalinasab, James A. Bucklew. A simple suboptimum estimator of prior probability in mixtures
621 -- 0Joseph L. Hibey. Stochastic reliability functions for failure rates derived from Gauss - Markov processes
624 -- 0Uzi Vishkin. An efficient distributed orientation algorithm
629 -- 0Rangasami L. Kashyap, Ramalingam Chellappa. Correction to Estimation and choice of Neighbors in Spatial-Interaction Models of Images
631 -- 0Peter A. Galko. Generalized MSK (Ph.D. Thesis abstr.)
631 -- 0Vincent C. Vannicola. Modelling and Properties of Modulated RF Signals Perturbed by Oscillator Phase Instabilities and Resulting Spectral Dispersion
631 -- 0Yücel Melek. A novel approach to noniterative methods in adaptive channel equalization (Ph.D. Thesis abstr.)
631 -- 0Rushdi H. Muammar. Frequency-hopped multilevel frequency shift keying spread spectrum for mobile radio communication systems (Ph.D. Thesis abstr.)
632 -- 0Khalid Sayood. An algorithm for designing vector quantizers (Ph.D. Thesis abstr.)
632 -- 0Glenn D. Marcus. Multiple access protocols with limited information for a finite number of users (Ph.D. Thesis abstr.)
632 -- 0Kenneth S. Vastola. Topics in robust statistical signal processing (Ph.D. Thesis abstr.)
632 -- 0Wayne E. Stark. Coding for frequency-hopped spread-spectrum channels with partial-band interference (Ph.D. Thesis abstr.)

Volume 29, Issue 3

329 -- 0Neil J. A. Sloane. Papers in honor of F. Jessie MacWilliams
330 -- 331Cornelius Roos. A new lower bound for the minimum distance of a cyclic code
332 -- 336A. Robert Calderbank. A square root bound on the minimum weight in quasi-cyclic codes
337 -- 341Harold N. Ward. Divisors of codeword weights
342 -- 344R. D. Baker, Jacobus H. van Lint, Richard M. Wilson. On the Preparata and Goethals codes
345 -- 348William M. Kantor. On the inequivalence of generalized Preparata codes
349 -- 351M. R. Best. Perfect codes hardly exist
352 -- 353Gérard D. Cohen. A nonconstructive upper bound on covering radius
354 -- 355Nick J. Patterson, Douglas H. Wiedemann. The covering radius of the (2:::15:::, 16) Reed-Muller code is at least 16276
356 -- 358H. F. Mattson Jr.. Another upper bound on covering radius
359 -- 363E. F. Assmus Jr., Vera Pless. On the coveting radius of extremal self-dual codes
364 -- 366Neil J. A. Sloane, John G. Thompson. Cyclic self-dual codes
367 -- 369E. F. Assmus Jr.. The binary code arising from a 2-design with a nice collection of ovals
370 -- 371Andries E. Brouwer. On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code
372 -- 377Elwyn R. Berlekamp. The construction of fast, high-rate, soft decision block decoders
378 -- 385Paul Camion. Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials
386 -- 389Henk C. A. van Tilborg. Upper bounds on |C::2::| for a uniquely decodable code pair (C::1::, C::2::) for a two-access binary adder channel
390 -- 395Thomas H. E. Ericson, János Körner. Successive encoding of correlated sources
396 -- 411Rudolf Ahlswede, Te Sun Han. On source coding with side information via a multiple-access channel and related problems in multi-user information theory
412 -- 425Boaz Porat, Benjamin Friedlander. Estimation of spatial and spectral parameters of multiple sources
426 -- 433A. F. Gualtierotti. On the stability of signal detection
434 -- 438Tor Helleseth. New constructions of codes meeting the Griesmer bound
439 -- 0Max H. M. Costa. Writing on dirty paper
441 -- 0Frans M. J. Willems. The discrete memoryless multiple access channel with partially cooperating encoders
445 -- 0J. Pieter M. Schalkwijk. On an extension of an achievable rate region for the binary multiplying channel
448 -- 0Gadiel Seroussi, Abraham Lempel. Maximum likelihood decoding of certain Reed - Muller codes
454 -- 0Luigi M. Ricciardi, Shunsuke Sato. A note on first passage time problems for Gaussian processes and varying boundaries
457 -- 0J. Glaz. Moving window detection for discrete data
462 -- 0Ning Hsing Lu, Bruce A. Eisenstein. Suboptimum detection of weak signals in non-Gaussian noise
466 -- 0S. P. Bruzzone, Mostafa Kaveh. A criterion for selecting information- preserving data reductions for use in the design of multiple-parameter estimators

Volume 29, Issue 2

181 -- 189Joseph O Rourke, Kenneth J. Supowit. Some NP-hard polygon decomposition problems
190 -- 197Andrea Sgarro. Error probabilities for simple substitution ciphers
198 -- 207Danny Dolev, Andrew Chi-Chih Yao. On the security of public key protocols
208 -- 210Charles Asmuth, John Bloom. A modular approach to key safeguarding
211 -- 214Lee D. Davisson. Minimax noiseless universal coding for Markov sources
215 -- 223Gérald E. Séguin. On a class of convolutional codes
224 -- 232Philippe Piret, Thijs Krol. MDS convolutional codes
233 -- 240Frederick J. Beutler. Mean sojourn times in Markov queueing networks: Little s formula revisited
241 -- 244T. T. Kadota. Piecewise linear random paths on a plane and a central limit theorem
245 -- 255Philip M. Fishman, L. K. Jones, Charles W. Therrien. The design of masking processes by the method of minimal divergence
256 -- 267John Charles Cartledge. Measures of information for continuous observations
268 -- 278Philippe Delsarte, Yves V. Genin, Y. Kamp. A polynomial approach to the generalized Levinson algorithm based on the Toeplitz distance
279 -- 0M. L. Sethia, John B. Anderson. Low-rate tree coding of autoregressive sources
279 -- 0James A. Bucklew. A note on optimal multidimensional companders
284 -- 0Glen G. Langdon Jr.. A note on the Ziv-Lempel model for compressing individual sequences
287 -- 0Frans M. J. Willems, Edward C. van der Meulen. Partial feedback for the discrete memoryless multiple access channel
291 -- 0A. Q. Rajput, Morton Kanefsky. On evaluating polarity-coincidence correlation when the two inputs are statistically dependent
296 -- 0A. Fogel, Stuart C. Schwartz. Limiting forms of the discrete-time estimator- correlator detector
299 -- 0Larry C. Andrews, Clay S. Brice. The pdf and cdf for the sum of N filtered outputs of an analog cross correlator with bandpass inputs
306 -- 311Frederick M. Davidson, Y. C. Park. Optimal point process estimators of Gaussian optical field intensities
311 -- 0S. Holm. Spectral moment matching in the maximum entropy spectral analysis method
314 -- 0P. L. Butzer, Wolfgang Engels. On the implementation of the Shannon sampling series for band-limited signals
318 -- 0Lazaros F. Merakos, Dimitri Kazakos. Comments and corrections to New convergence bounds for Bayes estimators by D. Kazakos
320 -- 0John H. Park Jr.. Author s Reply to Comments on Inductive Proof of an Important Inequality
320 -- 0Eu Yangchi, J. Wang. Comments on Inductive proof of an important inequality
321 -- 0Neil J. A. Sloane. Review of New Concepts in Multi-User Communication (Skwirzynski, J.K., Ed.; 1982)
321 -- 0Bradley W. Dickinson. Review of CISM Courses and Lectures No. 140 (Kailath, T.; 1981)
322 -- 0Michael A. Kaplan. Review of Analysis and Synthesis of Computer Systems (Gelenbe, E., and Mitrani, I.; 1980)
323 -- 0Michael J. Ferguson. Review of Communication Protocol Modelling (Sunshine, C.; 1981)

Volume 29, Issue 1

5 -- 22Roy L. Adler, Don Coppersmith, Martin Hassner. Algorithms for sliding block codes - An application of symbolic dynamics to information theory
23 -- 34Adrian Segall. Distributed network protocols
35 -- 41Ehud D. Karnin, J. W. Greene, Martin E. Hellman. On secret sharing systems
42 -- 46John C. Kieffer. Uniqueness of locally optimal quantizer for log-concave density and convex error weighting function
47 -- 59Carl W. Helstrom. Comparative performance of quantum signals in unimodal and bimodal binary optical communications
60 -- 72Rangasami L. Kashyap, Ramalingam Chellappa. Estimation and choice of neighbors in spatial-interaction models of images
73 -- 82G. W. Lank. Theoretical aspects of importance sampling applied to false alarms
83 -- 104Stamatis Cambanis, Elias Masry. Sampling designs for the detection of signals in noise
105 -- 113R. A. Boyles, William A. Gardner. Cycloergodic properties of discrete- parameter nonstationary stochastic processes
114 -- 130Tadao 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
131 -- 0Tadao Kasami, Torleiv Kløve, Shu Lin. Linear block codes for error detection
137 -- 0John H. Conway, Vera Pless. Monomials of orders 7 and 11 cannot be in the group of a (24, 12, 10) self-dual quaternary code
140 -- 0Federico Kuhlmann, James A. Bucklew, Gary L. Wise. Compressors for combined source and channel coding with applications to the generalized Gaussian family
144 -- 0Richard A. Games, Agnes Hui Chan. A fast algorithm for determining the complexity of a binary sequence with period 2:::n:::
146 -- 0Ehud D. Karnin, Martin E. Hellman. The largest super-increasing subset of a random set
148 -- 0David Avis, Hossam A. ElGindy. A combinational approach to polygon similarity
151 -- 0Yoichiro Watanabe. An algorithm for determining all the optimal input probability distributions of the DMC
152 -- 0Tamer Basar. The Gaussian test channel with an intelligent jammer
157 -- 0John J. Knab. The sampling window
159 -- 0Benjamin Kedem. A two-dimensional higher order crossings theorem
161 -- 0A. Arcese. On the method of maximum entropy spectrum estimation
164 -- 0Jitendra K. Tugnait. Parameter estimation and linear system identification with randomly interrupted observations
168 -- 0R. J. Kenefic, Donald D. Weiner. Asymptotic receiver operating characteristics for envelope detection of a phase modulated sinusoid
171 -- 0Jaakko Astola, A. E. Kananen. Signal sets derived from Steiner systems
174 -- 0Gustav Solomon, M. M. Sweet. A Golay puzzle
175 -- 0Sergio Verdú. A general approach to minimax robust filtering (M.S. Thesis abstr.)