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

Martin Hassner

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

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

Theory of computation · 2Computer networks · 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.

Theoretical computer science
2 papers
Coding theory · 88% Automata and formal languages · 12%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory
error-correcting codes
0.011991
Multilevel error-control codes for data storage channels · IEEE Trans. Inf. Theory 1991
Coding theory › error-correcting codes › coded modulation
multilevel coding
0.011991
Multilevel error-control codes for data storage channels · IEEE Trans. Inf. Theory 1991
Coding theory › constrained coding
sliding block code
0.011983
Algorithms for sliding block codes - An application of symbolic dynamics to information theory · IEEE Trans. Inf. Theory 1983
Automata and formal languages
symbolic dynamics
0.011983
Algorithms for sliding block codes - An application of symbolic dynamics to information theory · IEEE Trans. Inf. Theory 1983
Storage systems
magnetic storage
0.011991
Multilevel error-control codes for data storage channels · IEEE Trans. Inf. Theory 1991

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

reed-solomon codes · 0.0
YearPublicationVenuePosition
2003 Low-complexity signal processing for ISI channels
abstract
We present-a low-complexity soft detection and soft decoding magnetic disk drive read channel with a modified soft-output signal space detector (S/sup 3/D) which uses 3D-110 equalization and an error/erasure decoding Reed Solomon (RS) code. The detector determines max-log reliability information for intersymbol interference (ISI) channels with stationary white and colored noise. It can be implemented with only little additional hardware compared to the ordinary signal space detector. The erasures of the RS code are determined by the soft information and by an additional inner error detecting code (EDC) which is matched to the error patterns of the S/sup 3/D. The proposed system permits an improvement of the decoding performance in practical hard disk applications.
Stefan Schmermbeck, Guido Stromberg, Martin Hassner, Uwe Schwiegelshohn
GLOBECOM3
1991 Multilevel error-control codes for data storage channels
abstract
The authors present a coding architecture suitable for magnetic storage systems. In data storage devices, several types of errors may occur. This includes random errors as well as burst errors of different lengths. A class of error control codes is presented, based on a multilevel coding architecture, that can correct several types of errors. The parameters of the multilevel codes can be adjusted to match the probability of each error type. The decoding algorithms of these codes allow for fast-error recovery since they are based on decoding algorithms for simple codes. A class of multilevel codes is constructed, based on Reed-Solomon codes, whose redundancy is minimal.>
Khaled A. S. Abdel-Ghaffar, Martin Hassner
IEEE Trans. Inf. Theory2
1983 Algorithms for sliding block codes - An application of symbolic dynamics to information theory
abstract
Ideas which have origins in Shannon's work in information theory have arisen independently in a mathematical discipline called symbolic dynamics. These ideas have been refined and developed in recent years to a point where they yield general algorithms for constructing practical coding schemes with engineering applications. In this work we prove an extension of a coding theorem of Marcus and trace a line of mathematics from abstract topological dynamics to concrete logic network diagrams.
Roy L. Adler, Don Coppersmith, Martin Hassner
IEEE Trans. Inf. Theory3