EDBT 2026 Demo / reviewers in the wild / expert
Herbert D. Goldman
dblp:134/3739
· DBLP profile ↗
6ranked-venue papers
5as first author
0since 2021 · last 1970
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4 · 3 first-authorSystems, architecture and hardware · 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
4 papers |
Coding theory · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Hardware reliability and fault tolerance · 91% Integrated circuit design · 9% |
Topics — the 12 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory
error-correcting codes |
0.0 | 3 | 1970 | Constructive encoder for multiple burst correction of binary convolutional codes (Corresp.) · IEEE Trans. Inf. Theory 1970 Threshold decoding selected rate one-half and one-third convolutional codes (Corresp.) · IEEE Trans. Inf. Theory 1969 The weight structure of some Bose-Chaudhuri codes (Corresp.) · IEEE Trans. Inf. Theory 1968 |
Coding theory › error-correcting codes
convolutional codes |
0.0 | 2 | 1970 | Constructive encoder for multiple burst correction of binary convolutional codes (Corresp.) · IEEE Trans. Inf. Theory 1970 Threshold decoding selected rate one-half and one-third convolutional codes (Corresp.) · IEEE Trans. Inf. Theory 1969 |
Coding theory › error-correcting codes › cyclic codes
BCH codes |
0.0 | 2 | 1969 | Quasi-self-reciprocal polynomials and potentially large minimum distance BCH codes · IEEE Trans. Inf. Theory 1969 The weight structure of some Bose-Chaudhuri codes (Corresp.) · IEEE Trans. Inf. Theory 1968 |
Coding theory › error-correcting codes
burst error correction |
0.0 | 1 | 1970 | Constructive encoder for multiple burst correction of binary convolutional codes (Corresp.) · IEEE Trans. Inf. Theory 1970 |
Coding theory › error-correcting codes
decoding |
0.0 | 1 | 1969 | Threshold decoding selected rate one-half and one-third convolutional codes (Corresp.) · IEEE Trans. Inf. Theory 1969 |
Coding theory › error-correcting codes › decoding › decoding algorithms
threshold decoding |
0.0 | 1 | 1969 | Threshold decoding selected rate one-half and one-third convolutional codes (Corresp.) · IEEE Trans. Inf. Theory 1969 |
Hardware reliability and fault tolerance
reliability modeling |
0.0 | 1 | 1968 | Considering Solder Connections, Does Triplicated Majority Voting Apply to Integrated Circuits · IEEE Trans. Computers 1968 |
Hardware reliability and fault tolerance › redundancy › modular redundancy
triple modular redundancy |
0.0 | 1 | 1968 | Considering Solder Connections, Does Triplicated Majority Voting Apply to Integrated Circuits · IEEE Trans. Computers 1968 |
Coding theory
weight structure |
0.0 | 1 | 1968 | The weight structure of some Bose-Chaudhuri codes (Corresp.) · IEEE Trans. Inf. Theory 1968 |
Hardware reliability and fault tolerance
error-correcting codes for memory |
0.0 | 1 | 1964 | Protecting Core Memory Circuits with Error Correcting Cyclic Codes · IEEE Trans. Electron. Comput. 1964 |
Hardware reliability and fault tolerance
memory reliability |
0.0 | 1 | 1964 | Protecting Core Memory Circuits with Error Correcting Cyclic Codes · IEEE Trans. Electron. Comput. 1964 |
Integrated circuit design
packaging |
0.0 | 1 | 1968 | Considering Solder Connections, Does Triplicated Majority Voting Apply to Integrated Circuits · IEEE Trans. Computers 1968 |
Methods — techniques the papers use, named apart from their topics
finite field theory · 0.0cyclic codes · 0.0computer simulation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1970 | Constructive encoder for multiple burst correction of binary convolutional codes (Corresp.)abstractA class of multiple burst convolution codes generated by encoders that are constructed using a single digital "building block" is given. The number of identical small sections used in the encoder depends upon the degree of error correction desired. Herbert D. Goldman, K. Mandu, David Knee, J. Paci |
IEEE Trans. Inf. Theory | 1 |
| 1969 | Threshold decoding selected rate one-half and one-third convolutional codes (Corresp.)abstractThe results of a search for threshold decoding equations are presented for a selection of different length, rate\frac{1}{2}and\frac{1}{3}convolutional codes. The decoders corresponding to these equations are simulated on a computer in order to perform an error analysis. Error analysis for seven rate\frac{1}{2}codes (lengths span the range fromn = 4to22) and five rate\frac{1}{3}codes (lengths span the range fromn = 6to21) are presented. Herbert D. Goldman, William H. Rowan, M. Tolhurst |
IEEE Trans. Inf. Theory | 1 |
| 1969 | Quasi-self-reciprocal polynomials and potentially large minimum distance BCH codesabstractWe consider the problem of determining which irreducible polynomials with coefficients in a finite fieldGF(q)are quasi-self-reciprocal. Our characterization of these polynomials is in terms of a set of positive integers,Dq.Dqhas applications to certain BCH codes. This work determines those codes (as specified byn, the length of the code, and not byk) whose minimum-distance lower bound doubles when the root one is added to the code generator. David Knee, Herbert D. Goldman |
IEEE Trans. Inf. Theory | 2 |
| 1968 | Considering Solder Connections, Does Triplicated Majority Voting Apply to Integrated CircuitsabstractAbstract—A procedure for incorporating the deleterious effect of solder connections into reliability calculations for integrated circuits is presented. This is incorporated into a study concerning the advisability of applying triplicated majority voting to integrated circuits. Herbert D. Goldman, J. Rom |
IEEE Trans. Computers | 1 |
| 1968 | The weight structure of some Bose-Chaudhuri codes (Corresp.)
Herbert D. Goldman, Merwin Kliman, Harold Smola |
IEEE Trans. Inf. Theory | 1 |
| 1964 | Protecting Core Memory Circuits with Error Correcting Cyclic Codes
Herbert D. Goldman |
IEEE Trans. Electron. Comput. | 1 |