Demo Data from VLDB 2026 / reviewers in the wild / expert
Jürg Ganz
dblp:13/2573 · also Jürgen Ganz
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 1997
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-authorComputer networks · 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
3 papers |
Coding theory · 66% Algorithms and data structures · 32% Information theory · 2% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory
finite fields |
0.0 | 1 | 1997 | Factoring polynomials using binary representations of finite fields · IEEE Trans. Inf. Theory 1997 |
Algorithms and data structures › symbolic computation › computational algebra
polynomial factorization |
0.0 | 1 | 1997 | Factoring polynomials using binary representations of finite fields · IEEE Trans. Inf. Theory 1997 |
Coding theory › error-correcting codes › cyclic codes
BCH codes |
0.0 | 1 | 1995 | Evaluation of Polynomials Using the Structure of the Coefficients · SIAM J. Comput. 1995 |
Algorithms and data structures › symbolic computation › computational algebra
polynomial evaluation |
0.0 | 1 | 1995 | Evaluation of Polynomials Using the Structure of the Coefficients · SIAM J. Comput. 1995 |
Coding theory › error-correcting codes › decoding › decoding algorithms
syndrome computation |
0.0 | 1 | 1995 | Evaluation of Polynomials Using the Structure of the Coefficients · SIAM J. Comput. 1995 |
Coding theory › error-correcting codes › error detection
cyclic redundancy check |
0.0 | 1 | 1990 | Optimum cycle redundancy-check codes with 16-bit redundancy · IEEE Trans. Commun. 1990 |
Coding theory › error-correcting codes
error detection |
0.0 | 1 | 1990 | Optimum cycle redundancy-check codes with 16-bit redundancy · IEEE Trans. Commun. 1990 |
Coding theory › error-correcting codes › error detection
undetected error probability |
0.0 | 1 | 1990 | Optimum cycle redundancy-check codes with 16-bit redundancy · IEEE Trans. Commun. 1990 |
Information theory › communication channels › channel models › binary-input channel
binary symmetric channel |
0.0 | 1 | 1990 | Optimum cycle redundancy-check codes with 16-bit redundancy · IEEE Trans. Commun. 1990 |
Methods — techniques the papers use, named apart from their topics
binary representation of finite fields · 0.0berlekamp trace algorithm · 0.0polynomial evaluation algorithm · 0.0coefficient structure exploitation · 0.0minimum distance analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | Factoring polynomials using binary representations of finite fieldsabstractThe factorization of polynomials over finite fields is considered. A new deterministic algorithm is proposed that solves the equal-degree factorization problem by combining Berlekamp's (1970) trace algorithm iterative method with the concept of binary representations of finite fields. The interesting aspects of the new algorithm are its simple structure, the easy proof of its correctness, and its efficiency when an efficient realization of the mapping from the finite field to a binary representation is known. Some results about binary representations of finite fields are derived to show that the new factoring algorithm is also nonasymptotically efficient for every finite field. The only practical drawback may be the precomputation of some constants needed in the binary representation, but several suggestions are given to improve this when more about the finite field is known. Jürg Ganz |
IEEE Trans. Inf. Theory | 1 |
| 1995 | Evaluation of Polynomials Using the Structure of the CoefficientsabstractA new algorithm to evaluate polynomials that exploits the structure of their coefficients is proposed. This algorithm is an extension of one due to Savage with the advantage that it is not restricted to coefficients from a set whose cardinality is small compared to the degree of the polynomial. The new algorithm is shown to be asymptotically optimum for evaluating arbitrary functions in finite fields and for evaluating polynomials with real coefficients in a binary fixed-point representation. To illustrate that it is nonasymptotically useful as well, the new algorithm is shown to reduce the time for syndrome calculation for binary Bose-Chaudhuri-Hocquenghem (BCH) codes of practical interest. Jürg Ganz |
SIAM J. Comput. | 1 |
| 1990 | Optimum cycle redundancy-check codes with 16-bit redundancyabstractOptimal binary cyclic redundancy-check codes with 16 parity bits (CRC-16 codes) are presented and compared to those in existing standards for minimum-distance, undetected-error probability on binary symmetric channels (BSCs) and properness. The codes in several cases are seen to be superior at block lengths of practical interest when they are used on low-noise BSCs. The optimum minimum distance obtainable by some CRC-16 codes is determined for all block lengths. For several typical low-noise BSCs the minimum undetected error probability achievable with some CRC-16 codes is given for all block lengths.> Guy Castagnoli, Jürg Ganz, Patrick Graber |
IEEE Trans. Commun. | 2 |