Demo Data from EDBT 2026 / reviewers in the wild / expert
F. Zeynep Köksal
dblp:82/3884
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1992
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 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 › decoding
decoding algorithms |
0.0 | 1 | 1992 | Comments on the Decoding Algorithms of DBEC-TBED Reed-Solomon Codes · IEEE Trans. Computers 1992 |
Coding theory › error-correcting codes
error detection and correction |
0.0 | 1 | 1992 | Comments on the Decoding Algorithms of DBEC-TBED Reed-Solomon Codes · IEEE Trans. Computers 1992 |
Coding theory › error-correcting codes
reed-solomon codes |
0.0 | 1 | 1992 | Comments on the Decoding Algorithms of DBEC-TBED Reed-Solomon Codes · IEEE Trans. Computers 1992 |
Methods — techniques the papers use, named apart from their topics
frequency-domain decoding · 0.0berlekamp-massey algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | Comments on the Decoding Algorithms of DBEC-TBED Reed-Solomon CodesabstractTwo decoding algorithms for double-byte error correcting-triple-byte error detecting (DBEC-TBED) Reed-Solomon (RS) codes are implemented using Turbo-Pascal. The first one is the noniterative decoding algorithm developed by R.H. Deng and D.J. Costello (ibid., vol.C-36, p.1359-63, Nov. 1987). The second one is a frequency-domain RS decoding method given by R.E. Blahut (Theory and Practice of Error Control Codes, Reading, MA, Addison-Wesley, 1983), which implements a standard Berlekamp-Massey algorithm; it is used as reference. Several executions of the software show that the algorithm of Deng-Costello fails in the detection of some triple-byte errors, whereas the standard reference algorithm succeeds in detection always. An example is presented in which the algorithm of Deng-Costello cannot detect a triple-error pattern. The authors also propose a modification to the algorithm of Deng-Costello for its proper operation and make a comparison between the two algorithms.> F. Zeynep Köksal, Melek Diker Yücel |
IEEE Trans. Computers | 1 |