Demo Data from VLDB 2026 / reviewers in the wild / expert
Alain Poli
dblp:99/3732
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 1995
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory
finite fields |
0.0 | 1 | 1995 | Constructing SCN bases in characteristic 2 · IEEE Trans. Inf. Theory 1995 |
Coding theory › finite fields › finite field arithmetic
normal basis |
0.0 | 1 | 1995 | Constructing SCN bases in characteristic 2 · IEEE Trans. Inf. Theory 1995 |
Coding theory › finite fields › finite field arithmetic
basis construction |
0.0 | 1 | 1995 | Constructing SCN bases in characteristic 2 · IEEE Trans. Inf. Theory 1995 |
Coding theory › finite fields
finite field arithmetic |
0.0 | 1 | 1995 | Constructing SCN bases in characteristic 2 · IEEE Trans. Inf. Theory 1995 |
Methods — techniques the papers use, named apart from their topics
deterministic algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1995 | A Deterministic Constructin of Normal Bases With Complexity O(n³+n log n log(log n) log q)
Alain Poli |
J. Symb. Comput. | 1 |
| 1995 | Constructing SCN bases in characteristic 2abstractA simple deterministic algorithm to construct a normal basis of GF(q/sup n/) over GF(q) (q=p/sup r/, p prime) is given. When p=2, the authors deduce a (self complementary normal-SCN) basis of GF(q/sup n/) over GF(q) for n odd, or n=2t, t odd. In characteristic 2 these cases are known to be the only possible ones for which there exists an SCN basis.> Alain Poli |
IEEE Trans. Inf. Theory | 1 |
| 1982 | Data transmission and error correcting codesabstractData transmission simulation, protected by error correcting code, through noisy channel, is one of A.A.E.C.C. principal research axis. We present two parts of an application of our works ; befor that, we present some recalls of error correcting codes 'theory. a) The hardware part. Automaton DOLVRON-1, completely elaborated in A.A.E.C.C. Lab, is placed below a video cine-camera and above three video monitors. DOLVRON-1 realizes the visalisation, in real time, of three pictures : the initial one, the noisy one, and the picture restaured after protection, jamming and decoding. b) The software part. SITIN-1 is a powerfull soft. It simulates digital pictures transmission protected by Fires'codes, through noisy channel. SITIN-2 (second generation) simulates a condensed Braille transmission by satellite TELECOM-1. F. Delamotte, M. C. Gennero, Alain Poli |
ICASSP | 3 |