default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBocong Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Bocong Chen, Guanghui Zhang
:
Enumeration and Generation of Cyclically Permutable Codes From Cyclic Codes. IEEE Trans. Inf. Theory 70(1): 115-124 (2024)- [j31]Bocong Chen, Yuqing Fu, Hongwei Liu:
Improved Upper Bounds on the Number of Non-Zero Weights of Cyclic Codes. IEEE Trans. Inf. Theory 70(6): 4079-4092 (2024) - [j30]Chunyan Qin, Bocong Chen, Gaojun Luo:
Constructions of Non-Expandable Cross-Bifix-Free Codes via Expandable Codes. IEEE Trans. Inf. Theory 70(7): 4946-4955 (2024) - 2023
- [j29]Bocong Chen, Hongwei Liu:
New Bounds on the Code Size of Symbol-Pair Codes. IEEE Trans. Inf. Theory 69(2): 941-950 (2023) - [j28]Bocong Chen, Guanghui Zhang:
A Tight Upper Bound on the Number of Non-Zero Weights of a Cyclic Code. IEEE Trans. Inf. Theory 69(2): 995-1004 (2023) - [j27]Bocong Chen, San Ling, Hongwei Liu:
Hulls of Reed-Solomon Codes via Algebraic Geometry Codes. IEEE Trans. Inf. Theory 69(2): 1005-1014 (2023) - [j26]Bocong Chen, Guanghui Zhang, Wenyan Li:
New Optimal Linear Codes With Hierarchical Locality. IEEE Trans. Inf. Theory 69(3): 1544-1550 (2023) - [j25]Bocong Chen, Guanghui Zhang:
The Number of Extended Irreducible Binary Goppa Codes. IEEE Trans. Inf. Theory 69(12): 7691-7711 (2023) - [i19]Bocong Chen, Yuqing Fu, Hongwei Liu:
Improved upper bounds on the number of non-zero weights of cyclic codes. CoRR abs/2305.14687 (2023) - [i18]Chunyan Qin, Bocong Chen, Gaojun Luo:
On non-expandable cross-bifix-free codes. CoRR abs/2309.08915 (2023) - [i17]Gaojun Luo, Bocong Chen, Martianus Frederic Ezerman, San Ling:
Bounds and Constructions of Quantum Locally Recoverable Codes from Quantum CSS Codes. CoRR abs/2312.11115 (2023) - [i16]Qingfeng Xia, Hongwei Liu, Bocong Chen:
Function-Correcting Codes for Symbol-Pair Read Channels. CoRR abs/2312.16271 (2023) - 2022
- [j24]Bocong Chen, Jing Huang:
On unitary Cayley graphs of matrix rings. Discret. Math. 345(1): 112671 (2022) - [j23]Guanghui Zhang, Bocong Chen:
Self-orthogonal quasi-abelian codes are asymptotically good. Finite Fields Their Appl. 78: 101958 (2022) - [j22]Bocong Chen, Guanghui Zhang:
Improved Singleton Bound on Insertion-Deletion Codes and Optimal Constructions. IEEE Trans. Inf. Theory 68(5): 3028-3033 (2022) - [j21]Bocong Chen, Guanghui Zhang:
Enumeration of Extended Irreducible Binary Goppa Codes. IEEE Trans. Inf. Theory 68(8): 5145-5153 (2022) - [i15]Bocong Chen, Guanghui Zhang:
Enumeration of extended irreducible binary Goppa codes. CoRR abs/2203.15346 (2022) - [i14]Bocong Chen, Guanghui Zhang:
The number of extended irreducible binary Goppa codes. CoRR abs/2204.02083 (2022) - 2021
- [i13]Bocong Chen, Guanghui Zhang:
Improved Singleton bound on insertion-deletion codes and optimal constructions. CoRR abs/2105.02004 (2021) - 2020
- [j20]Xiwang Cao, Bocong Chen, San Ling:
Perfect State Transfer on Cayley Graphs over Dihedral Groups: The Non-Normal Case. Electron. J. Comb. 27(2): 2 (2020) - [j19]Bocong Chen, Jing Huang:
A reduction theorem for the existence of ⁎-clean finite group rings. Finite Fields Their Appl. 64: 101674 (2020)
2010 – 2019
- 2019
- [j18]Bocong Chen, Jing Huang:
A Construction of Optimal (r, δ)-Locally Recoverable Codes. IEEE Access 7: 180349-180353 (2019) - 2018
- [j17]Bocong Chen, Hongwei Liu:
Constructions of cyclic constant dimension codes. Des. Codes Cryptogr. 86(6): 1267-1279 (2018) - [j16]Bocong Chen, Hongwei Liu:
New Constructions of MDS Codes With Complementary Duals. IEEE Trans. Inf. Theory 64(8): 5776-5782 (2018) - 2017
- [j15]Bocong Chen, Liren Lin, San Ling, Hongwei Liu:
Three new classes of optimal frequency-hopping sequence sets. Des. Codes Cryptogr. 83(1): 219-232 (2017) - [j14]Bocong Chen, Liren Lin, Hongwei Liu:
Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions. IEEE Trans. Inf. Theory 63(12): 7661-7666 (2017) - [i12]Bocong Chen, Hongwei Liu:
New constructions of MDS codes with complementary duals. CoRR abs/1702.07831 (2017) - [i11]Bocong Chen, Hongwei Liu:
Constructions of cyclic constant dimension codes. CoRR abs/1707.04342 (2017) - 2016
- [j13]Bocong Chen, Hai Q. Dinh, Hongwei Liu, Liqi Wang:
Constacyclic codes of length 2ps over Fpm+uFpm. Finite Fields Their Appl. 37: 108-130 (2016) - [j12]Bocong Chen, San Ling, Guanghui Zhang:
Enumeration formulas for self-dual cyclic codes. Finite Fields Their Appl. 42: 1-22 (2016) - [i10]Bocong Chen, Liren Lin, San Ling, Hongwei Liu:
Three new classes of optimal frequency-hopping sequence sets. CoRR abs/1605.03454 (2016) - [i9]Bocong Chen, Liren Lin, Hongwei Liu:
Constacyclic symbol-pair codes: lower bounds and optimal constructions. CoRR abs/1605.03460 (2016) - 2015
- [j11]Liren Lin, Hongwei Liu, Bocong Chen:
Existence conditions for self-orthogonal negacyclic codes over finite fields. Adv. Math. Commun. 9(1): 1-7 (2015) - [j10]Bocong Chen, Hongwei Liu, Guanghui Zhang:
A class of minimal cyclic codes over finite fields. Des. Codes Cryptogr. 74(2): 285-300 (2015) - [j9]Bocong Chen, Hai Q. Dinh, Hongwei Liu:
Repeated-root constacyclic codes of length slmpn. Finite Fields Their Appl. 33: 137-159 (2015) - [j8]Liren Lin, Bocong Chen, Hongwei Liu:
A note on the weight distribution of some cyclic codes. Finite Fields Their Appl. 35: 78-85 (2015) - [j7]Bocong Chen, San Ling, Guanghui Zhang:
Application of Constacyclic Codes to Quantum MDS Codes. IEEE Trans. Inf. Theory 61(3): 1474-1484 (2015) - [j6]Bocong Chen, Hai Q. Dinh, Yun Fan, San Ling:
Polyadic Constacyclic Codes. IEEE Trans. Inf. Theory 61(9): 4895-4904 (2015) - 2014
- [j5]Bocong Chen, Hai Q. Dinh, Hongwei Liu:
Repeated-root constacyclic codes of length ℓp5 and their duals. Discret. Appl. Math. 177: 60-70 (2014) - [j4]Bocong Chen, Hongwei Liu, Guanghui Zhang:
Some minimal cyclic codes over finite fields. Discret. Math. 331: 142-150 (2014) - [j3]Bocong Chen, Hai Q. Dinh:
A note on isodual constacyclic codes. Finite Fields Their Appl. 29: 243-246 (2014) - [i8]Bocong Chen, San Ling, Guanghui Zhang:
Application of Constacyclic codes to Quantum MDS Codes. CoRR abs/1403.2499 (2014) - [i7]Bocong Chen, San Ling, Guanghui Zhang:
Self-dual cyclic codes over finite chain rings. CoRR abs/1405.2602 (2014) - [i6]Bocong Chen, Hai Q. Dinh, Hongwei Liu:
Repeated-root constacyclic codes of length 2ℓmpn. CoRR abs/1406.1848 (2014) - [i5]Bocong Chen, Hai Q. Dinh, Yun Fan, San Ling:
Polyadic Constacyclic Codes. CoRR abs/1407.1905 (2014) - [i4]Guanghui Zhang, Bocong Chen, Liangchen Li:
A Construction of MDS Quantum Convolutional Codes. CoRR abs/1408.5782 (2014) - 2013
- [j2]Bocong Chen, Liangchen Li, Rouziwanguli Tuerhong:
Explicit factorization of X2mpn-1 over a finite field. Finite Fields Their Appl. 24: 95-104 (2013) - [i3]Bocong Chen, Yun Fan, Liren Lin, Hongwei Liu:
Constacyclic Codes over Finite Fields. CoRR abs/1301.0369 (2013) - [i2]Guanghui Zhang, Bocong Chen:
Constacyclic Codes over $F_p+vF_p$. CoRR abs/1301.0669 (2013) - [i1]Guanghui Zhang, Bocong Chen:
Construction of Self-dual Codes over $F_p+vF_p$. CoRR abs/1304.4648 (2013) - 2012
- [j1]Bocong Chen, Yun Fan, Liren Lin, Hongwei Liu:
Constacyclic codes over finite fields. Finite Fields Their Appl. 18(6): 1217-1231 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-16 18:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
