Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gur Dial

dblp:40/2847 · DBLP profile ↗
← Back
9ranked-venue papers
6as first author
0since 2021 · last 1991
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 8 · 6 first-authorSystems, architecture and hardware · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware reliability and fault tolerance · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware reliability and fault tolerance › error correction
error-correcting codes
0.011990
Unidirectional Byte Error Detecting Codes for Computer Memory Systems · IEEE Trans. Computers 1990
Hardware reliability and fault tolerance › memory fault tolerance
memory error detection
0.011990
Unidirectional Byte Error Detecting Codes for Computer Memory Systems · IEEE Trans. Computers 1990
Hardware reliability and fault tolerance
soft errors
0.011990
Unidirectional Byte Error Detecting Codes for Computer Memory Systems · IEEE Trans. Computers 1990

Methods — techniques the papers use, named apart from their topics

coding theory · 0.0
YearPublicationVenuePosition
1991 On class weights of CT bursts
Gur Dial
Inf. Sci.1
1991 A short technical note: Comments on "trigonometric entropies, Jensen difference divergence measures, and error bounds"
K. M. Ramachandran, Gur Dial
Inf. Sci.2
1990 Unidirectional Byte Error Detecting Codes for Computer Memory Systems
abstract
Codes are developed for detecting unidirectional errors in t bytes simultaneously (t-UBED) while also providing all unidirectional error detection (AUED). These classes of codes differ from purely all unidirectional error detecting codes in that the errors in one byte may be of the form 1 to 0, while in another byte they may be of the form 0 to 1. The codes utilize 2 B for parity check information. As an example, a code providing 3-UBED+AUED protection for up to 12 information bytes of 8 b each can be constructed.>
Larry A. Dunning, Gur Dial, Murali R. Varanasi
IEEE Trans. Computers2
1988 Shannon's random-cipher result and the R-norm information
Gur Dial
Inf. Sci.1
1986 Lower bounds over codes correcting bursts with a given lee weight or intensity
Gur Dial
Inf. Sci.1
1983 On a coding theorem connected with entropy of order alphaand type beta
Gur Dial
Inf. Sci.1
1983 On axiomatic characterization of information improvement due to N revisions
Gur Dial
Inf. Sci.1
1982 On axiomatic characterization of weighted entropy
Adilina Maria Silva De Cuhna, Ibere Guimaraes, Gur Dial
Inf. Sci.3
1982 Nonadditive entropies of order 1 and type beta and of order alpha and type beta; cascaded channels and the equivocation inequality
Gur Dial
Inf. Sci.1