Zobrazeno 1 - 10
of 87
pro vyhledávání: '"Yaotsu Chang"'
Publikováno v:
IEEE Transactions on Information Theory. 68:3034-3046
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3e17e882fa59491b3b308ec27592c0a
https://doi.org/10.1109/tit.2022.3142371
https://doi.org/10.1109/tit.2022.3142371
Publikováno v:
IEEE Transactions on Information Theory. 66:6835-6854
It is well-known that the decoding of algebraic codes with error locators have been extensively conceived in the literature over a half century. The radical locator, which is an $\omega $ th root of error locator, has recently been discovered. This p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9378d969b29f684a272e5e556461ad99
https://doi.org/10.1109/tit.2020.2994905
https://doi.org/10.1109/tit.2020.2994905
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 25:335-352
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f91a68759835d2be0433e98ba068f20
https://doi.org/10.1080/09720529.2019.1662580
https://doi.org/10.1080/09720529.2019.1662580
Publikováno v:
IEEE Transactions on Information Theory. 64:6590-6603
A class of cyclic codes has recently been decoded by using the weak-locator polynomials instead of the conventional error-locator polynomials. In this paper, a generalization of weak-locator polynomials to the multivariate cases, called the multivari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd4b1d7694f3379c6ade47399a47eb9a
https://doi.org/10.1109/tit.2018.2811502
https://doi.org/10.1109/tit.2018.2811502
Publikováno v:
Cryptography and Communications. 10:1165-1182
Quantum maximum-distance-separable (MDS) codes are a significant class of quantum codes. In this paper, we mainly utilize classical Hermitian self-orthogonal generalized Reed-Solomon codes to construct five new classes of quantum MDS codes with large
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::24f1632584b8605f94bb127cbbe3be75
https://doi.org/10.1007/s12095-017-0274-1
https://doi.org/10.1007/s12095-017-0274-1
Publikováno v:
Designs, Codes and Cryptography. 86:1281-1293
This paper gives a construction of group divisible designs (GDDs) on the binary extension fields with block sizes 3, 4, 5, 6, and 7, respectively, which consist of the error patterns whose first syndromes are zeros recognized from the decoding of bin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0731ffce1b2955acf603afb48eaf0c3
https://doi.org/10.1007/s10623-017-0395-8
https://doi.org/10.1007/s10623-017-0395-8
Publikováno v:
Taiwanese J. Math. 23, no. 6 (2019), 1291-1302
Recently, a construction of group divisible designs (GDDs) derived from the decoding of quadratic residue (QR) codes was given. In this paper, we extend the idea to obtain a new family of GDDs, which is also involved with a well-known balanced incomp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e8c0409a9b614a224f8ac5bab95c6841
https://projecteuclid.org/euclid.twjm/1548234028
https://projecteuclid.org/euclid.twjm/1548234028
Publikováno v:
IEEE Signal Processing Letters. 22:881-885
In this letter, some perfect Gaussian integer sequences of period ${2^m} - 1$ are proposed based on the trace representations of Legendre sequences, Hall’s sextic residue sequences, $m$ -sequences, and Gordon-Mills-Welch (GMW) sequences over the fi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cae0f1070e39503b700c708259792efb
https://doi.org/10.1109/lsp.2014.2375313
https://doi.org/10.1109/lsp.2014.2375313
Publikováno v:
IEEE Transactions on Information Theory. 61:1179-1187
In this paper, an explicit expression of the weak-locator polynomial for p-ary quadratic residue codes is presented by a modification of the Feng-Tzeng matrix method. The differences between the modified version and the original Feng-Tzeng matrix are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::411d59dda5221fc3c4e2ffe2957892f8
https://doi.org/10.1109/tit.2015.2388753
https://doi.org/10.1109/tit.2015.2388753
Publikováno v:
SPAWC
The perfect Gaussian integer sequences have been recently used in orthogonal frequency division multiplexing (OFDM) systems and code division multiple access (CDMA) systems. This paper proposes a new construction method, called monomial o-polynomials
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa04f181ade8745e8af82045199fff2c
https://doi.org/10.1109/spawc.2017.8227782
https://doi.org/10.1109/spawc.2017.8227782