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

Damián G. Levin

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

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

Computer networks · 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 networks
1 paper
Physical-layer communications · 100%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
channel coding
0.112006
Quasi-chaotic coding over GF(q) · IEEE Trans. Commun. 2006
Physical-layer communications › channel coding
error control coding
0.112006
Quasi-chaotic coding over GF(q) · IEEE Trans. Commun. 2006
Cryptographic primitives and cryptanalysis
stream cipher
0.012006
Quasi-chaotic coding over GF(q) · IEEE Trans. Commun. 2006

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

quasi-chaotic sequence generation · 0.1galois field arithmetic · 0.1
YearPublicationVenuePosition
2006 Quasi-chaotic coding over GF(q)
abstract
In this paper, we present quasi-chaotic (QC) schemes for secure digital communication systems, designed over Galois fields (GFs) with optimal randomness properties. Schemes with the maximum-output sequence length (all-zero input response) are presented for different GFs. Two coefficients are used to quantitatively measure the proximity of the behavior of these schemes with respect to the ideal white noise behavior. The proposed schemes outperform those presented by Frey in his paper, and achieve the optimal QC properties available for a given chaotic digital scheme. The proposed schemes have also a very little loss in bit-error rate performance so that they are a good alternative to the design of systems for which encryption and error correction are important joint goals. They can be implemented with time-variant coefficients in order to highly improve the cryptographic properties of the transmission.
David M. Petruzzi, Jorge Castiñeira Moreira, Damián G. Levin
IEEE Trans. Commun.3