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

Carlo Bianciardi

dblp:134/5811 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1975
—ORCID · none

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

Theory of computation · 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 › uniquely decodable codes
binoid codes
0.011975
Some burst-error-correcting binoid codes (Corresp.) · IEEE Trans. Inf. Theory 1975
Coding theory › error-correcting codes
burst error correction
0.011975
Some burst-error-correcting binoid codes (Corresp.) · IEEE Trans. Inf. Theory 1975
Coding theory
error-correcting codes
0.011975
Some burst-error-correcting binoid codes (Corresp.) · IEEE Trans. Inf. Theory 1975

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

algebraic code construction · 0.0
YearPublicationVenuePosition
1975 Some burst-error-correcting binoid codes (Corresp.)
abstract
In this paper we present a class of burst-error-correcting binoid codes derived from Samoylenko's codes. These codes, at high code rate, seem to be very useful for a not-too-noisy transmission channel when the encoding-decoding operations are performed by means of a general purpose computer.
Giuliano Benelli, Carlo Bianciardi, Vito Cappellini
IEEE Trans. Inf. Theory2