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

Marek Sechny

dblp:61/10936 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1999
—ORCID · none

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

Computer networks · 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%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
convolutional codes
0.011999
Some new runlength-limited convolutional codes · IEEE Trans. Commun. 1999
Coding theory › constrained coding › line codes
DC-free codes
0.011999
Some new runlength-limited convolutional codes · IEEE Trans. Commun. 1999
Coding theory › constrained coding
line codes
0.011999
Some new runlength-limited convolutional codes · IEEE Trans. Commun. 1999
Coding theory › constrained coding
runlength-limited codes
0.011999
Some new runlength-limited convolutional codes · IEEE Trans. Commun. 1999

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

generator matrix modification · 0.0
YearPublicationVenuePosition
1999 Some new runlength-limited convolutional codes
abstract
This article presents a method to find convolutional codes with good translation properties by modifying the generator matrix of existing codes and using a bit modifier. Applying the method causes no loss in the error correcting performance and only slight modifications to the architecture of existing encoders and decoders. The new codes' maximal runs of both zeros and ones are constrained. It is shown that some of the new line codes are DC-free.
Marek Sechny, Peter Farkas
IEEE Trans. Commun.1