Aaron D. Wyner

From MaRDI portal
Revision as of 09:11, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1826197

Available identifiers

zbMath Open wyner.aaron-dMaRDI QIDQ1826197

List of research outcomes





PublicationDate of PublicationType
Communicating via a processing broadcast satellite2005-05-11Paper
Information-theoretic considerations for symmetric, cellular, multiple-access fading channels. I2001-03-18Paper
On the role of pattern matching in information theory1999-11-21Paper
Classification with finite memory1997-01-07Paper
Improved redundancy of a version of the Lempel-Ziv algorithm1996-05-27Paper
Shannon-theoretic approach to a Gaussian cellular multiple-access channel1995-11-29Paper
A recurrence theorem for dependent processes with applications to data compression1992-10-12Paper
Information rates for a discrete-time Gaussian channel with intersymbol interference and stationary inputs1992-06-28Paper
A binary analog to the entropy-power inequality1990-01-01Paper
On the capacity of the Gaussian channel with a finite number of input levels1990-01-01Paper
Uniform large deviation property of the empirical process of a Markov chain1989-01-01Paper
Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression1989-01-01Paper
Achievable rates for a constrained Gaussian channel1988-01-01Paper
Capacity and error exponent for the direct detection photon channel. I1988-01-01Paper
Capacity and error exponent for the direct detection photon channel. II1988-01-01Paper
S.O. Rice's contributions to Shannon theory1988-01-01Paper
Wire-Tap Channel II1985-01-01Paper
Optimum waveform signal sets with amplitude and energy constraints1984-01-01Paper
Wire-Tap Channel II1984-01-01Paper
On storage media with aftereffects1983-01-01Paper
Bounds on the size and transmission rate of communications protocols1982-01-01Paper
Source Coding for Multiple Descriptions II: A Binary Source1981-01-01Paper
On Prediction of Moving-Average Processes1980-01-01Paper
Source Coding for Multiple Descriptions1980-01-01Paper
An analog scrambling scheme which does not expand bandwidth, Part II: Continuous time1979-01-01Paper
An analog scrambling scheme which does not expand bandwidth, Part I: Discrete time1979-01-01Paper
A definition of conditional mutual information for arbitrary ensembles1978-01-01Paper
The rate-distortion function for source coding with side information at the decoder\3-II: General sources1978-01-01Paper
Signal Design for PAM Data Transmission to Minimize Excess Bandwidth1978-01-01Paper
The rate-distortion function for source coding with side information at the decoder1976-01-01Paper
A Note on the Capacity of the Band-Limited Gaussian Channel1976-01-01Paper
The common information of two dependent random variables1975-01-01Paper
Upper Bound on Error Probability for Detection With Unbounded Intersymbol Interference1975-01-01Paper
On source coding with side information at the decoder1975-01-01Paper
The Wire-Tap Channel1975-01-01Paper
A conditional entropy bound for a pair of discrete random variables1975-01-01Paper
On the Probability of Buffer Overflow Under an Arbitrary Bounded Input-Output Distribution1974-01-01Paper
Source Coding for a Simple Network1974-01-01Paper
Recent results in the Shannon theory1974-01-01Paper
Capacity of the Gaussian Channel With Memory: The Multivariate Case1974-01-01Paper
A theorem on the entropy of certain binary sequences and applications--I1973-01-01Paper
A theorem on the entropy of certain binary sequences and applications--II1973-01-01Paper
A Bound on the Number of Distinguishable Functions which are Time-Limited and Approximately Band-Limited1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40747481972-01-01Paper
On the transmission of correlated Gaussian data over a noisy channel with finite encoding block length1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56438861972-01-01Paper
An upper bound on the entropy series1972-01-01Paper
Coding Theorem for Stationary, Asymptotically Memoryless, Continuous-time Channels1972-01-01Paper
Note on Circuits and Chains of Spread k in the n-Cube1971-01-01Paper
Bound on the average transmission time for sequential estimation systems containing an additive Gaussian noise channel1971-01-01Paper
On the Intersymbol Interference Problem for the Gaussian Channel1971-01-01Paper
Bounds on the rate-distortion function for stationary sources with memory1971-01-01Paper
The channel capacity of the postal channel1970-01-01Paper
On the Probability of Error Using a Repeat-Request Strategy on the Additive White Gaussian Noise Channel1969-01-01Paper
Binary communication over the Gaussian channel using feedback with a peak energy constraint1969-01-01Paper
On Digital Communication Over a Discrete-Time Gaussian Channel with Noisy Feedback1969-01-01Paper
On Cading and Information Theory1969-01-01Paper
On the Asymptotic Distribution of a Certain Functional of the Wiener Process1969-01-01Paper
On Communication of Analog Data from a Bounded Source Space1969-01-01Paper
On the Schalkwijk-Kailath coding scheme with a peak energy constraint1968-01-01Paper
Communication of Analog Data from a Gaussian Source Over a Noisy Channel1968-01-01Paper
An upper bound on minimum distance for a k-ary code1968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55675631968-01-01Paper
On the probability of error for communication in white Gaussian noise1967-01-01Paper
Random Packings and Coverings of the Unit n-Sphere1967-01-01Paper
Capacity of the product of channels1966-01-01Paper
The Capacity of the Band-Limited Gaussian Channel1966-01-01Paper
Bounds on Communication with Polyphase Coding1966-01-01Paper
On the equivalence of two convolution code definitions (Corresp.)1965-01-01Paper
Optimum block codes for noiseless input restricted channels1964-01-01Paper
A Note on a Class of Binary Cyclic Codes Which Correct Solid-Burst Errors [Letter to the Editor]1964-01-01Paper
Analysis of recurrent codes1963-01-01Paper
Low-density-burst-correcting codes (Corresp.)1963-01-01Paper

Research outcomes over time

This page was built for person: Aaron D. Wyner