Demo Data from EDBT 2026 / reviewers in the wild / expert
Gregory Freiman
dblp:55/45
· DBLP profile ↗
4ranked-venue papers
3as first author
0since 2021 · last 2004
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 1 first-authorComputer networks · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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.
| Computer networks
1 paper |
Physical-layer communications · 100% | |
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Physical-layer communications › modulation › phase-shift keying
BPSK |
0.0 | 1 | 2004 | A method to suppress high peaks in BPSK-modulated OFDM signal · IEEE Trans. Commun. 2004 |
Physical-layer communications › modulation › multicarrier modulation
OFDM |
0.0 | 1 | 2004 | A method to suppress high peaks in BPSK-modulated OFDM signal · IEEE Trans. Commun. 2004 |
Physical-layer communications › modulation › multicarrier modulation › OFDM
peak-to-average power ratio reduction |
0.0 | 1 | 2004 | A method to suppress high peaks in BPSK-modulated OFDM signal · IEEE Trans. Commun. 2004 |
Coding theory
constrained coding |
0.0 | 1 | 1999 | Asymptotically exact bounds on the size of high-order spectral-null codes · IEEE Trans. Inf. Theory 1999 |
Coding theory › constrained coding
spectral-null codes |
0.0 | 1 | 1999 | Asymptotically exact bounds on the size of high-order spectral-null codes · IEEE Trans. Inf. Theory 1999 |
Methods — techniques the papers use, named apart from their topics
signal design · 0.0combinatorial enumeration · 0.0asymptotic analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2004 | On signals with very high peak-to-average power ratioabstractThis paper address the problem of classification of BPSK-modulated multicarrier signals with the peak-to-average power ratio (PAPR) exceeding 3/4 of the maximal possible value. By providing a simple characterization of such signals, an upper bound on their number are derived and propose a simple sufficient condition for the signals to have low PAPR. Based on this, a simple method for generation of signals with guaranteed PAPR gain of more than 2.5 dB using only two redundant tones are described. Gregory Freiman, Simon Litsyn, Alexander A. Yudin |
ISIT | 1 |
| 2004 | A method to suppress high peaks in BPSK-modulated OFDM signalabstractWe address the problem of classification of binary phase-shift keying-modulated multicarrier signals with the peak-to-average power ratio (PAPR) exceeding 3/4 of the maximal possible value. By providing a simple characterization of such signals, we derive an upper bound on their number, and propose a simple sufficient condition for the signals to have low PAPR. Based on this, we describe a simple method for generation of signals with guaranteed PAPR gain of more than 2.5 dB using only two redundant tones. Gregory Freiman, Simon Litsyn, Alexander A. Yudin |
IEEE Trans. Commun. | 1 |
| 1999 | Asymptotically exact bounds on the size of high-order spectral-null codesabstractThe spectral-null code S(n, k) of kth order and length n is the union of n-tuples with /spl plusmn/1 components, having kth-order spectral-null at zero frequency. We determine the exact asymptotic in n behavior of the size of such codes. In particular, we prove that for n satisfying some divisibility conditions, log/sub 2/|S(n, k)|=n-k/sup 2//2log/sub 2/n+c/sub k/+o(1), where c/sub k/ is a constant depending only on k and o(1) tends to zero when n grows. This is an improvement on the earlier known bounds due to Roth, Siegel, and Vardy (see ibid., vol40, p.1826-40, 1994). Gregory Freiman, Simon Litsyn |
IEEE Trans. Inf. Theory | 1 |
| 1989 | Solving dense subset-sum problems by using analytical number theory
Mark Chaimovich, Gregory Freiman, Zvi Galil |
J. Complex. | 2 |