2010 - IEEE Fellow For contributions to coded modulation, iterative decoding, and cooperative communications
Gerhard Kramer mainly investigates Channel capacity, Computer network, Communication channel, Decoding methods and Transmitter. His Channel capacity research integrates issues from Discrete mathematics, Random variable, Additive white Gaussian noise, MIMO and Gaussian noise. In the field of Computer network, his study on Linear network coding, Network simulation, Active networking and Near-far problem overlaps with subjects such as Broadcast control channel.
His research in Communication channel intersects with topics in Relay channel and Topology. The concepts of his Decoding methods study are interwoven with issues in Relay and Fading. His work carried out in the field of Transmitter brings together such families of science as Encoder, Finite set, Multicast, Electronic engineering and Realization.
Gerhard Kramer mainly focuses on Communication channel, Topology, Algorithm, Computer network and Electronic engineering. Gerhard Kramer is interested in Channel capacity, which is a branch of Communication channel. Gerhard Kramer interconnects Theoretical computer science, Random variable, Noise, MIMO and Broadcast channels in the investigation of issues within Topology.
The study incorporates disciplines such as Encoder and Binary number in addition to Algorithm. In his work, Fading is strongly intertwined with Relay, which is a subfield of Computer network. His Electronic engineering research incorporates elements of Optical fiber, Signal, Digital subscriber line and Communications system.
Algorithm, Upper and lower bounds, Communication channel, Key and Optical fiber are his primary areas of study. In his study, Codebook is inextricably linked to Encoder, which falls within the broad field of Algorithm. Specifically, his work in Communication channel is concerned with the study of Additive white Gaussian noise.
His biological study spans a wide range of topics, including Information theory, Attenuation, Spectral efficiency and Nonlinear system. The Topology study combines topics in areas such as Phase noise, Relay, Noise and Sense. His research in Decoding methods is mostly concerned with Low-density parity-check code.
Gerhard Kramer focuses on Algorithm, Communication channel, Upper and lower bounds, Binary number and Encoder. His Algorithm study combines topics in areas such as Probability distribution and Lossy compression. Gerhard Kramer studies Additive white Gaussian noise, a branch of Communication channel.
His study on Upper and lower bounds also encompasses disciplines like
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Cooperative strategies and capacity theorems for relay networks
G. Kramer;M. Gastpar;P. Gupta.
IEEE Transactions on Information Theory (2005)
Capacity Limits of Optical Fiber Networks
R.-J. Essiambre;G. Kramer;P.J. Winzer;G.J. Foschini.
Journal of Lightwave Technology (2010)
Design of low-density parity-check codes for modulation and detection
S. ten Brink;G. Kramer;A. Ashikhmin.
IEEE Transactions on Communications (2004)
Extrinsic information transfer functions: model and erasure channel properties
A. Ashikhmin;G. Kramer;S. ten Brink.
IEEE Transactions on Information Theory (2004)
A New Outer Bound and the Noisy-Interference Sum–Rate Capacity for Gaussian Interference Channels
Xiaohu Shang;G. Kramer;Biao Chen.
IEEE Transactions on Information Theory (2009)
Gerhard Kramer;Ivana Marić;Roy D. Yates.
Capacity results for the discrete memoryless network
IEEE Transactions on Information Theory (1999)
Compound wiretap channels
Yingbin Liang;Gerhard Kramer;H. Vincent Poor;Shlomo Shamai.
Eurasip Journal on Wireless Communications and Networking (2009)
Directed information for channels with feedback
Capacity of Interference Channels With Partial Transmitter Cooperation
I.. Maric;R.D. Yates;G.. Kramer.
IEEE Transactions on Information Theory (2007)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: