Demo Data from VLDB 2026 / reviewers in the wild / expert
Jens P. Pedersen
dblp:51/797
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1991
—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 |
Coding theory · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › block codes
MDS codes |
0.0 | 1 | 1991 | Classification of pseudo-cyclic MDS codes · IEEE Trans. Inf. Theory 1991 |
Coding theory › error-correcting codes › block codes › linear code
pseudo-cyclic codes |
0.0 | 1 | 1991 | Classification of pseudo-cyclic MDS codes · IEEE Trans. Inf. Theory 1991 |
Coding theory › error-correcting codes › algebraic geometry code
generalized reed-solomon codes |
0.0 | 1 | 1991 | Classification of pseudo-cyclic MDS codes · IEEE Trans. Inf. Theory 1991 |
Methods — techniques the papers use, named apart from their topics
finite field analysis · 0.0algebraic coding theory · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1991 | Classification of pseudo-cyclic MDS codesabstractLinear codes are considered. A code is characterized by the length n, the dimension k, and the minimum distance d. An (n,k,d) code over the finite field GF(q) is said to be maximum distance separable (MDS) if d=n-k+1. A. Krishna and D.V. Sarwate (1990) investigated the existence of pseudo-cyclic MDS codes over GF(q) of length n, where n divides q-1 or q+1. It is shown that the pseudo-cyclic MDS codes constructed by Krishna and Sarwate are generalised Reed-Solomon codes. Pseudo-cyclic codes are studied over GF(q), where n and q=p/sup h/ are not relatively prime. It is proven that pseudo-cyclic (n,k) MDS codes modulo (x/sup n/-a) over GF(q) exist, if and only if n= p. Furthermore, any pseudo-cyclic (p,k) code modulo (x/sup p/-a) over GF(q) turns out to be MDS and generalized Reed-Solomon. It is explicitly proven that some classes of pseudo-cyclic (n,k) MDS codes over GF(q) are generalized Reed-Solomon codes. Furthermore, pseudo-cyclic (q+1,4) MDS codes over GF(q), q even, are completely classified.> Jens P. Pedersen, Carsten Dahl |
IEEE Trans. Inf. Theory | 1 |