Zobrazeno 1 - 10
of 165
pro vyhledávání: '"Binary case"'
Publikováno v:
Chinese Journal of Electronics. 30:1022-1029
Three new secondary constructions of generalized bent functions are presented. We provide a secondary construction of generalized bent functions from indirect sum methods proposed by Carlet et al. A new secondary construction of generalized bent func
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::132af40646d6a9610673187d576c5e95
https://doi.org/10.1049/cje.2021.08.003
https://doi.org/10.1049/cje.2021.08.003
Autor:
Xiang-dong Hou
Publikováno v:
IEEE Transactions on Information Theory. 67:5592-5601
Let ${R}_{q}({r},{n})$ be the ${r}$ th order ${q}$ -ary Reed-Muller code of length ${q}^{n}$ , which is the set of functions from ${\mathbb {F}}_{q}^{n}$ to ${\mathbb {F}}_{q}$ represented by polynomials of degree $\le {r}$ in ${\mathbb {F}}_{q}[{X}_
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9813f22388f02d17bc00235a939ec0c8
https://doi.org/10.1109/tit.2021.3087157
https://doi.org/10.1109/tit.2021.3087157
Publikováno v:
Theoretical Computer Science. 869:156-180
We consider opinion diffusion on social graphs where agents hold opinions and where social pressure leads them to conform to the opinion manifested by the majority of their neighbors. Within this setting, we look for dynamics that allows us to maximi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cba41b4632d923c064f391caad0f08ec
https://doi.org/10.1016/j.tcs.2021.03.017
https://doi.org/10.1016/j.tcs.2021.03.017
Autor:
Mladen Kovacevic
Publikováno v:
Theory of Probability & Its Applications. 66:482-487
Let $ X_1, \ldots, X_n $ be independent random variables taking values in the alphabet $ \{0, 1, \ldots, r\} $, and $ S_n = \sum_{i = 1}^n X_i $. The Shepp--Olkin theorem states that, in the binary case ($ r = 1 $), the Shannon entropy of $ S_n $ is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::379bac3b943c5759b3eccf56debb46bd
https://doi.org/10.1137/s0040585x97t99054x
https://doi.org/10.1137/s0040585x97t99054x
Publikováno v:
Journal of Advanced Transportation, Vol 2020 (2020)
High-occupancy vehicle (HOV) lanes or congestion toll discount policies are in place to encourage multipassenger vehicles. However, vehicle occupancy detection, essential for implementing such policies, is based on a labor-intensive manual method. To
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b9de0db12919d64cad5a0ed61352130e
https://doi.org/10.1155/2020/8870211
https://doi.org/10.1155/2020/8870211
Publikováno v:
Descriptional Complexity of Formal Systems ISBN: 9783319602516
DCFS
DCFS
We investigate the minimal cases for realtime probabilistic machines that can define uncountably many languages with bounded error. We show that logarithmic space is enough for realtime PTMs on unary languages. On non-unary case, we obtain the same r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::50e339f1a49bf39878b92a0fd8621ed4
https://doi.org/10.1142/s012905411950028x
https://doi.org/10.1142/s012905411950028x
Publikováno v:
Formal Aspects of Computing. 31:611-640
Multiple (more than 2) model synchronization is ubiquitous and important for MDE, but its theoretical underpinning gained much less attention than the binary case. Specifically, the latter was extensively studied by the bx community in the framework
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c7a11996f6dee9097e612828c1acaea
https://doi.org/10.1007/s00165-019-00493-0
https://doi.org/10.1007/s00165-019-00493-0
Publikováno v:
Theoretical Computer Science. 786:32-43
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string t s o l that is within a Hamming distance of d to each of the given strings. It is known that the problem is NP-hard and its optimizatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3baadf2c988868a325ff0f57045e7e25
https://doi.org/10.1016/j.tcs.2018.05.017
https://doi.org/10.1016/j.tcs.2018.05.017
Autor:
Olivier Mila, Martino Borello
Publikováno v:
Borello, Martino; Mila, Olivier Bernard (2019). Symmetries of weight enumerators and applications to Reed-Muller codes. Advances in mathematics of communications, 13(2), pp. 313-328. American Institute of Mathematical Sciences 10.3934/amc.2019021
Gleason's 1970 theorem on weight enumerators of self-dual codes has played a crucial role for research in coding theory during the last four decades. Plenty of generalizations have been proved but, to our knowledge, they are all based on the symmetri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7279b25f5cceeb58805c5afe59e41279
https://doi.org/10.3934/amc.2019021
https://doi.org/10.3934/amc.2019021
Autor:
Abdelillah Jamous, Martino Borello
Publikováno v:
Arithmetic of Finite Fields ISBN: 9783030688684
WAIFI
WAIFI
Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy with the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33d10ebe0f9a79cc13ae3222eaf610c8
https://doi.org/10.1007/978-3-030-68869-1_8
https://doi.org/10.1007/978-3-030-68869-1_8
