default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Control, Volume 4
Volume 4, Number 1, 1961
- Ranan B. Banerji:
On Constructing Group Codes. 1-14 - William L. Root:
Communications through Unspecified Additive Noise. 15-29 - Richard F. Whitbeck:
Phase Plane Analysis: The Application of Lienard's Construction to a Particularly Important Second Order Differential Equation. 30-47 - Charles P. Bourne, Donald F. Ford:
A Study of the Statistics of Letters in English Words. 48-67 - Jay M. Berger:
A Note on Error Detection Codes for Asymmetric Channels. 68-73
Volume 4, Number 2-3, 1961
- Frederick J. Beutler:
Sampling Theorems and Bases in a Hilbert Space. 97-117 - Richard Bellman, Brian Gluss:
On Various Versions of the Defective Coin Problem. 118-131 - Arthur Gill:
Sate-Identification Experiments in Finite Automata. 132-154 - Colin Cherry, Peter K. T. Vaswani:
A New Type of Computer for Problems in Propositional Logic, with Greatly Reduced Scanning Procedures. 155-168 - Harry Kesten:
Some Remarks on the Capacity of Compound Channels in the Semicontinuous Case. 169-184 - Marcel Paul Schützenberger:
A Remark on Finite Transducers. 185-196 - H. W. Tuffill:
A Note on Recognition of Hand-Printed Characters. 197 - Benoit Mandelbrot:
Final Note on a Class of Skew Distribution Functions: Analysis and Critique of a Mode Due to H. A. Simon. 198-216 - Herbert A. Simon:
Reply to "Final Note" by Benoit Mandelbrot. 217-223 - Marcel Paul Schützenberger:
On the Definition of a Family of Automata. 245-270 - I. J. Good:
Amount of Deciding and Decisionary Effort. 271-281 - Philip M. Lewis II:
A Note on Realization of Decision Networks Using Summation Elements. 282-290 - Satosi Watanabe:
A Note on the Formation of Concept and of Association by Information-Theoretical Correlation Analysis. 291-296 - Jay M. Berger:
A Note on Burst Detecting Sum Codes. 297-299 - Benoit Mandelbrot:
Post Scriptum to "Final Note". 300-304 - Herbert A. Simon:
Reply to Dr. Mandelbrot's Post Scriptum. 305-308
Volume 4, Number 4, 1961
- R. P. Bambah, D. D. Joshi, Indar S. Luthar:
Some Lower Bounds on the Number of Code Points in a Minimum Distance Binary Code. I. 313-319 - R. P. Bambah, D. D. Joshi, Indar S. Luthar:
Some Lower Bounds on the Number of Code Points in a Minimum Distance Binary Code. II. 320-323 - Jeremy I. Stone:
Multiple Burst Error Correction. 324-331 - Vincent E. Giuliano, Paul E. Jones Jr., George E. Kimball, Richard F. Meyer, Barry A. Stein:
Automatic Pattern Recognition by a Gestalt Method. 332-345 - Richard Bellman, Robert Kalaba:
A Note on Interrupted Stochastic Control Processes. 346-349 - Lotfi A. Zadeh:
Remark on the Paper by Bellman and Kalaba. 350-352 - Robert W. Floyd:
A Note on Mathematical Induction on Phrase Structure Grammars. 353-358 - Lorenzo Calabi:
A Note on Rank and Nullity in Coding Theory. 359-363 - Gustave Solomon:
A Note on a New Class of Codes. 364-370 - C. Rajski:
A Metric Space of Discrete Probability Distributions. 371-377
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-20 00:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
