Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Dabin Zheng"'
Publikováno v:
IEEE Transactions on Information Theory. 69:1315-1327
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4aaaeb4771eff0c6643a9042f770431
https://doi.org/10.1109/tit.2022.3211329
https://doi.org/10.1109/tit.2022.3211329
Publikováno v:
Discrete Applied Mathematics. 322:171-182
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb3b3bbe8560afc24dd1c04e7f72d706
https://doi.org/10.1016/j.dam.2022.08.022
https://doi.org/10.1016/j.dam.2022.08.022
Publikováno v:
Cryptography and Communications.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e4f7736cb5b22642617cf93235e56fdb
https://doi.org/10.1007/s12095-022-00624-0
https://doi.org/10.1007/s12095-022-00624-0
The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one of importan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70ae0a8a439acf2ddd44ac324774d219
http://arxiv.org/abs/2212.03484
http://arxiv.org/abs/2212.03484
Publikováno v:
IEEE Transactions on Information Theory. 67:1596-1608
An $(r, \delta)$ -locally repairable code ( $(r, \delta)$ -LRC for short) was introduced by Prakash et al. [14] for tolerating multiple failed nodes in distributed storage systems, which was a generalization of the concept of $r$ -LRCs produced by Go
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a9369f21ad59bd7dfeaf436ff9f68beb
https://doi.org/10.1109/tit.2020.3043759
https://doi.org/10.1109/tit.2020.3043759
Publikováno v:
Applicable Algebra in Engineering, Communication and Computing.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5985734c7d0d0599f0df6d577c735452
https://doi.org/10.1007/s00200-022-00551-w
https://doi.org/10.1007/s00200-022-00551-w
Publikováno v:
Cryptography and Communications. 13:173-196
Recently, subfield codes of some optimal linear codes have been studied. In this paper, we further investigate a class of subfield codes and generalize the results of the subfield codes of the conic codes in Ding and Wang (Finite Fields Appl. 56, 308
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fb7c080658279f7be7327c1ade74a338
https://doi.org/10.1007/s12095-020-00460-0
https://doi.org/10.1007/s12095-020-00460-0
Autor:
Xiaoqiang Wang, Dabin Zheng
Publikováno v:
Cryptography and Communications. 12:1111-1131
Let $\mathbb {F}_{2^{m}}$ be the finite field with 2m elements, where m is a positive integer. Recently, Heng and Ding in (Finite Fields Appl. 56:308–331, 2019) studied the subfield codes of two families of hyperovel codes and determined the weight
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07081c0f0cf9c9491dcb3047f2754b56
https://doi.org/10.1007/s12095-020-00432-4
https://doi.org/10.1007/s12095-020-00432-4
Publikováno v:
In Acta Mathematica Scientia 2010 30(5):1769-1775
Two general constructions of linear codes with functions over finite fields have been extensively studied in the literature. The first one is given by $\mathcal{C}(f)=\left\{ {\rm Tr}(af(x)+bx)_{x \in \mathbb{F}_{q^m}^*}: a,b \in \mathbb{F}_{q^m} \ri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ecd9fa68ece314481d05396e0dd7fdb