Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Filip Paluncic"'
Autor:
Filip Paluncic, B. T. Maharaj
Publikováno v:
IEEE Access, Vol 12, Pp 39375-39389 (2024)
Various methods have been proposed for the construction of balanced run-length limited codes. Amongst these methods is the enumerative coding approach by Kurmaev. The advantage of this approach is that the code has maximum cardinality and thus approa
Externí odkaz:
https://doaj.org/article/2cfeb240721245d1946183936e6675e5
Publikováno v:
IEEE Access, Vol 6, Pp 50801-50823 (2018)
Cognitive radio networks (CRNs) are an emerging paradigm for next generation wireless communication systems allowing for more efficient radio spectrum utilization. In order to harness the full potential that CRNs may offer, many challenges and proble
Externí odkaz:
https://doaj.org/article/7af2b96335d8482f84fae320b14ccdcd
Publikováno v:
IEEE Transactions on Information Theory. 65:7045-7066
A novel Knuth-like balancing method for runlength-limited words is presented, which forms the basis of new variable- and fixed-length balanced runlength-limited codes that improve on the code rate as compared to balanced runlength-limited codes based
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::633a5484dcb6f33d97ed8a01d45eb1d4
https://doi.org/10.1109/tit.2019.2914205
https://doi.org/10.1109/tit.2019.2914205
Autor:
Filip Paluncic, Bodhaswar T. Maharaj
Publikováno v:
IEEE Transactions on Information Theory. 65:159-173
It is known that, for large user word lengths, the auxiliary data can be used to recover most of the redundancy losses of Knuth’s simple balancing method compared with the optimal redundancy of balanced codes for the binary case. Here, this importa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f78c7e00c8dcb95dc5542f49a052169a
https://doi.org/10.1109/tit.2018.2844834
https://doi.org/10.1109/tit.2018.2844834
Publikováno v:
ICCT
In order to optimize the efficiency of radio resource utilization in the cognitive radio network (CRN), the channel allocation protocol plays a crucial role. However, how to build a general and adaptable framework for the design and evaluation of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e76eceaef462e2c3a85e58497a4e615
https://doi.org/10.1109/icct46805.2019.8947175
https://doi.org/10.1109/icct46805.2019.8947175
Autor:
Filip Paluncic, Bodhaswar T. Maharaj
Publikováno v:
GLOBECOM
A simple and general method is presented for enumerating the number of balanced (zero- disparity) runlength-limited words based on bivariate generating functions and the symbolic methods of analytic combinatorics. This procedure scales well with incr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::efe1eefbb3577edb3aeb4a6b3d62a088
https://doi.org/10.1109/glocom.2017.8255011
https://doi.org/10.1109/glocom.2017.8255011
Publikováno v:
IEEE Transactions on Information Theory. 59:5935-5943
Insertion/deletion detecting codes were introduced by Konstantinidis In this paper we define insertion/deletion detecting codes in a slightly different manner, and based on this definition, we introduce multiple deletion and multiple insertion detect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d71d5d09933cf1f40fe99e08f8ee27f
https://doi.org/10.1109/tit.2013.2264825
https://doi.org/10.1109/tit.2013.2264825
Publikováno v:
IEEE Transactions on Information Theory. 58:1809-1824
A code construction is proposed to add a multiple insertion/deletion error correcting capability to a run-length limited sequence. The codewords of this code are themselves run-length limited. The insertion/deletion correcting capability is achieved
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5cb87341ec20dde196bf59a3ad0d9b4d
https://doi.org/10.1109/tit.2011.2172725
https://doi.org/10.1109/tit.2011.2172725
On Helberg's Generalization of the Levenshtein Code for Multiple Deletion/Insertion Error Correction
Publikováno v:
IEEE Transactions on Information Theory. 58:1804-1808
A proof that the Helberg code is capable of correcting multiple deletion/insertion errors is presented. This code is a generalization of the number-theoretic Levenshtein code which is capable of correcting a single deletion/insertion. However, apart
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::400a4c0257e1cca4d6ee3fed5ab01e70
https://doi.org/10.1109/tit.2011.2174961
https://doi.org/10.1109/tit.2011.2174961
Publikováno v:
IEEE Transactions on Information Theory. 56:5235-5244
Moment balancing templates have been proposed for channels with a small probability of an insertion/deletion (several orders smaller than additive errors) that add a minimal amount of redundancy. These templates are essentially a systematic way of en
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8733a3d701a30bf24d6c6b2d602b80ff
https://doi.org/10.1109/tit.2010.2059970
https://doi.org/10.1109/tit.2010.2059970