default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorg Schmidt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Eimo Martens, Hans-Ulrich Haase, Giulio Mastella, Andreas Henkel, Christoph Spinner, Franziska Hahn, Congyu Zou, Augusto Fava-Sanches
, Julia Allescher, Daniel Heid, Elena Strauss, Melanie-Maria Maier, Mark Lachmann, Georg Schmidt, Dominik Westphal, Tobias Haufe, David Federle, Daniel Rueckert, Martin Boeker, Matthias Becker, Karl-Ludwig Laugwitz, Alexander Steger, Alexander Müller:
Smart hospital: achieving interoperability and raw data collection from medical devices in clinical routine. Frontiers Digit. Health 6 (2024)- 2022
- [j6]Sven Zenker, Daniel Strech, Kristina Ihrig, Roland Jahns, Gabriele Müller, Christoph Schickhardt, Georg Schmidt, Ronald Speer, Eva C. Winkler, Sebastian Graf von Kielmansegg, Johannes Drepper:
Data protection-compliant broad consent for secondary use of health care data and human biosamples for (bio)medical research: Towards a new German national standard. J. Biomed. Informatics 131: 104096 (2022) - [i4]Jonathan Schmidt, Haichen Wang, Georg Schmidt, Miguel Marques:
Machine Learning guided high-throughput search of non-oxide garnets. CoRR abs/2208.13742 (2022) - 2021
- [j5]Melanie Baldinger, Axel Heinrich, Tim Adams, Eimo Martens, Michael Dommasch, Alexander Müller, Adonia Siegmann, Georg Schmidt, Oliver Amft, Kristof Van Laerhoven:
TELECOVID: Remote Vital Signs Monitoring of COVID-19 Risk Patients in Home Isolation With an In-Ear Wearable. IEEE Pervasive Comput. 20(2): 58-62 (2021)
2010 – 2019
- 2018
- [c12]Josef Halámek, Pavel Leinveber, Marek Malik, Georg Schmidt, Filip Plesinger, Magdalena Matejkova, Jolana Lipoldova, Pavel Jurák:
High Frequency QRS Analysis From Orthogonal Leads. CinC 2018: 1-4 - 2011
- [j4]Vladimir R. Sidorenko, Georg Schmidt:
A linear algebraic approach to multisequence shift-register synthesis. Probl. Inf. Transm. 47(2): 149-165 (2011) - 2010
- [j3]Georg Schmidt, Vladimir Sidorenko, Martin Bossert:
Syndrome decoding of Reed-Solomon codes beyond half the minimum distance based on shift-register synthesis. IEEE Trans. Inf. Theory 56(10): 5245-5252 (2010)
2000 – 2009
- 2009
- [j2]Georg Schmidt, Vladimir Sidorenko, Martin Bossert:
Collaborative decoding of interleaved Reed-Solomon codes and concatenated code designs. IEEE Trans. Inf. Theory 55(7): 2991-3012 (2009) - 2008
- [c11]Georg Schmidt, Igor Novakovic:
Unleash the Power of Semantic Web in the Enterprise. ISWC (Posters & Demos) 2008 - 2007
- [b1]Georg Schmidt:
Algebraic decoding beyond half the minimum distance based on shift register synthesis. University of Ulm, 2007, ISBN 978-3-18-378110-2, pp. 1-168 - [c10]Georg Schmidt, Vladimir Sidorenko, Martin Bossert:
Enhancing the Correcting Radius of Interleaved Reed-Solomon Decoding using Syndrome Extension Techniques. ISIT 2007: 1341-1345 - [i3]Georg Schmidt, Vladimir Sidorenko, Martin Bossert:
Syndrome Decoding of Reed-Solomon Codes Beyond Half the Minimum Distance based on Shift-Register Synthesis. CoRR abs/cs/0702130 (2007) - 2006
- [c9]Dirk Hoyer, Birgit Frank, Ch. Gotze, Rafal Baranowski, Jan J. Zebrowski, Montserrat Vallverdú, M. Palacios, Pere Caminal, Antoni Bayés de Luna, Phyllis K. Stein, Georg Schmidt, Hendrik Schmidt:
Association between Short Term and Long Term Communication in Pathological Autonomic Control. EMBC 2006: 433-436 - [c8]Georg Schmidt, Vladimir Sidorenko, Martin Bossert:
Decoding Reed-Solomon Codes Beyond Half the Minimum Distance using Shift-Register Synthesis. ISIT 2006: 459-463 - [c7]Georg Schmidt, Vladimir R. Sidorenko:
Multi-Sequence Linear Shift-Register Synthesis: The Varying Length Case. ISIT 2006: 1738-1742 - [i2]Georg Schmidt, Vladimir Sidorenko:
Linear Shift-Register Synthesis for Multiple Sequences of Varying Length. CoRR abs/cs/0605044 (2006) - [i1]Georg Schmidt, Vladimir Sidorenko, Martin Bossert:
Collaborative Decoding of Interleaved Reed-Solomon Codes and Concatenated Code Designs. CoRR abs/cs/0610074 (2006) - 2005
- [c6]Gerd Richter, Georg Schmidt, Martin Bossert, Elena Costa:
Optimization of a reduced-complexity decoding algorithm for LDPC codes by density evolution. ICC 2005: 642-646 - [c5]Georg Schmidt, Carolin Huppert, Martin Bossert:
Multitrial decoding of concatenated Reed-Solomon codes. ISIT 2005: 2241-2245 - [c4]Georg Schmidt, Vladimir R. Sidorenko, Martin Bossert:
Interleaved Reed-Solomon codes in concatenated code designs. ITW 2005: 187-191 - [c3]Vladimir Sidorenko, Georg Schmidt, Ernst M. Gabidulin, Martin Bossert, Valentin B. Afanassiev:
On polyalphabetic block codes. ITW 2005: 207-210 - [c2]Georg Schmidt, Vladimir Sidorenko, Martin Bossert:
Error and Erasure Correction of Interleaved Reed-Solomon Codes. WCC 2005: 22-35 - 2004
- [j1]Alfred P. Hallstrom, Phyllis K. Stein, Raphael Schneider, Morrison Hodges, Georg Schmidt, Kurt Ulm:
Structural relationships between measures based on heart beat intervals: potential for improved risk assessment. IEEE Trans. Biomed. Eng. 51(8): 1414-1420 (2004) - [c1]Georg Schmidt, Vladimir R. Sidorenko, Victor V. Zyablov, Martin Bossert:
Finding a list of best paths in a trellis. ISIT 2004: 557
Coauthor Index
aka: Vladimir R. Sidorenko
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:24 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:
