Demo Data from EDBT 2026 / reviewers in the wild / expert
Andrew M. Steane
dblp:67/6147
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1999
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 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
2 papers |
Quantum computing and quantum information · 71% Coding theory · 29% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Quantum computing and quantum information
quantum error correction |
0.0 | 2 | 1999 | Enlargement of Calderbank-Shor-Steane quantum codes · IEEE Trans. Inf. Theory 1999 Quantum Reed-Muller codes · IEEE Trans. Inf. Theory 1999 |
Quantum computing and quantum information › quantum error correction
CSS codes |
0.0 | 1 | 1999 | Enlargement of Calderbank-Shor-Steane quantum codes · IEEE Trans. Inf. Theory 1999 |
Coding theory › error-correcting codes › error detection and correction
classical error-correcting code |
0.0 | 2 | 1999 | Enlargement of Calderbank-Shor-Steane quantum codes · IEEE Trans. Inf. Theory 1999 Quantum Reed-Muller codes · IEEE Trans. Inf. Theory 1999 |
Coding theory › error-correcting codes › cyclic codes
BCH codes |
0.0 | 1 | 1999 | Enlargement of Calderbank-Shor-Steane quantum codes · IEEE Trans. Inf. Theory 1999 |
Coding theory › error-correcting codes
reed-muller codes |
0.0 | 1 | 1999 | Quantum Reed-Muller codes · IEEE Trans. Inf. Theory 1999 |
Methods — techniques the papers use, named apart from their topics
dual-containing code construction · 0.0code enlargement · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1999 | Quantum Reed-Muller codesabstractA set of quantum error-correcting codes based on classical Reed-Muller codes is described. The codes have parameters [[n,k,d]]=[[2/sup r/,s/sup r/-C(r,t)-2/spl Sigma//sub i=0//sup t-1/C(r,i),2/sup t/+2/sup t-1/]]. Andrew M. Steane |
IEEE Trans. Inf. Theory | 1 |
| 1999 | Enlargement of Calderbank-Shor-Steane quantum codesabstractIt is shown that a classical error correcting code C=[n,k,d] which contains its dual, C/sup /spl perp///spl sube/C, and which can be enlarged to C'=[n,k'>k+1,d'], can be converted into a quantum code of parameters [[n,k+k'-n,min(d,[3d'/2])]]. This is a generalization of a previous construction, it enables many new codes of good efficiency to be discovered. Examples based on classical Bose-Chaudhuri-Hocquenghem (BCH) codes are discussed. Andrew M. Steane |
IEEE Trans. Inf. Theory | 1 |