Aaron D. Wyner - Publications

  1. Low-Density-Burst-Correcting Codes, A. D. Wyner, IEEE Trans. on Information Theory, IT-9:2 (April 1963), page 124.
  2. Some Results on Burst-Correcting Recurrent Codes, A. D. Wyner, IEEE International Convention Record, part 4 (1963), pp. 139-152.
  3. Analysis of Recurrent Codes, A. D. Wyner and R. B. Ash, IEEE Trans. on Information Theory, IT-9:3 (July 1963), pp. 143-156.
  4. A Note on a Class of Binary Cyclic Codes Which Correct Solid-Burst Errors, A. D. Wyner, IBM J. Research and Development, 8:1 (January 1964), pp. 68-69.
  5. Book Review - Affine M-ary Gray Codes, by Cohn and Martin, A. D. Wyner, IEEE Trans. on Electronic Computers, Ec-13 (1964), pp. 317-318.
  6. An Improved Error-Bound for Gaussian Channels, A. D. Wyner, Bell Sys. Tech. J., 42 (1964), pp. 3070-3075.
  7. Introduction to Information Theory, A. D. Wyner, Proc. Elec. Eng. Workshop, Amer. Soc. Eng. Educ., 1964.
  8. Optimum Block Codes for Noiseless Input Restricted Channels, A. D. Wyner and C. V. Freiman, Information and Control, September 1964, pp. 398-415.
  9. Redundancy Requirements for the Correction of Finite State Error Patterns, A. D. Wyner, C. V. Freiman and J. P. Robinson, Proc. National Electronics Conference, 1964, pp. 687-692.
  10. Capabilities of Bounded Discrepancy Decoding, A. D. Wyner, Bell Sys. Tech. J., 43 (July-August 1965), pp. 1061-1122.
  11. On the Equivalence of Two Recurrent Code Definitions, A. D. Wyner, IEEE Trans. on Information Theory, IT-11:4 (October 1965), pp. 600-602.
  12. The Capacity of the Band-Limited Gaussian Channel, A. D. Wyner, Bell Sys. Tech. J., 45 (March 1966), pp. 359-395.
  13. Bounds on Communication with Polyphase Coding, A. D. Wyner, Bell Sys. Tech. J., 45 (April 1966), pp. 523-559.
  14. Capacity of the Product of Channels, A. D. Wyner, Information and Control, 9:4 (August 1966), pp. 423-430.
  15. Random Packings and Coverings of the Unit N-Sphere, A. D. Wyner, Bell Sys. Tech. J., 46 (1967), pp. 2111-2118.
  16. On the Probability of Error for Communication in the Presence of White Gaussian Noise, A. D. Wyner, IEEE Trans. on Information Theory, It-13 (January 1967), pp. 86-90.
  17. An Upper Bound on Minimum Distance for a k-ary Code, A. D. Wyner and R. L. Graham, Information and Control, 13 (1968), pp. 46-52.
  18. On the Schalkwijk-Kailath Coding Scheme with a Peak Energy Constraint, A. D. Wyner, IEEE Trans. on Information Theory, IT-14 (January 1968), pp. 129-134.
  19. Communication of Analog Data from a Gaussian Source Over a Noisy Channel, A. D. Wyner, Bell Sys. Tech. J., 47 (May-June 1968), pp. 801-812.
  20. On Binary Communication Over the Gaussian Channel Using Feedback with a Peak Energy Constraint, L. A. Shepp, J. K. Wolf, A. D. Wyner and J. Ziv, IEEE Trans. on Information Theory, IT-15 (1969), pp. 476-478.
  21. On the Asymptotic Distribution of a Certain Functional of the Wiener Process, A. D. Wyner, Ann. Math. Statist., 40 (1969), pp. 1409-1418.
  22. On the Probability of Error Using a Repeat-Request Strategy on the Additive White Gaussian Noise Channel, A. D. Wyner, Bell Sys. Tech. J., 48 (January 1969), pp. 71-86.
  23. On Coding and Information Theory - An Expository paper, A. D. Wyner, SIAM Review, 11 (July 1969), pp. 317-346.
  24. On Digital Communication Over a Discrete Time Gaussian Channel With Noisy Feedback, A. D. Wyner, Bell Sys. Tech. J., 48 (December 1969), pp. 3173-3186.
  25. On Communication of Analog Data From a Bounded Source Space, A. D. Wyner and J. Ziv, Bell Sys. Tech. J., 48 (December 1969), pp. 3139-3172.
  26. The Channel Capacity of the Postal Channel, J. K. Wolf, A. D. Wyner and J. Ziv, Information and Control, 16 (1970), pp. 167-172.
  27. Book Review - ``Information Theory and Reliable Communication'' by RG Gallagher, A. D. Wyner, IEEE Trans. on Information Theory, IT-16:1 (1970), pp. 103-104.
  28. Another Look at the Coding Theorem of Information Theory, A. D. Wyner, Proc. IEEE, 58 (June 1970), pp. 894-913.
  29. Note on Circuits and Chains of Spread k in the n-Cube, A. D. Wyner, IEEE Trans. on Computers, C-20 (April 1971), page 474.
  30. A Bound in the Average Transmission Time for Sequential Estimation Schemes Containing Additive White Gaussian Noise, T. T. Kadota, A. D. Wyner and J. Ziv, IEEE Trans. on Information Theory, IT-17 (September 1971), pp. 514-515.
  31. On the Intersymbol Interference Problem for the Gaussian Channel, A. D. Wyner, Bell Sys. Tech. J., 50 (September 1971), pp. 2355-2363.
  32. Bounds on the Rate Distortion Function for Stationary Sources With Memory, A. D. Wyner and J. Ziv, IEEE Trans. on Information Theory, IT-17:5 (1971), pp. 508-513.
  33. Coding Theorem for Stationary, Asymptotically Memoryless, Continuous Time Channels, T. T. Kadota and A. D. Wyner, Ann. Math. Statist., 43:4 (October 1972), pp. 1603-1611.
  34. On the Transmission or Correlated Gaussian Data Over a Noisy Channel With Finite Encoding Block Length, A. D. Wyner, Information and Control, 20:3 (1972), pp. 193-215.
  35. An Upper Bound on the Entropy Series, A. D. Wyner, Information and Control, 20:2 (1972), pp. 176-181.
  36. A Bound on the Number of Distinguishable Functions Which are Time-Limited and Approximately Band-Limited, A. D. Wyner, SIAM J. Appl. Math., 24:3 (May 1973), pp. 289-297.
  37. A Theorem on the Entropy of Certain Binary Sequences and Applicators: Part I, A. D. Wyner and J. Ziv, IEEE Trans. on Information Theory, IT-19 (November 1973), pp. 769-777.
  38. A Theorem on the Entropy of Certain Binary Sequences and Applications: Part II, A. D. Wyner, IEEE Trans. on Information Theory, IT-19 (November 1973), pp. 772-777.
  39. Capacity of the Gaussian Channel With Memory: the Multivariate Case, L. H. Brandenburg and A. D. Wyner, Bell Sys. Tech. J., 53:5 (May-June 1974), pp. 745-778.
  40. Source Coding for a Simple Network, R. M. Gray and A. D. Wyner, Bell Sys. Tech. J., 53 (November 1974), pp. 1661-1721.
  41. Appendix to ``A Note on the Optimization of Two-Dimensional Signal Constellations,'' (by G. J. Foschini, C. D. Gitlin and S. B. Weinstein), A. D. Wyner, IEEE Trans. on Communications, COM-22 (January 1974), pp. 35-37.
  42. Recent Results in the Shannon Theory, A. D. Wyner, IEEE Trans. on Information Theory, IT-20 (January 1974), pp. 2-10.
  43. On the Probability of Buffer Overflow Under an Arbitrary Bounded Input-Output Distribution, A. D. Wyner, SIAM J. Appl. Math., 27 (December 1974), pp. 544-570.
  44. The Common Information of two Dependent Random Variables, A. D. Wyner, IEEE Trans. on Information Theory, IT-21 (March 1975), pp. 163-179.
  45. On Source Coding With Side Information at the Decoder, A. D. Wyner, IEEE Trans. on Information Theory, IT-21 (May 1975), pp. 244-300.
  46. Upper Bound on Error Probability for Detection with Unbounded Intersymbol Interference, A. D. Wyner, Bell Sys. Tech. J., 54 (September 1975), pp. 1341-1351.
  47. A Conditional Entropy Bound for a Pair of Discrete Random Variables, H. S. Witsenhausen and A. D. Wyner, IEEE Trans. on Information Theory, IT-21 (September 1975), pp. 493-501.
  48. The Wire-Tap Channel, A. D. Wyner, Bell Sys. Tech. J., 54 (October 1975), pp. 1355-1387.
  49. The Rate-Distortion Function for Source Coding with Side-Information at the Decoder, A. D. Wyner, IEEE Trans. on Information Theory, IT-22 (January 1976), pp. 1-10.
  50. A Note on the Capacity of the Band-Limited Gaussian Channel, A. D. Wyner, Bell Sys. Tech. J., 55 (March 1976), pp. 343-346.
  51. Assessment of the National Bureau of Standards Proposed Federal Data Encryption Standard, R. Morris, N. J. A. Sloane and A. D. Wyner, Cryptologia, 1 (1977), pp. 281-306.
  52. A Definition of Conditional Mutual Information for Arbitrary Ensembles, A. D. Wyner, Information and Control, 38 (1978), pp. 51-59.
  53. The Rate-Distortion Function for Source Coding with Side Information at the Decoder II: General Sources, A. D. Wyner, Information and Control, 38 (July 1978), pp. 60-80.
  54. Signal Design for PAM Data Transmission to Minimize Excess Bandwidth, A. D. Wyner, Bell Sys. Tech. J., 57 (November 1978), pp. 3277-3307.
  55. An Analog Scrambling Scheme Which Does Not Expand Bandwidth - I: Discrete-Time, A. D. Wyner, IEEE Trans. on Information Theory, IT-25 (May 1979), pp. 261-274.
  56. An Analog Scrambling Scheme Which Does Not Expand Bandwidth - II: Continuous-Time, A. D. Wyner, IEEE Trans. on Information Theory, IT-25 (July 1979), pp. 415-424.
  57. On Prediction of Moving-Average Processes, L. A. Shepp, D. Slepian and A. D. Wyner, Bell Sys. Tech. J., 59 (March 1980), pp. 367-415.
  58. Source Coding for Multiple Descriptions, J. Wolf, A. D. Wyner and J. Ziv, Bell Sys. Tech. J., 59 (October 1980), pp. 1417-1426.
  59. Fundamental Limits in Information Theory, A. D. Wyner, Proc. IEEE, 69 (February 1981), pp. 239-251.
  60. Source Coding for Multiple Descriptions II: A Binary Source, H. S. Witsenhausen and A. D. Wyner, Bell Sys. Tech. J., 60 (November 1981), pp. 2281-2292.
  61. Bounds on the Size and Transmission Rate of Communications Protocols, A. V. Aho, A. D. Wyner, M. Yannakakis and J. D. Ullman, Comp. & Math. with Applications, 8 (1982), pp. 205-214.
  62. On Storage Media with Aftereffects, H. S. Witsenhausen and A. D. Wyner, Information and Control, 56 (March 1983), pp. 119-211.
  63. Optimum Waveform Signal Sets with Amplitude and Energy Constraints, H. J. Landau and A. D. Wyner, IEEE Trans. on Inf. Theory, IT-30 (July 1984), pp. 615-622.
  64. Coding for Write-Once Memories, J. Wolf, A. D. Wyner, J. Ziv and J. Korner, BSTJ, 63 (July/August 1984), pp. 1089-1112.
  65. Wire Tap Channel II, L. H. Ozarow and A. D. Wyner, BLTJ, 63 (December 1984), pp. 2135-2157.
  66. Achievable Rates for a Constrained Gaussian Channel, L. H. Ozarow, A. D. Wyner and J. Ziv, IEEE Trans. on Information Theory, IT-34 (May 1989), pp. 365-370.
  67. Uniform Large Deviation Property of the Empirical Process of a Markov Chain, R. S. Ellis and A. D. Wyner, Annals of Probability, 17:3 (July 1989), pp. 1147-1151.
  68. Capacity and Error-Exponent for the Direct Detection Photon Channel, Part I, A. D. Wyner, IEEE Trans. on Information Theory, IT-34 (November 1989), pp. 1449-1461.
  69. Capacity and Error-Exponent for the Direct Detection Photon Channel, Part II, A. D. Wyner, IEEE Trans. on Information Theory, IT-34 (November 1989), pp. 1462-1471.
  70. S. O. Rice's Contribution to Information Theory, D. Slepian and A. D. Wyner, IEEE Trans. on Information Theory, IT-34 (November 1989), page 1374.
  71. Some Asymptotic Properties of the Entropy of a Stationary Ergodic Data Source with Applications to Data Compression, A. D. Wyner and J. Ziv, IEEE Trans. on Information Theory, IT-35:6 (November 1989), pp. 1250-1258.
  72. A binary analog to the entropy-power inequality, Shlomo Shamai and A. D. Wyner, IEEE Trans. on Information Theory, IT-36 (November 1990), pp. 1428-1430.
  73. On the capacity of the gaussian channel with a finite number of input levels, L. H. Ozarow and A. D. Wyner, IEEE Trans. on Information Theory, IT-36 (November 1990), pp. 1426-1428.
  74. Fixed Data Base Version of the Lempel-Ziv Data Compression Algorithm, A. D. Wyner and J. Ziv, IEEE Trans. on Information Theory, IT-37 (May 1991), pp. 878-880.
  75. Information Rates for a Discrete Time Gaussian Channel with Intersymbol Interference, L. H. Ozarow, S. Shamai and A. D. Wyner, IEEE Trans. on Information Theory, IT-37 (November 1991), pp. 1527-1529.
  76. A Recurrance Theorem for Dependent Processes with Applications to Data Compression, A. Nobel and A. D. Wyner, IEEE Trans. on Information Theory, IT-38 (September 1992), pp. 1561-1564.
  77. Collected Papers of Claude Elwood Shannon, N. J. A. Sloane and A. D. Wyner, editor, IEEE Pres, New York, 1993.
  78. Information Theoretic Considerations for Cellular Mobile Radio, S. Shamai, L. Ozarow and A. D. Wyner, IEEE Trans. on Vehicular Technology, May 1994 .
  79. The Sliding Window Lempel-Ziv Algorithm is Asymptotically Optimal, A. D. Wyner and J. Ziv, Proc. of the IEEE, 82 (June 1994), pp. 872-877.
  80. Shannon-theoretic Approach to a Gaussian Cellular Multiple Access Channel, A. D. Wyner, IEEE Trans. on Information Theory, 40 (November 1994), pp. 1713-1727.
  81. Sharing a Common Memory, J. Wolf and A. D. Wyner, IEEE Trans. on Information Theory, to appear.
  82. Improved Redundancy of a Version of the Lempel-Ziv Algorithm, A. D. Wyner and A. J. Wyner, IEEE Trans. on Information Theory, 41 (May 1995), pp. 723-731.
  83. Typical Sequences and All That: Entropy, Pattern Matching, and Data Compression (1994 Shannon Lecture), A.D. Wyner, IEEE Information Theory Society Newsletter, July 1995.
  84. Classification with Finite Memory, A.D. Wyner and J. Ziv, IEEE Trans. on Information Theory, 42 (March 1996) pp. 337-347.
  85. Information-Theoretic Considerations for Symmetric Cellular Multiple Access Fading Channels -- Part I, S. Shamai and A.D. Wyner, IEEE Trans. on Information Theory, 43 (November 1997) pp. 1877-1894.
  86. Information-Theoretic Considerations for Symmetric Cellular Multiple Access Fading Channels -- Part I, S. Shamai and A.D. Wyner, IEEE Trans. on Information Theory, 43 (November 1997) pp. 1895-1911.
  87. On the Role of Pattern Matching in Information Theory, J. Ziv, A.D. Wyner and A.J. Wyner, IEEE Trans. on Information Theory, 44 (October 1998) pp. 2045-2056.