Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Ziling Heng"'
Publikováno v:
AIMS Mathematics, Vol 7, Iss 8, Pp 13790-13802 (2022)
A construction of binary sequences with period 4N and optimal autocorrelation magnitude has been investigated based on sampling and interleaving technique. We determine the exact value of the linear complexity of the constructed sequences according t
Externí odkaz:
https://doaj.org/article/2f5f16c2dd524bcbaa90b8f1d1d8a229
Autor:
Ziling Heng
Publikováno v:
IEEE Transactions on Information Theory. 69:978-994
In coding theory, quasi λ-cyclic codes form an important class of codes which have been extensively studied. In this paper, we investigate the algebraic structure of quasi λ-cyclic codes over finite commutative semi simple rings. And we establish t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e0e70b0c5b23f99311f826690ab98eec
https://doi.org/10.21203/rs.3.rs-2823728/v1
https://doi.org/10.21203/rs.3.rs-2823728/v1
Publikováno v:
Designs, Codes and Cryptography. 90:1695-1712
Autor:
Ziling Heng, Cunsheng Ding
Publikováno v:
IEEE Transactions on Information Theory. 68:3643-3656
Autor:
Ziling Heng, Xiaoru Li
Publikováno v:
Arithmetic of Finite Fields ISBN: 9783031229435
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a8c4abf4c59b43f23aa4fe036104f81
https://doi.org/10.1007/978-3-031-22944-2_8
https://doi.org/10.1007/978-3-031-22944-2_8
Publikováno v:
Linear Algebra and its Applications. 629:72-86
Let G be a connected simple graph with characteristic polynomial P G ( x ) . The irreducibility of P G ( x ) over rational numbers Q has a close relationship with the automorphism group, reconstruction and controllability of a graph. In this paper we
Publikováno v:
Designs, Codes and Cryptography. 89:1993-2007
Projective two-weight linear codes are closely related to finite projective spaces and strongly regular graphs. In this paper, a family of q-ary two-weight linear codes including two subfamilies of projective codes is presented, where q is a prime po
A class of binary sequences with period pq is constructed using generalized cyclotomic classes, and their autocorrelation distribution and 2-adic complexity are determined using Gauss sum and group ring theory. The results show that the autocorrelati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::238be50c20f3e66fa4f03e7628ba01c5
https://doi.org/10.21203/rs.3.rs-1626732/v1
https://doi.org/10.21203/rs.3.rs-1626732/v1
Publikováno v:
IEEE Transactions on Information Theory. 66:6872-6883
In this paper, a family of $[{q}^{2}-1, 4, {q}^{2}-{q}-2]$ cyclic codes over ${\mathbb F}_{{q}}$ meeting the Griesmer bound is presented. Their duals are $[{q}^{2}-1,{q}^{2}-5,4]$ almost MDS codes and are optimal with respect to the sphere-packing bo