V
Vojin Senk
Researcher at University of Novi Sad
Publications - 75
Citations - 876
Vojin Senk is an academic researcher from University of Novi Sad. The author has contributed to research in topics: Decoding methods & Convolutional code. The author has an hindex of 12, co-authored 73 publications receiving 833 citations. Previous affiliations of Vojin Senk include Karlsruhe Institute of Technology.
Papers
More filters
Journal ArticleDOI
Advanced impulse Detection Based on pixel-wise MAD
TL;DR: A new method for impulse noise removal is presented, where a robust estimator of the variance, MAD (median of the absolute deviations from the median), is modified and used to efficiently separate noisy pixels from the image details.
Journal ArticleDOI
Expanding window fountain codes for unequal error protection
TL;DR: A novel approach to provide unequal error protection (UEP) using rateless codes over erasure channels, named Expanding Window Fountain (EWF) codes, is developed and discussed, providing better performance of UEP scheme, which is confirmed both theoretically and experimentally.
Journal ArticleDOI
Generalized ACE Constrained Progressive Edge-Growth LDPC Code Design
Dejan Vukobratovic,Vojin Senk +1 more
TL;DR: A generalization of the progressive edge-growth (PEG) algorithm is proposed with the aim of designing LDPC code graphs with substantially improved approximated cycle extrinsic message degree (ACE) properties.
Journal ArticleDOI
On the entropy of couplings
TL;DR: Some general properties of Shannon information measures are investigated over sets of probability distributions with restricted marginals and the notion of minimum entropy coupling is introduced and its relevance is demonstrated in information-theoretic, computational, and statistical contexts.
Journal ArticleDOI
Transactions papers evaluation and design of irregular LDPC codes using ACE spectrum
Dejan Vukobratovic,Vojin Senk +1 more
TL;DR: This work introduces the ACE spectrum of LDPC codes as a useful tool for evaluation of codes from selected irregular LDPC code ensembles and generalizes the ACE constrained design algorithm, making it more flexible and efficient.