George Rosen

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

Demo Data from SIGIR 2026 / reviewers in the wild / expert

dblp:120/6561 · DBLP profile ↗

← Back

1ranked-venue papers

0as first author

0since 2021 · last 1994

—ORCID · none

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

Computer 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

1 paper

Coding theory · 100%

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

Topic	Papers	Last	Evidence papers
Coding theory › error-correcting codes convolutional codes	1	1994	The performance of a severely punctured convolutional code, some high rate distance-two block codes, and a Hamming code with maximum likelihood decoding · IEEE Trans. Commun. 1994
Coding theory error-correcting codes	1	1994	The performance of a severely punctured convolutional code, some high rate distance-two block codes, and a Hamming code with maximum likelihood decoding · IEEE Trans. Commun. 1994
Coding theory › error-correcting codes › decoding › decoding algorithms › optimal decoding maximum-likelihood decoding	1	1994	The performance of a severely punctured convolutional code, some high rate distance-two block codes, and a Hamming code with maximum likelihood decoding · IEEE Trans. Commun. 1994
Coding theory › error-correcting codes › convolutional codes punctured convolutional codes	1	1994	The performance of a severely punctured convolutional code, some high rate distance-two block codes, and a Hamming code with maximum likelihood decoding · IEEE Trans. Commun. 1994
Coding theory › error-correcting codes hamming codes	1	1994	The performance of a severely punctured convolutional code, some high rate distance-two block codes, and a Hamming code with maximum likelihood decoding · IEEE Trans. Commun. 1994

Year	Publication	Venue	Position
1994	The performance of a severely punctured convolutional code, some high rate distance-two block codes, and a Hamming code with maximum likelihood decoding abstract A severely punctured version of the well known rate-1/2, constraint length 7 convolutional code is considered for transmission of short to moderate length messages. Transmissions are assumed to be truncated by use of tail bits. By severely punctured the authors mean that the only redundancy conveyed is contained in the tail. It is shown that the resulting codes are high rate distance-2 codes and for certain message lengths they are cyclic. The figure of merit assumed is the probability of not correctly decoding a message, and, with maximum likelihood decoding, significant coding gains are demonstrated. In one case, a Hamming code results and its performance is determined. The coding gains observed range from 3.8 dB for the Hamming code to 2.4 dB for the longest distance-2 code considered, a (5040, 5034) code.> Arnold M. Michelson, George Rosen	IEEE Trans. Commun.	2