default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAaron D. Wyner
Person information
- affiliation: Bell Laboratories
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
[j57]Aaron D. Wyner, Jack K. Wolf, Frans M. J. Willems:
Communicating via a processing broadcast satellite. IEEE Trans. Inf. Theory 48(6): 1243-1249 (2002)- 2001
- [j56]Aaron D. Wyner:
The significance of Shannon's work. ACM SIGMOBILE Mob. Comput. Commun. Rev. 5(1): 56-57 (2001)
1990 – 1999
- 1998
- [j55]Aaron D. Wyner, Shlomo Shamai:
Introduction To "Communication In The Presence Of Noise". Proc. IEEE 86(2): 442-446 (1998) - [j54]Aaron D. Wyner, Jacob Ziv, Abraham J. Wyner:
On the Role of Pattern Matching in Information Theory. IEEE Trans. Inf. Theory 44(6): 2045-2056 (1998) - 1997
- [j53]Shlomo Shamai, Aaron D. Wyner:
Information-theoretic considerations for symmetric, cellular, multiple-access fading channels - Part I. IEEE Trans. Inf. Theory 43(6): 1877-1894 (1997) - [j52]Shlomo Shamai, Aaron D. Wyner:
Information-theoretic considerations for symmetric, cellular, multiple-access fading channels - Part II. IEEE Trans. Inf. Theory 43(6): 1895-1911 (1997) - 1996
- [j51]Aaron D. Wyner, Jacob Ziv:
Classification with finite memory. IEEE Trans. Inf. Theory 42(2): 337-347 (1996) - 1995
- [j50]Aaron D. Wyner, Abraham J. Wyner:
Improved redundancy of a version of the Lempel-Ziv algorithm. IEEE Trans. Inf. Theory 41(3): 723-731 (1995) - [c4]Martin Farach, Michiel O. Noordewier, Serap A. Savari, Larry A. Shepp, Aaron D. Wyner, Jacob Ziv:
On the Entropy of DNA: Algorithms and Measurements Based on Memory and Rapid Convergence. SODA 1995: 48-57 - 1994
- [j49]Aaron D. Wyner, Jacob Ziv:
The sliding-window Lempel-Ziv algorithm is asymptotically optimal. Proc. IEEE 82(6): 872-877 (1994) - [j48]Aaron D. Wyner:
Shannon-theoretic approach to a Gaussian cellular multiple-access channel. IEEE Trans. Inf. Theory 40(6): 1713-1727 (1994) - 1992
- [j47]Andrew B. Nobel, Aaron D. Wyner:
A recurrence theorem for dependent processes with applications to data compression. IEEE Trans. Inf. Theory 38(5): 1561-1564 (1992) - 1991
- [j46]Aaron D. Wyner, Jacob Ziv:
Fixed data base version of the Lempel-Ziv data compression algorithm. IEEE Trans. Inf. Theory 37(3): 878-880 (1991) - [j45]Shlomo Shamai, Lawrence H. Ozarow, Aaron D. Wyner:
Information rates for a discrete-time Gaussian channel with intersymbol interference and stationary inputs. IEEE Trans. Inf. Theory 37(6): 1527-1539 (1991) - [c3]Aaron D. Wyner, Jacob Ziv:
Fixed Data Base Version of the Lempel-Ziv Data Compression Algorithm. Data Compression Conference 1991: 202-207 - 1990
- [j44]Lawrence H. Ozarow, Aaron D. Wyner:
On the capacity of the Gaussian channel with a finite number of input levels. IEEE Trans. Inf. Theory 36(6): 1426-1428 (1990) - [j43]Shlomo Shamai, Aaron D. Wyner:
A binary analog to the entropy-power inequality. IEEE Trans. Inf. Theory 36(6): 1428-1430 (1990)
1980 – 1989
- 1989
- [j42]Aaron D. Wyner:
Review of 'Principles and Practice of Information Theory' (Blahut, R.E.; 1987). IEEE Trans. Inf. Theory 35(5): 1137- (1989) - [j41]Aaron D. Wyner, Jacob Ziv:
Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression. IEEE Trans. Inf. Theory 35(6): 1250-1258 (1989) - 1988
- [j40]Lawrence H. Ozarow, Aaron D. Wyner, Jacob Ziv:
Achievable rates for a constrained Gaussian channel. IEEE Trans. Inf. Theory 34(3): 365-370 (1988) - [j39]David S. Slepian, Aaron D. Wyner:
S.O. Rice's contributions to Shannon Theory. IEEE Trans. Inf. Theory 34(6): 1374 (1988) - [j38]Aaron D. Wyner:
Capacity and error exponent for the direct detection photon channel-Part I. IEEE Trans. Inf. Theory 34(6): 1449-1461 (1988) - [j37]Aaron D. Wyner:
Capacity and error-exponent for the direct detection photon channel-Part II. IEEE Trans. Inf. Theory 34(6): 1462-1471 (1988) - 1984
- [j36]Jack K. Wolf, Aaron D. Wyner, Jacob Ziv, János Körner:
Coding for a write-once memory. AT&T Bell Lab. Tech. J. 63(6): 1089-1112 (1984) - [j35]Lawrence H. Ozarow, Aaron D. Wyner:
Wire-tap channel II. AT&T Bell Lab. Tech. J. 63(10): 2135-2157 (1984) - [j34]Aaron D. Wyner, Henry J. Landau:
Optimum waveform signal sets with amplitude and energy constraints. IEEE Trans. Inf. Theory 30(4): 615-622 (1984) - [c2]Lawrence H. Ozarow, Aaron D. Wyner:
Wire-Tap Channel II. EUROCRYPT 1984: 33-50 - 1983
- [j33]Hans S. Witsenhausen, Aaron D. Wyner:
On Storage Meda with Aftereffects. Inf. Control. 56(3): 199-211 (1983) - [j32]Hans S. Witsenhausen, Aaron D. Wyner:
Erratum: On Storage Media with Aftereffects. Inf. Control. 58(1-3): 195 (1983) - 1981
- [c1]Aaron D. Wyner:
Some Thoughts on Speech Encryption. CRYPTO 1981: 120
1970 – 1979
- 1979
- [j31]Aaron D. Wyner:
An analog scrambling scheme which does not expand bandwidth, Part I: Discrete time. IEEE Trans. Inf. Theory 25(3): 261-274 (1979) - [j30]Aaron D. Wyner:
An analog scrambling scheme which does not expand bandwidth, Part II: Continuous time. IEEE Trans. Inf. Theory 25(4): 415-425 (1979) - 1978
- [j29]Aaron D. Wyner:
A Definition of Conditional Mutual Information for Arbitrary Ensembles. Inf. Control. 38(1): 51-59 (1978) - [j28]Aaron D. Wyner:
The Rate-Distortion Function for Source Coding with Side Information at the Decoder-II. General Sources. Inf. Control. 38(1): 60-80 (1978) - 1977
- [j27]Robert H. Morris Sr., Neil J. A. Sloane, Aaron D. Wyner:
Assessment of the National Bureau of Standards Proposed Federal Data Encryption Standard. Cryptologia 1(3): 281-291 (1977) - 1976
- [j26]Aaron D. Wyner:
A note on the capacity of the band-limited Gaussian channel. Bell Syst. Tech. J. 55(3): 343-346 (1976) - [j25]Aaron D. Wyner, Jacob Ziv:
The rate-distortion function for source coding with side information at the decoder. IEEE Trans. Inf. Theory 22(1): 1-10 (1976) - 1975
- [j24]Aaron D. Wyner:
Upper bound on error probability for detection with unbounded intersymbol interference. Bell Syst. Tech. J. 54(7): 1341-1351 (1975) - [j23]Aaron D. Wyner:
The wire-tap channel. Bell Syst. Tech. J. 54(8): 1355-1387 (1975) - [j22]Aaron D. Wyner:
The common information of two dependent random variables. IEEE Trans. Inf. Theory 21(2): 163-179 (1975) - [j21]Aaron D. Wyner:
On source coding with side information at the decoder. IEEE Trans. Inf. Theory 21(3): 294-300 (1975) - [j20]Hans S. Witsenhausen, Aaron D. Wyner:
A conditional entropy bound for a pair of discrete random variables. IEEE Trans. Inf. Theory 21(5): 493-501 (1975) - 1974
- [j19]Aaron D. Wyner:
Recent results in the Shannon theory. IEEE Trans. Inf. Theory 20(1): 2-10 (1974) - 1973
- [j18]Aaron D. Wyner, Jacob Ziv:
A theorem on the entropy of certain binary sequences and applications-I. IEEE Trans. Inf. Theory 19(6): 769-772 (1973) - [j17]Aaron D. Wyner:
A theorem on the entropy of certain binary sequences and applications-II. IEEE Trans. Inf. Theory 19(6): 772-777 (1973) - 1972
- [j16]Aaron D. Wyner:
An Upper Bound on the Entropy Series. Inf. Control. 20(2): 176-181 (1972) - [j15]Aaron D. Wyner:
On the Transmission of Correlated Gaussian Data over a Noisy Channel with Finite Encoding Block Length. Inf. Control. 20(3): 193-215 (1972) - 1971
- [j14]Aaron D. Wyner:
Note on Circuits and Chains of Spread k in the n-Cube. IEEE Trans. Computers 20(4): 474 (1971) - [j13]Aaron D. Wyner, Jacob Ziv:
Bounds on the rate-distortion function for stationary sources with memory. IEEE Trans. Inf. Theory 17(5): 508-513 (1971) - [j12]T. T. Kadota, Aaron D. Wyner, Jacob Ziv:
Bound on the average transmission time for sequential estimation systems containing an additive Gaussian noise channel. IEEE Trans. Inf. Theory 17(5): 514-515 (1971) - 1970
- [j11]Jack K. Wolf, Aaron D. Wyner, Jacob Ziv:
The Channel Capacity of the Postal Channel. Inf. Control. 16(2): 167-172 (1970) - [j10]Aaron D. Wyner:
Review of 'Information Theory and Reliable Communication' (Gallager, R. G.; 1968). IEEE Trans. Inf. Theory 16(1): 103-104 (1970)
1960 – 1969
- 1969
- [j9]Larry A. Shepp, Jack K. Wolf, Aaron D. Wyner, Jacob Ziv:
Binary communication over the Gaussian channel using feedback with a peak energy constraint. IEEE Trans. Inf. Theory 15(4): 476-478 (1969) - 1968
- [j8]Aaron D. Wyner, Ronald L. Graham:
An Upper Bound on Minimum Distance for a k-ary Code. Inf. Control. 13(1): 46-52 (1968) - [j7]Aaron D. Wyner:
On the Schalkwijk-Kailath coding scheme with a peak energy constraint. IEEE Trans. Inf. Theory 14(1): 129-134 (1968) - 1967
- [j6]Aaron D. Wyner:
On the probability of error for communication in white Gaussian noise. IEEE Trans. Inf. Theory 13(1): 86-90 (1967) - 1966
- [j5]Aaron D. Wyner:
Capacity of the Product of Channels. Inf. Control. 9(4): 423-430 (1966) - 1965
- [j4]Aaron D. Wyner:
On the equivalence of two convolution code definitions (Corresp.). IEEE Trans. Inf. Theory 11(4): 600-602 (1965) - 1964
- [j3]Charles V. Freiman, Aaron D. Wyner:
Optimum Block Codes for Noiseless Input Restricted Channels. Inf. Control. 7(3): 398-415 (1964) - 1963
- [j2]Aaron D. Wyner:
Low-density-burst-correcting codes (Corresp.). IEEE Trans. Inf. Theory 9(2): 124 (1963) - [j1]Aaron D. Wyner, Robert B. Ash:
Analysis of recurrent codes. IEEE Trans. Inf. Theory 9(3): 143-156 (1963)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:55 CEST 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:
