default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSihuang Hu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Yue Gao, Weijun Fang, Jingke Xu, Dong Wang, Sihuang Hu:
Optimal (2,δ ) locally repairable codes via punctured simplex codes. Des. Codes Cryptogr. 92(12): 3955-3979 (2024)- [j17]Guodong Li
, Min Ye, Sihuang Hu:
ABS+ Polar Codes: Exploiting More Linear Transforms on Adjacent Bits. IEEE Trans. Inf. Theory 70(2): 1067-1086 (2024) - [j16]Guodong Li, Ningning Wang, Sihuang Hu, Min Ye:
MSR Codes With Linear Field Size and Smallest Sub-Packetization for Any Number of Helper Nodes. IEEE Trans. Inf. Theory 70(11): 7790-7806 (2024) - [c12]Zihao Zhang, Guodong Li, Sihuang Hu:
Constructing $(h, k+1)$ Cooperative MSR Codes with Sub-Packetization (h+1)2⌈n/2⌉. ISIT 2024: 1-6 - [c11]Guodong Li, Ningning Wang, Sihuang Hu, Min Ye:
MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes. ISIT 2024: 807-812 - [i17]Zihao Zhang, Guodong Li, Sihuang Hu:
Constructing (h, d) cooperative MSR codes with sub-packetization (d-k+h)(d-k+1)⌈ n/2 ⌉. CoRR abs/2405.02923 (2024) - 2023
- [j15]Yan Xu, Ran Tao, Sihuang Hu:
New classes of affine-invariant codes sandwiched between Reed-Muller codes. Finite Fields Their Appl. 92: 102299 (2023) - [j14]Guodong Li, Min Ye, Sihuang Hu:
All the Codeword Symbols in Polar Codes Have the Same SER Under the SC Decoder. IEEE Trans. Commun. 71(7): 3783-3791 (2023) - [j13]Yan Xu, Changjiang Ji, Ran Tao, Sihuang Hu:
Extended Cyclic Codes Sandwiched Between Reed-Muller Codes. IEEE Trans. Inf. Theory 69(1): 138-146 (2023) - [j12]Guodong Li, Min Ye, Sihuang Hu:
Adjacent-Bits-Swapped Polar Codes: A New Code Construction to Speed up Polarization. IEEE Trans. Inf. Theory 69(4): 2269-2299 (2023) - [j11]Ningning Wang, Guodong Li, Sihuang Hu, Min Ye:
Constructing MSR Codes With Subpacketization 2n/3 for k + 1 Helper Nodes. IEEE Trans. Inf. Theory 69(6): 3775-3792 (2023) - [c10]Dong Wang, Weijun Fang, Sihuang Hu:
Optimal (2, δ) Locally Repairable Codes via Punctured Simplex Codes. ISIT 2023: 1747-1752 - [c9]Guodong Li, Min Ye, Sihuang Hu:
ABS+ Polar Codes: Exploiting More Linear Transforms on Adjacent Bits. ISIT 2023: 2147-2152 - [i16]Guodong Li, Ningning Wang, Sihuang Hu, Min Ye:
MSR codes with linear field size and smallest sub-packetization for any number of helper nodes. CoRR abs/2303.10467 (2023) - [i15]Dong Wang, Weijun Fang, Sihuang Hu:
Optimal (2, δ) Locally Repairable Codes via Punctured Simplex Codes. CoRR abs/2307.04323 (2023) - 2022
- [c8]Guodong Li, Min Ye, Sihuang Hu:
Adjacent-Bits-Swapped Polar codes: A new code construction to speed up polarization. ISIT 2022: 2142-2147 - [c7]Guodong Li, Ningning Wang, Sihuang Hu, Min Ye:
Constructing MSR codes with subpacketization 2n/3 for k + 1 helper nodes. ISIT 2022: 3120-3125 - [i14]Guodong Li, Min Ye, Sihuang Hu:
Adjacent-Bits-Swapped Polar codes: A new code construction to speed up polarization. CoRR abs/2202.04454 (2022) - [i13]Guodong Li, Min Ye, Sihuang Hu:
All the codeword bits in polar codes have the same BER under the SC decoder. CoRR abs/2203.14184 (2022) - [i12]Ningning Wang, Guodong Li, Sihuang Hu, Min Ye:
Constructing MSR codes with subpacketization 2n/3 for k+1 helper nodes. CoRR abs/2208.04159 (2022) - [i11]Guodong Li, Min Ye, Sihuang Hu:
ABS+ Polar Codes: Exploiting More Linear Transforms on Adjacent Bits. CoRR abs/2209.02461 (2022) - 2021
- [c6]Changjiang Ji, Yan Xu, Sihuang Hu:
Extended Cyclic Codes Sandwiched Between Reed-Muller Codes. ISIT 2021: 444-449 - [i10]Changjiang Ji, Yan Xu, Sihuang Hu:
Extended Cyclic Codes Sandwiched Between Reed-Muller Codes. CoRR abs/2105.13827 (2021) - [i9]Guodong Li, Min Ye, Sihuang Hu:
A Dynamic Programming Method to Construct Polar Codes with Improved Performance. CoRR abs/2111.02851 (2021) - 2020
- [i8]Simon Eisenbarth, Sihuang Hu:
Relative projective group codes over chain rings. CoRR abs/2010.12429 (2020)
2010 – 2019
- 2018
- [j10]Sihuang Hu, Nir Weinberger, Ofer Shayevitz:
On the VC-Dimension of Binary Codes. SIAM J. Discret. Math. 32(3): 2161-2171 (2018) - [j9]Sihuang Hu, Itzhak Tamo, Ofer Shayevitz:
A Bound on the Shannon Capacity via a Linear Programming Variation. SIAM J. Discret. Math. 32(3): 2229-2241 (2018) - [j8]Abhishek Agarwal, Alexander Barg, Sihuang Hu, Arya Mazumdar, Itzhak Tamo:
Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes. IEEE Trans. Inf. Theory 64(5): 3481-3492 (2018) - [i7]Sihuang Hu, Itzhak Tamo, Ofer Shayevitz:
A Bound on the Shannon Capacity via a Linear Programming Variation. CoRR abs/1804.05529 (2018) - 2017
- [j7]Sihuang Hu, Ofer Shayevitz:
The ρ-Capacity of a Graph. IEEE Trans. Inf. Theory 63(4): 2241-2253 (2017) - [j6]Lele Wang, Sihuang Hu, Ofer Shayevitz:
Quickest Sequence Phase Detection. IEEE Trans. Inf. Theory 63(9): 5834-5849 (2017) - [c5]Sihuang Hu, Nir Weinberger, Ofer Shayevitz:
On the VC-dimension of binary codes. ISIT 2017: 594-598 - [c4]Sihuang Hu, Itzhak Tamo, Ofer Shayevitz:
A bound on the shannon capacity via a linear programming variation. ISIT 2017: 1063-1066 - [i6]Abhishek Agarwal, Alexander Barg, Sihuang Hu, Arya Mazumdar, Itzhak Tamo:
Combinatorial Alphabet-Dependent Bounds for Locally Recoverable Codes. CoRR abs/1702.02685 (2017) - [i5]Sihuang Hu, Nir Weinberger, Ofer Shayevitz:
On the VC-Dimension of Binary Codes. CoRR abs/1703.01586 (2017) - 2016
- [j5]Sihuang Hu, Gabriele Nebe:
There is no [24, 12, 9] doubly-even self-dual code over 픽4. Adv. Math. Commun. 10(3): 583-588 (2016) - [c3]Sihuang Hu, Itzhak Tamo, Alexander Barg:
Combinatorial and LP bounds for LRC codes. ISIT 2016: 1008-1012 - [c2]Sihuang Hu, Ofer Shayevitz:
The ρ-capacity of a graph. ISIT 2016: 2604-2608 - [c1]Lele Wang, Sihuang Hu, Ofer Shayevitz:
Quickest sequence phase detection. ISIT 2016: 2784-2788 - [i4]Lele Wang, Sihuang Hu, Ofer Shayevitz:
Quickest Sequence Phase Detection. CoRR abs/1605.09038 (2016) - [i3]Sihuang Hu, Ofer Shayevitz:
The ρ-Capacity of a Graph. CoRR abs/1607.07263 (2016) - 2015
- [j4]Sihuang Hu, Shuxing Li, Tao Zhang, Tao Feng, Gennian Ge:
New pseudo-planar binomials in characteristic two and related schemes. Des. Codes Cryptogr. 76(2): 345-360 (2015) - 2014
- [j3]Tao Feng, Sihuang Hu, Shuxing Li, Gennian Ge:
Difference sets with few character values. Des. Codes Cryptogr. 73(3): 825-839 (2014) - 2013
- [j2]Shuxing Li, Sihuang Hu, Tao Feng, Gennian Ge:
The Weight Distribution of a Class of Cyclic Codes Related to Hermitian Forms Graphs. IEEE Trans. Inf. Theory 59(5): 3064-3067 (2013) - 2012
- [j1]Sihuang Hu, Gennian Ge:
Necessary conditions and frame constructions for Z-cyclic patterned starter whist tournaments. Discret. Appl. Math. 160(15): 2188-2198 (2012) - [i2]Tao Feng, Gennian Ge, Sihuang Hu:
Association schemes related to Delsarte-Goethals codes. CoRR abs/1212.0347 (2012) - [i1]Shuxing Li, Sihuang Hu, Tao Feng, Gennian Ge:
The Weight Distribution of a Class of Cyclic Codes Related to Hermitian Forms Graphs. CoRR abs/1212.6371 (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 2025-01-21 00:16 CET 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:
