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

Paul Conoval

dblp:122/1433 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

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

Computer networks · 1Applied, interdisciplinary, general and emerging computing · 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
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
burst error channel
0.011993
A method of analysis for interleaved Reed-Solomon coding with erasure decoding on burst error channels · IEEE Trans. Commun. 1993
Coding theory › error-correcting codes › decoding › channel decoding
erasure decoding
0.011993
A method of analysis for interleaved Reed-Solomon coding with erasure decoding on burst error channels · IEEE Trans. Commun. 1993
Coding theory › error-correcting codes
reed-solomon codes
0.011993
A method of analysis for interleaved Reed-Solomon coding with erasure decoding on burst error channels · IEEE Trans. Commun. 1993

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

probability analysis · 0.0
YearPublicationVenuePosition
2018 (WIP) Blockhub: Blockchain-Based Software Development System for Untrusted Environments
abstract
To ensure integrity, trust, immutability and authenticity of software and information (cyber data, user data and attack event data) in a collaborative environment, research is needed for cross-domain data communication, global software collaboration, sharing, access auditing and accountability. Blockchain technology can significantly automate the software export auditing and tracking processes. It allows to track and control what data or software components are shared between entities across multiple security domains. Our blockchain-based solution relies on role-based and attribute-based access control and prevents unauthorized data accesses. It guarantees integrity of provenance data on who updated what software module and when. Furthermore, our solution detects data leakages, made behind the scene by authorized blockchain network participants, to unauthorized entities. Our approach is used for data forensics/provenance, when the identity of those entities who have accessed/ updated/ transferred the sensitive cyber data or sensitive software is determined. All the transactions in the global collaborative software development environment are recorded in the blockchain public ledger and can be verified any time in the future. Transactions can not be repudiated by invokers. We also propose modified transaction validation procedure to improve performance and to protect permissioned IBM Hyperledger-based blockchains from DoS attacks, caused by bursts of invalid transactions.
Denis A. Ulybyshev, Miguel Villarreal-Vasquez, Bharat K. Bhargava, Ganapathy Mani, Steve Seaberg, Paul Conoval, Jason Kobes
IEEE CLOUD6
1993 A method of analysis for interleaved Reed-Solomon coding with erasure decoding on burst error channels
abstract
A practical definition of an erasure is presented and leads to new expressions for correct and incorrect decoding probabilities for Reed-Solomon codes, assuming an incomplete decoder. The main benefit of this approach is that, in contrast with the usual approach, one is able to analytically demonstrate the performance improvement provided by errors-and-erasures decoding relative to errors-only decoding. A technique is presented for evaluating the performance of Reed-Solomon codes for both types of decoding on an interleaved burst error channel such as is seen in digital magnetic tape recording. Several illustrative examples are included.>
William E. Ryan, Paul Conoval
IEEE Trans. Commun.2