default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Koller
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c7]D. Wieland, S. Ofner
, M. Stabentheiner, B. Butej, Christian Koller, J. Sun, Andrea Minetto, K. Reiser, Oliver Häberlen, Michael Nelhiebel, Michael Glavanovics, Dionyz Pogany, Clemens Ostermaier:
A common hard-failure mechanism in GaN HEMTs in accelerated switching and single-pulse short-circuit tests. IRPS 2023: 1-6- 2022
- [j3]Paul Gäbel, Christian Koller, Elke Hertig:
Development of Air Quality Boxes Based on Low-Cost Sensor Technology for Ambient Air Quality Monitoring. Sensors 22(10): 3830 (2022) - 2021
- [c6]Matteo Meneghini, Nicola Modolo, Arianna Nardo, Carlo De Santi, Andrea Minetto, Luca Sayadi, Christian Koller, Sebastien Sicre, Gerhard Prechtl, Gaudenzio Meneghesso, Enrico Zanoni:
Charge Trapping in GaN Power Transistors: Challenges and Perspectives. BCICTS 2021: 1-4
2010 – 2019
- 2014
- [j2]Christian Koller, Martin Haenggi, Jörg Kliewer, Daniel J. Costello Jr.:
Joint Design of Channel and Network Coding for Star Networks Connected by Binary Symmetric Channels. IEEE Trans. Commun. 62(1): 158-169 (2014) - 2013
- [c5]Christian Koller, Martin Haenggi, Jörg Kliewer, Daniel J. Costello Jr.:
Joint channel/network coding for star networks. ISIT 2013: 3080-3084 - [i4]Christian Koller, Martin Haenggi, Jörg Kliewer, Daniel J. Costello Jr.:
Joint Design of Channel and Network Coding for Star Networks. CoRR abs/1301.6426 (2013) - 2012
- [j1]Christian Koller, Alexandre Graell i Amat, Jörg Kliewer, Francesca Vatta, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Analysis and Design of Tuned Turbo Codes. IEEE Trans. Inf. Theory 58(7): 4796-4813 (2012) - 2011
- [c4]Christian Koller, Martin Haenggi, Jörg Kliewer, Daniel J. Costello Jr.:
On the optimal block length for joint channel and network coding. ITW 2011: 528-532 - 2010
- [i3]Christian Koller, Alexandre Graell i Amat, Jörg Kliewer, Francesca Vatta, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Analysis and Design of Tuned Turbo Codes. CoRR abs/1010.5278 (2010)
2000 – 2009
- 2009
- [c3]Christian Koller, Alexandre Graell i Amat, Jörg Kliewer, Daniel J. Costello Jr.:
Trapping set enumerators for repeat multiple accumulate code ensembles. ISIT 2009: 1819-1823 - [i2]Christian Koller, Alexandre Graell i Amat, Jörg Kliewer, Daniel J. Costello Jr.:
Trapping Set Enumerators for Repeat Multiple Accumulate Code Ensembles. CoRR abs/0905.3733 (2009) - 2008
- [c2]Christian Koller, Jörg Kliewer, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Minimum distance bounds for multiple-serially concatenated code ensembles. ISIT 2008: 1888-1892 - [i1]Jörg Kliewer, Kamil Sh. Zigangirov, Christian Koller, Daniel J. Costello Jr.:
Coding Theorems for Repeat Multiple Accumulate Codes. CoRR abs/0810.3422 (2008) - 2005
- [c1]Wufei Zhang, Christian Koller, Andrew W. Eckford, Daniel J. Costello Jr., Thomas E. Fuja, Gil I. Shamir:
Estimation and decoding strategies for channels with abruptly changing statistics. ITW 2005: 277-
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-10-07 22:10 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:
