Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ferdinand Hergert

dblp:59/4972 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1993
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Learning theory · 50% Deep learning architectures and training · 50%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
model selection
0.011992
Extended Regularization Methods for Nonconvergent Model Selection · NIPS 1992
Machine learning › Deep learning architectures and training
regularization
0.011992
Extended Regularization Methods for Nonconvergent Model Selection · NIPS 1992
Coding theory
error-correcting codes
0.011986
Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes · IEEE Trans. Inf. Theory 1986
Coding theory › error-correcting codes › block codes
linear code
0.011986
Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes · IEEE Trans. Inf. Theory 1986
Coding theory › error-correcting codes › decoding
soft-decision decoding
0.011986
Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes · IEEE Trans. Inf. Theory 1986
Coding theory › error-correcting codes › decoding › decoding algorithms
decoding beyond half minimum distance
0.011986
Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes · IEEE Trans. Inf. Theory 1986
Coding theory › error-correcting codes › decoding › decoding algorithms › decoding of block codes
parity-check decoding
0.011986
Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes · IEEE Trans. Inf. Theory 1986

Methods — techniques the papers use, named apart from their topics

regularization · 0.0quadratic residue codes · 0.0dual code minimum weight words · 0.0
YearPublicationVenuePosition
1993 Improving model selection by nonconvergent methods
William Finnoff, Ferdinand Hergert, Hans-Georg Zimmermann
Neural Networks2
1992 Extended Regularization Methods for Nonconvergent Model Selection
William Finnoff, Ferdinand Hergert, Hans-Georg Zimmermann
NIPS2
1986 Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes
abstract
A decoding algorithm for linear codes that uses the minimum weight words of the dual code as parity checks is defined. This algorithm is able to correct beyond the half minimum distance and has the capability of including soft-decision decoding. Results on applying this algorithm to quadratic residue (QR) codes, BCH codes, and the Golay codes (with and without soft-decision decoding) are presented.
Martin Bossert, Ferdinand Hergert
IEEE Trans. Inf. Theory2