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

Valentin Ovsienko

dblp:95/11140 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2013
0000-0003-0146-1573ORCID · reported

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

Theory of computation · 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 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › space-time codes › space-time block codes › orthogonal designs
complex orthogonal design
0.212013
Orthogonal Designs and a Cubic Binary Function · IEEE Trans. Inf. Theory 2013
Coding theory › error-correcting codes › space-time codes › space-time block codes
orthogonal designs
0.212013
Orthogonal Designs and a Cubic Binary Function · IEEE Trans. Inf. Theory 2013
Coding theory › error-correcting codes › space-time codes
space-time block codes
0.212013
Orthogonal Designs and a Cubic Binary Function · IEEE Trans. Inf. Theory 2013

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

non-associative algebra · 0.2cubic binary function · 0.2
YearPublicationVenuePosition
2013 Orthogonal Designs and a Cubic Binary Function
abstract
Orthogonal designs are fundamental mathematical notions used in the construction of space time block codes for wireless transmissions. Designs have two important parameters, the rate and the decoding delay; the main problem of the theory is to construct designs maximizing the rate and minimizing the decoding delay. All known constructions of CODs are inductive or algorithmic. In this paper, we present an explicit construction of optimal CODs. We do not apply recurrent procedures and do calculate the matrix elements directly. Our formula is based on a cubic function in two binaryn-vectors. In our previous work (Comm. Math. Phys., 2010, and J. Pure and Appl. Algebra, 2011), we used this function to define a series of non-associative algebras generalizing the classical algebra of octonions and to obtain sum of squares identities of Hurwitz-Radon type.
Sophie Morier-Genoud, Valentin Ovsienko
IEEE Trans. Inf. Theory2