Information and Control, Volume 13

Volume 13, Number 1, 1968

Arthur T. Pu:
Generalized Decomposition of Incomplete Finite Automata. 1-19
W. E. Hartnett:
Generalization of Tests for Certain Properties of Variable-Length Codes. 20-45
Aaron D. Wyner, Ronald L. Graham:
An Upper Bound on Minimum Distance for a k-ary Code. 46-52
Kazuo Horiuchi:
Sampling Principle for Continuous Signals with Time-Varying Bands. 53-61
Tyrone E. Duncan:
Evaluation of Likelihood Functions. 62-74
H. Tanaka, M. Kasahara, Y. Tezuka, Y. Kasahara:
Computation over Galois Fields Using Shiftregisters. 75-84

Arto Salomaa:
On Finite Automata with a Time-Variant Structure. 85-98
T. T. Nieh:
Stochastic Sequential Machines with Prescribed Performance Criteria. 99-113
John E. Hopcroft, Jeffrey D. Ullman:
Sets Accepted by One-Way Stack Automata Are Context Sensitive. 114-133
Edward L. Cohen, Shimshon Berkovits:
Exponential Distributions in Markov Chain Models for Communication Channels. 134-139
Raymond T. Yeh:
On Relational Homomorphisms of Automata. 140-155
Carl W. Helstrom:
Detection Theory and Quantum Mechanics (II). 156-171

C. E. Hutchinson, Y. T. Chon, R. A. Leuchs:
An Analysis of the Effect of Integral and Sigma Pulse Frequency Modulation on White Noise. 173-185
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
Time and Tape Complexity of Pushdown Automaton Languages. 186-206
Neil D. Jones:
Classes of Automata and Transitive Closure. 207-229
Jerome Feder:
Languages of Encoded Line Patterns. 230-244
Kojiro Kobayashi:
Some Unsolvable Problems on Context-Free Languages and Their Application to On-Line Language Recognizers. 245-253
Toby Berger:
Rate Distortion Theory for Sources with Abstract Alphabets and Memory. 254-273
Hiroshi Sato:
A Note on Stationary of Some Random Processes. 274-279

Wai-hung Ng, Paul E. Pfeiffer:
Minimum-Hamming-Distance Decoding of Single-Generator Binary Convolutional Codes. 195-315
P. Balasubrahmanyam, Gift Siromoney:
A Note on Entropy of Telugu Prose. 281-285
Brian D. O. Anderson, John B. Moore:
Optimal State Estimation in High Noise. 286-294
J. D. Simon, Sanjoy K. Mitter:
A Theory of Modal Control. 316-353
E. J. Weldon Jr.:
A Note on Synchronization Recovery with Extended Cyclic Codes. 354-356
Sudhakar M. Reddy:
Further Results on Convolutional Codes Derived from Block Codes. 357-362
Eugene S. Santos:
Maximin Automata. 363-377
Franco P. Preparata:
A Class of Optimum Nonlinear Double-Error-Correcting Codes. 378-400

Henry D. Chadwick, Ludwik Kurz:
Two Sequential Nonparametric Detection Procedures. 403-428
David M. Mandelbaum:
A Note on Synchronizable Error-Correcting Codes. 429-432
Michael A. Harrison, Oscar H. Ibarra:
Multi-Tape and Multi-Head Pushdown Automata. 433-470
David K. Chow:
On Threshold Decoding of Cyclic Codes. 471-483
Walter S. Brainerd:
The Minimalization of Tree Automata. 484-491

K. Mani Chandy, C. V. Ramamoorthy:
Optimization of Information Storage Systems. 509-526
Irving L. Traiger, A. Gill:
On an Asymptotic Optimization Problem in Finite, Directed, Weighted Graphs. 527-533
Thomas Kailath:
A Note on Least-Squares Estimates from Likelihood Ratios. 534-540
Neal Zierler, John Brillhart:
On Primitive Trinomials (Mod 2). 541-554
Yoshiko Takenaka:
On the Existence of a Hamiltonian Path in a Graph. 555-564
C. Pair, Alain Quéré:
Définition et Etude des Bilangages Réguliers. 565-593
Udo Augustin:
The Capacity of the Product Channel. 594-596
Douglas C. Bossen, S. S. Yau:
Redundant Residue Polynomial Codes. 597-618
Ronald Alter:
On the Non-Existence of Perfect Double Hamming-Error-Correcting Codes on q = 8 and q = 9 Symbols. 619-627

Last update Fri May 24 20:21:51 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page