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

Demetre C. Voukalis

dblp:08/5653 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1988
—ORCID · none

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

Databases, data management, data science and information retrieval · 1 · 1 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%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
concatenated codes
0.011982
A new series of concatenated codes subject to matrix type-B codes · IEEE Trans. Inf. Theory 1982
Coding theory › error-correcting codes › block codes › array codes
matrix codes
0.011982
A new series of concatenated codes subject to matrix type-B codes · IEEE Trans. Inf. Theory 1982
Coding theory › error-correcting codes
burst error correction
0.011982
A new series of concatenated codes subject to matrix type-B codes · IEEE Trans. Inf. Theory 1982
Coding theory
error-correcting codes
0.011982
A new series of concatenated codes subject to matrix type-B codes · IEEE Trans. Inf. Theory 1982
YearPublicationVenuePosition
1988 A new concatenated BCH-matrix type-B code
Demetre C. Voukalis
Inf. Sci.1
1982 A new series of concatenated codes subject to matrix type-B codes
abstract
Some important aspects of a series of concatenated codes subjected to matrix type-Bcodes are investigated. Concatenated matrix codes and the concatenated quadratic residue codes especially are emphasized. An analysis of the error patterns, which can be corrected with the matrix coding, also is given. These codes are suitable for compound channels with memory (i.e., channels on which burst, cluster, and random errors occur). Explicit formulas are given for the number of bursts, cluster, and random errors that can be corrected with these codes. Decoding schemes and techniques for studying error propagation in the proposed codes are given. In particular a new decoding algorithm for a concatenated matrix code is given. The performance of coding and decoding schemes of the various types of concatenated codes can be tested in practice.
Demetre C. Voukalis
IEEE Trans. Inf. Theory1