default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYi-Sheng Su
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i1]Hsuan-Yin Lin, Yi-Sheng Su, Mao-Ching Chiu:
Achieving Optimal Short-Blocklength Secrecy Rate Using Multi-Kernel PAC Codes for the Binary Erasure Wiretap Channel. CoRR abs/2409.00852 (2024)- 2023
- [j16]Mao-Ching Chiu
, Yi-Sheng Su:
Design of Polar Codes and PAC Codes for SCL Decoding. IEEE Trans. Commun. 71(5): 2587-2601 (2023) - [j15]Mao-Ching Chiu, Yi-Sheng Su:
Low-Rate and Short-Block-Length Random Permutation-Coded Modulations Achieve Finite-Length Bounds. IEEE Trans. Commun. 71(7): 3821-3834 (2023) - 2022
- [c14]Yi-Sheng Su:
Robust Private Information Retrieval with Optimal Server Computation. ITW 2022: 89-94 - 2021
- [c13]Yi-Sheng Su:
Private Information Retrieval Using Circulant Permutation Matrices or the Zero Matrix. ISIT 2021: 1778-1783
2010 – 2019
- 2019
- [j14]Yi-Sheng Su:
Optimal Pliable Fractional Repetition Codes That are Locally Recoverable: A Bipartite Graph Approach. IEEE Trans. Inf. Theory 65(2): 985-999 (2019) - 2018
- [j13]Yi-Sheng Su:
Pliable Fractional Repetition Codes for Distributed Storage Systems: Design and Analysis. IEEE Trans. Commun. 66(6): 2359-2375 (2018) - [c12]Yi-Sheng Su:
Optimal Pliable Fractional Repetition Codes. ISIT 2018: 2077-2081 - 2017
- [j12]Yi-Sheng Su:
On Constructions of a Class of Binary Locally Repairable Codes With Multiple Repair Groups. IEEE Access 5: 3524-3528 (2017) - [j11]Yi-Sheng Su:
On the Construction of Local Parities for (r, t)-Availability in Distributed Storage. IEEE Trans. Commun. 65(6): 2332-2344 (2017) - [c11]Yi-Sheng Su:
Constructions of Fractional Repetition Codes with Flexible Per-Node Storage and Repetition Degree. GLOBECOM 2017: 1-6 - 2016
- [j10]Yi-Sheng Su:
A Note on Topology-Transparent Scheduling via the Chinese Remainder Theorem. IEEE Signal Process. Lett. 23(8): 1126-1130 (2016) - [c10]Yi-Sheng Su:
Design of membership matrices for (r, t)-availability in distributed storage. ISIT 2016: 998-1002 - 2015
- [j9]Yi-Sheng Su, Chung-Hsuan Wang:
Design and Analysis of Unequal Missing Protection for the Grouping of RFID Tags. IEEE Trans. Commun. 63(11): 4474-4489 (2015) - [j8]Yi-Sheng Su:
Topology-Transparent Scheduling via the Chinese Remainder Theorem. IEEE/ACM Trans. Netw. 23(5): 1416-1429 (2015) - [c9]Yi-Sheng Su, Chung-Hsuan Wang, Huei-Yun Siao:
On unequal missing protection of the grouping of RFID tags. ISIT 2015: 2994-2998 - 2014
- [j7]Feng-Tsun Chien, Kuo-Guan Wu, Yu-Wei Chan, Min-Kuan Chang, Yi-Sheng Su:
An Effective Routing Protocol with Guaranteed Route Preference for Mobile Ad Hoc Networks. Int. J. Distributed Sens. Networks 10 (2014) - [j6]Yi-Sheng Su:
Extended Grouping of RFID Tags Based on Resolvable Transversal Designs. IEEE Signal Process. Lett. 21(4): 488-492 (2014) - [j5]Yi-Sheng Su, Szu-Lin Su, Jung-Shian Li:
Joint Topology-Transparent Scheduling and QoS Routing in Ad Hoc Networks. IEEE Trans. Veh. Technol. 63(1): 372-389 (2014) - [c8]Yi-Sheng Su:
Computationally efficient PAPR reduction of SFBC-OFDM signals by polyphase interleaving and inversion. WPMC 2014: 729-733 - 2013
- [j4]Yi-Sheng Su, Jiun-Ren Lin, Ozan K. Tonguz:
Grouping of RFID Tags via Strongly Selective Families. IEEE Commun. Lett. 17(6): 1120-1123 (2013) - [j3]Yi-Sheng Su, Ozan K. Tonguz:
Using the Chinese Remainder Theorem for the Grouping of RFID Tags. IEEE Trans. Commun. 61(11): 4741-4753 (2013) - 2012
- [c7]Tsung-Cheng Wu, Yaqing Mao, Yi-Sheng Su:
Near-Optimal Spectrum Allocation for Cognitive Radio Networks. VTC Spring 2012: 1-4 - 2011
- [c6]Yi-Sheng Su, Tsung-Cheng Wu, Chung-Hsuan Wang, Min-Kuan Chang:
A low-complexity cross-antenna rotation and inversion scheme for PAPR reduction of STBC MIMO-OFDM systems. CAMAD 2011: 31-35 - [c5]Jian-Jia Weng, Mu-Chen Wu, Chung-Hsuan Wang, Yi-Sheng Su, Tsung-Cheng Wu:
Dynamic scheduling-aided decoding strategies for LDPC convolutional codes with rational parity-check matrices. ISIT 2011: 1821-1825 - 2010
- [c4]Jian-Jia Weng, Yu-Min Hsieh, Hsin-Chuan Kuo, Chung-Hsuan Wang, Tsung-Cheng Wu, Yi-Sheng Su:
A New reliability updating scheme for iterative decoding of Reed-Solomon codes with refined initialization. ISITA 2010: 995-1000
2000 – 2009
- 2008
- [j2]Yi-Sheng Su, Szu-Lin Su, Jung-Shian Li:
Topology-Independent Link Activation Scheduling Schemes for Mobile CDMA Ad Hoc Networks. IEEE Trans. Mob. Comput. 7(5): 599-616 (2008) - [c3]Yi-Sheng Su, Szu-Lin Su, Jung-Shian Li:
Joint Topology-Transparent Scheduling and QoS Routing in Mobile Ad Hoc Networks. NAS 2008: 70-77 - 2005
- [j1]Yi-Sheng Su, Szu-Lin Su, Jung-Shian Li:
Receiver-initiated multiple access protocols for spread spectrum mobile ad hoc networks. Comput. Commun. 28(10): 1251-1265 (2005) - [c2]Yi-Sheng Su, Szu-Lin Su, Jung-Shian Li:
A Topology-Independent Link Activation Scheduling Framework in Multihop CDMA Packet Radio Networks. LCN 2005: 76-83 - 2004
- [c1]Yi-Sheng Su, Szu-Lin Su, Jung-Shian Li:
Topology-transparent link activation scheduling schemes for multihop CDMA ad hoc networks. GLOBECOM 2004: 3563-3567
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-10-07 01:25 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:
