Tiberiu Constantinescu

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

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

Theory 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
Information theory · 33% Combinatorics and discrete mathematics · 33% Coding theory · 33%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › block codes › linear code
generator matrix
0.011997
Displacement structure and maximum entropy · IEEE Trans. Inf. Theory 1997
Combinatorics and discrete mathematics
matrix theory
0.011997
Displacement structure and maximum entropy · IEEE Trans. Inf. Theory 1997
Information theory › information measures › entropy
maximum entropy
0.011997
Displacement structure and maximum entropy · IEEE Trans. Inf. Theory 1997

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

reflection coefficients · 0.0maximum-entropy formulation · 0.0
YearPublicationVenuePosition
1997 Displacement structure and maximum entropy
abstract
The study of matrices with a displacement structure is mainly concerned with recursions for the so-called generator matrices. The recursion usually involves free parameters, which can be chosen in several ways so as to simplify the resulting algorithm. In this correspondence we present a choice for the parameters that is motivated by a maximum-entropy formulation, This choice further motivates the introduction of the so-called generalized reflection coefficients which are, in general, different from the better known Schur coefficients.
Tiberiu Constantinescu, Ali H. Sayed, Thomas Kailath
IEEE Trans. Inf. Theory1