Demo Data from VLDB 2026 / reviewers in the wild / expert
Muzhong Wang
dblp:99/3733
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 1997
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 3 first-authorSystems, architecture and hardware · 2
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
2 papers |
Coding theory · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Integrated circuit design · 100% | |
| Network and information security
2 papers |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 11 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
finite field arithmetic |
0.0 | 2 | 1993 | A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields · IEEE Trans. Computers 1993 Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2^m) · IEEE Trans. Computers 1992 |
Coding theory › finite fields
dual basis |
0.0 | 1 | 1997 | Normal basis of the finite field F2(p-1)pm over F2 · IEEE Trans. Inf. Theory 1997 |
Coding theory
finite fields |
0.0 | 1 | 1997 | Normal basis of the finite field F2(p-1)pm over F2 · IEEE Trans. Inf. Theory 1997 |
Coding theory › finite fields › finite field arithmetic
normal basis |
0.0 | 1 | 1997 | Normal basis of the finite field F2(p-1)pm over F2 · IEEE Trans. Inf. Theory 1997 |
Integrated circuit design
digital circuit design |
0.0 | 1 | 1992 | Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2^m) · IEEE Trans. Computers 1992 |
Integrated circuit design › finite field arithmetic
finite field arithmetic unit |
0.0 | 1 | 1992 | Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2^m) · IEEE Trans. Computers 1992 |
Integrated circuit design › digital circuit design › arithmetic circuit design
modular multiplier |
0.0 | 1 | 1992 | Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2^m) · IEEE Trans. Computers 1992 |
Coding theory › source coding › variable-length codes
integer encoding |
0.0 | 1 | 1988 | Almost asymptotically optimal flag encoding of the integers · IEEE Trans. Inf. Theory 1988 |
Coding theory › source coding › variable-length codes
prefix codes |
0.0 | 1 | 1988 | Almost asymptotically optimal flag encoding of the integers · IEEE Trans. Inf. Theory 1988 |
Coding theory
source coding |
0.0 | 1 | 1988 | Almost asymptotically optimal flag encoding of the integers · IEEE Trans. Inf. Theory 1988 |
Coding theory › source coding
universal coding |
0.0 | 1 | 1988 | Almost asymptotically optimal flag encoding of the integers · IEEE Trans. Inf. Theory 1988 |
Methods — techniques the papers use, named apart from their topics
explicit construction · 0.0bit-stuffing · 0.0asymptotic efficiency analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | Normal basis of the finite field F2(p-1)pm over F2abstractThe determination of normal bases for finite fields, particularly over the finite field F/sub 2/, is of importance in applications such as coding and cryptography. This correspondence gives an explicit normal basis for a finite field F/sub 2/(p-1)p/sup m/ over F/sub 2/, when 2 is a primitive element module p/sup 2/. In the case when p=3, an explicit dual basis is also obtained. Muzhong Wang, Ian F. Blake |
IEEE Trans. Inf. Theory | 1 |
| 1993 | A Modified Massey-Omura Parallel Multiplier for a Class of Finite FieldsabstractA Massey-Omura parallel multiplier of finite fields GF(2/sup m/) contains m identical blocks whose inputs are cyclically shifted versions of one another. It is shown that for fields GF(2/sup m/) generated by irreducible all one polynomials, a portion of the block is independent of the input cyclic shift; hence, the multiplier contains redundancy. By removing the redundancy, a modified parallel multiplier is presented which is modular and has a lower circuit complexity.> M. Anwar Hasan, Muzhong Wang, Vijay K. Bhargava |
IEEE Trans. Computers | 2 |
| 1992 | Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2^m)abstractStructures for parallel multipliers of a class of fields GF(2/sup m/) based on irreducible all one polynomials (AOP) and equally spaced polynomials (ESP) are presented. The structures are simple and modular, which is important for hardware realization. Relationships between an irreducible AOP and the corresponding irreducible ESPs have been exploited to construct ESP-based multipliers of large fields by a regular expansion of the basic modules of the AOP-based multiplier of a small field. Some features of the structures also enable a fast implementation of squaring and multiplication algorithms and therefore make fast exponentiation and inversion possible. It is shown that, if for a certain degree, an irreducible AOP as well as an irreducible ESP exist, then from the complexity point of view, it is advantageous to use the ESP-based parallel multiplier.> M. Anwar Hasan, Muzhong Wang, Vijay K. Bhargava |
IEEE Trans. Computers | 2 |
| 1990 | Bit Serial Multiplication in Finite FieldsabstractBit serial multiplication schemes for hardware implementation of arithmetic in a finite field of characteristic two are considered. In addition, certain aspects of polynomial bases in finite fields are investigated. Muzhong Wang, Ian F. Blake |
SIAM J. Discret. Math. | 1 |
| 1988 | Almost asymptotically optimal flag encoding of the integersabstractA simple prefix-free encoding scheme for the positive integers is proposed in which a flag of f zeros is used to mark the end of a codeword, and bit stuffing is used to prevent premature appearance of the flag in the conventional binary coding of the integers. It is shown that this coding scheme is universal in the sense defined by P. Elias (1975) and that for large f its asymptotic efficiency is virtually 1. > Muzhong Wang |
IEEE Trans. Inf. Theory | 1 |