Nikolai L. Manev

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 EDBT 2026 / reviewers in the wild / expert

dblp:38/8622 · DBLP profile ↗

← Back

4ranked-venue papers

0as first author

0since 2021 · last 2004

0000-0003-3618-4406ORCID · corroborated

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

Theory of computation · 3Applied, interdisciplinary, general and emerging computing · 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 3, each with the papers that count most for it

Topic	Papers	Last	Evidence papers
Coding theory › error-correcting codes › block codes › linear code binary linear codes	1	1987	New bounds on binary linear codes of dimension eight · IEEE Trans. Inf. Theory 1987
Coding theory › error-correcting codes › coding bounds code length bounds	1	1987	New bounds on binary linear codes of dimension eight · IEEE Trans. Inf. Theory 1987
Coding theory › error-correcting codes coding bounds	1	1987	New bounds on binary linear codes of dimension eight · IEEE Trans. Inf. Theory 1987

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

combinatorial bounds · 0.0

Year	Publication	Venue	Position
2004	Derivation on bit error probability of coded QAM using integer codes abstract Coded modulation refers to the process of combined and jointly optimized channel coding and modulation scheme. In this paper, block coded modulation using integer codes and its performance is evaluated by deriving a formula of its bit error probability for AWGN channel. The probability of correct detection of the received signal is a square of the corresponding probability. The detector correctly demodulates the received signal with an average probability in uncoded and coded case respectively. Hristo Kostadinov, Hiroyoshi Morita, Nikolai L. Manev	ISIT	3
2003	On the Non-minimal Codewords in Binary Reed-Muller Codes Yuri L. Borissov, Nikolai L. Manev, Svetla Nikova	Discret. Appl. Math.	2
1987	New bounds on binary linear codes of dimension eight abstract Letn(k,d)be the smallest integernsuch that a binary linear code of lengthn, dimensionk, and minimum distance at leastdexists. New results are given that improve the best previously known bounds onn(8,d). Stefan M. Dodunekov, Tor Helleseth, Nikolai L. Manev, Øyvind Ytrehus	IEEE Trans. Inf. Theory	3
1985	An improvement of the Griesmer bound for some small minimum distances Stefan M. Dodunekov, Nikolai L. Manev	Discret. Appl. Math.	2