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

Hans J. Matt

dblp:81/1546 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 1986
—ORCID · none

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

Computer networks · 3 · 3 first-authorTheory of computation · 1 · 1 first-author

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
1 paper
Coding theory · 100%
Computer networks
1 paper
Internet architecture and protocols · 62% Optical networks · 38%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › ISDN
broadband ISDN
0.011981
Integrated Broad-Band Communication Using Optical Networks-Results of an Experimental Study · IEEE Trans. Commun. 1981
Coding theory › error-correcting codes
burst error correction
0.011980
Determining the burst-correcting limit of cyclic codes · IEEE Trans. Inf. Theory 1980
Coding theory › error-correcting codes
cyclic codes
0.011980
Determining the burst-correcting limit of cyclic codes · IEEE Trans. Inf. Theory 1980
Optical networks
optical fiber transmission
0.011981
Integrated Broad-Band Communication Using Optical Networks-Results of an Experimental Study · IEEE Trans. Commun. 1981
Coding theory › error-correcting codes › block codes
linear code
0.011980
Determining the burst-correcting limit of cyclic codes · IEEE Trans. Inf. Theory 1980
Coding theory › error-correcting codes › block codes › linear code
parity-check matrix
0.011980
Determining the burst-correcting limit of cyclic codes · IEEE Trans. Inf. Theory 1980

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

linear feedback shift register · 0.0large-scale integration · 0.0column rank testing · 0.0
YearPublicationVenuePosition
1986 B-ISDN System Concept and Technologies
Hans J. Matt
ICC1
1984 Basic Concepts and Possibilities for Broadband-Networks
Hans J. Matt
ICC (3)1
1981 Integrated Broad-Band Communication Using Optical Networks-Results of an Experimental Study
abstract
This paper reports on an experimental system of an integrated communication network built with components representing the state-of-the-art in the area of optical fiber transmission and large-scale integration of logic functions. These components make it possible to apply new concepts for signal processing, transmission, and switching in the experimental system. The large bandwidth of optical channels allows the transmission of all kinds of communication services including data, audio, and video, while semiconductor technology offers low cost realization and mass production of complex signal processing and switching functions to handle all these services within one network. The concept of the system is presented and results on system components and subsystems are given.
Hans J. Matt, Kurt Fussgaenger
IEEE Trans. Commun.1
1980 Determining the burst-correcting limit of cyclic codes
abstract
Two new computationally efficient algorithms are developed for finding the exact burst-correcting limit of a cyclic code. The first algorithm is based on testing the colmn rank of certain submatrices of the parity-check matrix of the code. An auxiliary result is a proof that every cyclic(n,k)codes with a minimum distance of at least three, corrects at least all bursts of length\lfloor (n - 2k + 1)/2 \rflooror less. The second algorithm, which requires somewhat less computation, is based on finding the length of the shortest linear feedback shift-register that generates the subsequences of lengthn - kof the sequence formed by the coefficients of the parity-check polynomialh(x), augmented with\lfloor (n-k)/2 \rfloor -1leading zeros and trailing zeros. Tables of the burst-correcting limit for a large number of binary cyclic codes are included.
Hans J. Matt, James L. Massey
IEEE Trans. Inf. Theory1