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

Slobodan Kozic

dblp:67/2442 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2009
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-authorComputer 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.

Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › concatenated codes
turbo-like codes
0.112009
Turbo-like structures for chaos encoding and decoding · IEEE Trans. Commun. 2009
Coding theory › error-correcting codes › error probability analysis
error floor analysis
0.012009
Turbo-like structures for chaos encoding and decoding · IEEE Trans. Commun. 2009

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

minimum distance analysis · 0.1convergence analysis · 0.1
YearPublicationVenuePosition
2009 Turbo-like structures for chaos encoding and decoding
abstract
In this paper, we explain how to build a turbo-like structure with binary inputs and chaotic outputs for efficient coding and decoding in additive white Gaussian noise (AWGN). We analyze the convergence of the decoding algorithm, the performance in the error floor region and explain minimum distance properties of the resulting codes.
Francisco J. Escribano, Slobodan Kozic, Miguel A. F. Sanjuán, Martin Hasler
IEEE Trans. Commun.2
2006 Belief propagation decoding for codes based on discretized chaotic maps
abstract
In this paper a class of discretized piecewise linear chaotic maps of a very high dimensions are used for communication over a noisy channel. An information payload that is sent over a channel is controlled in the transmitter and is related to the symbolic sequences of chaotic trajectory. Such chaotic systems are used for generating new ensembles of nonlinear codes. The proposed decoding method is based on belief propagation principle, such that a complete link to modern coding theory is established. The transmission of information using chaotic systems, usually showing mediocre performance, here on contrary, have a very good performance with a threshold for a certain level of signal-to-noise ratio (SNR)
Slobodan Kozic, Martin Hasler
ISCAS1