


default search action
Filip Paluncic
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Filip Paluncic
, Bodhaswar T. Maharaj
:
Quasi-Enumerative Coding of Balanced Run-Length Limited Codes. IEEE Access 12: 39375-39389 (2024) - [c6]Filip Paluncic, Daniella Paluncic, Bodhaswar T. Maharaj:
Capacity of Runlength-Limited and GC-Content Constrained Codes for DNA Data Storage. ISIT 2024: 1937-1942
2010 – 2019
- 2019
- [j7]Filip Paluncic
, Bodhaswar T. Maharaj
:
Capacity-Approaching Non-Binary Balanced Codes Using Auxiliary Data. IEEE Trans. Inf. Theory 65(1): 159-173 (2019) - [j6]Filip Paluncic
, Bodhaswar T. Maharaj
, Hendrik C. Ferreira
:
Variable- and Fixed-Length Balanced Runlength-Limited Codes Based on a Knuth-Like Balancing Method. IEEE Trans. Inf. Theory 65(11): 7045-7066 (2019) - [c5]Shi Wang
, Attahiru Sule Alfa, Bodhaswar T. Maharaj, Filip Paluncic:
A Queueing Framework for Channel Allocation Protocol in Multi-user Multi-channel Cognitive Radio Network. ICCT 2019: 734-739 - 2018
- [j5]Filip Paluncic
, Attahiru Sule Alfa, Bodhaswar T. Maharaj, Hilary M. Tsimba:
Queueing Models for Cognitive Radio Networks: A Survey. IEEE Access 6: 50801-50823 (2018) - 2017
- [c4]Filip Paluncic, Bodhaswar T. Maharaj:
Using Bivariate Generating Functions to Count the Number of Balanced Runlength-Limited Words. GLOBECOM 2017: 1-6 - 2013
- [j4]Filip Paluncic, Khaled A. S. Abdel-Ghaffar, Hendrik C. Ferreira
:
Insertion/Deletion Detecting Codes and the Boundary Problem. IEEE Trans. Inf. Theory 59(9): 5935-5943 (2013) - 2012
- [j3]Khaled A. S. Abdel-Ghaffar, Filip Paluncic, Hendrik C. Ferreira
, Willem A. Clarke:
On Helberg's Generalization of the Levenshtein Code for Multiple Deletion/Insertion Error Correction. IEEE Trans. Inf. Theory 58(3): 1804-1808 (2012) - [j2]Filip Paluncic, Khaled A. S. Abdel-Ghaffar, Hendrik C. Ferreira
, Willem A. Clarke:
A Multiple Insertion/Deletion Correcting Code for Run-Length Limited Sequences. IEEE Trans. Inf. Theory 58(3): 1809-1824 (2012) - 2011
- [c3]Filip Paluncic, Theo G. Swart
, Jos H. Weber, Hendrik C. Ferreira
, Willem A. Clarke:
A note on non-binary multiple insertion/deletion correcting codes. ITW 2011: 683-687 - 2010
- [j1]Filip Paluncic, Hendrik C. Ferreira
, Willem A. Clarke:
A variable length approach to moment balancing. IEEE Trans. Inf. Theory 56(10): 5235-5244 (2010)
2000 – 2009
- 2008
- [c2]Filip Paluncic, Hendrik C. Ferreira
, Willem A. Clarke:
A variable length moment balancing template. ISIT 2008: 1557-1561 - [c1]Filip Paluncic, Willem A. Clarke, Hendrik C. Ferreira
:
Partitioned moment balancing template and the influence of partition distribution thereon. ITW 2008: 431-435
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint