default search action
Ting-Yi Wu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Shu Liu
, Ting-Yi Wu, Chaoping Xing
On Lengths of Singleton-Optimal Locally Repairable Codes. IEEE Trans. Commun. 72(1): 3-12 (2024) - [j15]Zhengrui Li
Generalization of Minimum Storage Regenerating Codes for Heterogeneous Distributed Storage Systems. IEEE Trans. Inf. Theory 70(6): 4022-4043 (2024) - [c20]Yu-Guang Chen, Ting-Yi Wu:
Special Session: Overcoming Transient Faults and Aging Effects in Digital Computing-in-Memory Architectures: Detection, Tolerance, and Mitigation Strategies. DFT 2024: 1-6 - 2023
- [j14]Jiayi Rui
Optimal Busy-Node Repair of (k+4,k,4) MDS Codes With Small Sub-Packetization Level. IEEE Commun. Lett. 27(4): 1080-1084 (2023) - [j13]Jin Yi Chen, Shu Liu
Optimal and Asymptotically Good Locally Repairable Codes via Propagation Rules. IEEE Trans. Commun. 71(10): 5623-5632 (2023) - [j12]Shu Liu
A New Construction of Nonlinear Codes via Algebraic Function Fields. IEEE Trans. Inf. Theory 69(9): 5640-5647 (2023) - [c19]Xiaolu Li, Keyun Cheng, Kaicheng Tang, Patrick P. C. Lee, Yuchong Hu, Dan Feng, Jie Li, Ting-Yi Wu:
ParaRC: Embracing Sub-Packetization for Repair Parallelization in MSR-Coded Storage. FAST 2023: 17-32 - [c18]Kaicheng Tang, Keyun Cheng, Helen H. W. Chan, Xiaolu Li, Patrick P. C. Lee, Yuchong Hu, Jie Li, Ting-Yi Wu:
Balancing Repair Bandwidth and Sub-Packetization in Erasure-Coded Storage via Elastic Transformation. INFOCOM 2023: 1-10 - [c17]Yunqi Wan, Jiongyue Xing, Yuliang Huang, Ting-Yi Wu, Bo Bai, Gong Zhang:
The Re-encoding Transform in Algebraic List Decoding of Algebraic Geometric Codes. ISIT 2023: 19-24 - [c16]Zhengrui Li, Wai Ho Mow, Yunghsiang S. Han, Ting-Yi Wu:
Cache-Aided Distributed Storage Systems. ISIT 2023: 436-441 - [c15]Yizhou Xu, Yuhao Liu, Shansuo Liang, Ting-Yi Wu, Bo Bai, Jean Barbier, TianQi Hou:
Capacity-Achieving Sparse Regression Codes via Vector Approximate Message Passing. ISIT 2023: 785-790 - [c14]Fuqiang Sun, Qin Huang, Jiayi Rui, Ting-Yi Wu, Yunghsiang Sam Han:
Side Encoding for MDS Array Codes. ISIT 2023: 1255-1260 - [i7]Yizhou Xu, Yuhao Liu, Shansuo Liang, Ting-Yi Wu, Bo Bob Bai, Jean Barbier, TianQi Hou:
Capacity-Achieving Sparse Regression Codes via Vector Approximate Message Passing. CoRR abs/2303.08406 (2023) - [i6]Ibtihal Ferwana, Suyoung Park, Ting-Yi Wu, Lav R. Varshney:
Designing Discontinuities. CoRR abs/2305.08559 (2023) - 2022
- [j11]Pei-Ju Lee, Ting-Yi Wu:
Mining relations between personality traits and learning styles. Inf. Process. Manag. 59(5): 103045 (2022) - [c13]Wan-Ling Chang, Ting-Yi Wu, Yu-Hsiu Hung:
Create More Than One Design: A Case Study of Applying Ethnographic Approach to Explore the Potential Information Application in Senior Karaoke Community. HCI (3) 2022: 23-35 - [c12]Zhengrui Li, Wai Ho Mow, Lei Deng
Optimal-Repair-Cost MDS Array Codes for a Class of Heterogeneous Distributed Storage Systems. ISIT 2022: 2379-2384 - 2021
- [j10]Ting-Yi Wu
Skip-Sliding Window Codes. IEEE Trans. Commun. 69(5): 2824-2836 (2021) - [c11]Zhengrui Li, Yunghsiang S. Han, Ting-Yi Wu, Hanxu Hou, Bo Bai, Gong Zhang:
On the Repair Bandwidth and Repair Access of Two Storage Systems: Large-Scale and Uniform Rack-Aware Storage Systems. ITW 2021: 1-6 - [c10]Ting-Yi Wu, Yunghsiang S. Han, Zhengrui Li, Bo Bai, Gong Zhang, Xiaoyang Zhang, Xiang Wu:
Achievable Lower Bound on the Optimal Access Bandwidth of (K + 2, K, 2)-MDS Array Code with Degraded Read Friendly. ITW 2021: 1-5 - [i5]Ting-Yi Wu, Yunghsiang S. Han, Zhengrui Li, Bo Bai, Gong Zhang, Liang Chen, Xiang Wu:
Lower Bound on the Optimal Access Bandwidth of (K+2, K, 2)-MDS Array Code with Degraded Read Friendly. CoRR abs/2102.02436 (2021) - 2020
- [j9]Ting-Yi Wu
Outage-Constrained Rate of Skip-Sliding Window Codes. IEEE Trans. Green Commun. Netw. 4(2): 506-514 (2020) - [c9]Ting-Yi Wu, Yunghsiang S. Han:
ML Soft-decision Decoding for Binary Linear Block Codes Based on Trellises of Their Supercodes. ICCCN 2020: 1-9 - [c8]Jianchao Ye, Ting-Yi Wu, Jiongyue Xing, Li Chen:
Iterative Soft Decoding of Reed-Solomon Tail-Biting Convolutional Concatenated Codes. WCSP 2020: 957-961
2010 – 2019
- 2019
- [j8]Ting-Yi Wu
On the Throughput of Channels That Wear Out. IEEE Trans. Commun. 67(8): 5311-5320 (2019) - [c7]Ting-Yi Wu, Anshoo Tandon, Lav R. Varshney, Mehul Motani:
Multicasting Energy and Information Simultaneously. ISIT 2019: 2494-2498 - [c6]Ting-Yi Wu, Anshoo Tandon, Mehul Motani, Lav R. Varshney:
On the Outage-Constrained Rate of Skip-Sliding Window Codes. ITW 2019: 1-5 - 2018
- [j7]Chun Huang, Ting-Yi Wu
An Efficient Tree Search Algorithm for the Free Distance of Variable-Length Error-Correcting Codes. IEEE Commun. Lett. 22(3): 474-477 (2018) - [j6]Yunghsiang S. Han
A Low-Complexity Maximum-Likelihood Decoder for Tail-Biting Convolutional Codes. IEEE Trans. Commun. 66(5): 1859-1870 (2018) - [c5]Ting-Yi Wu, Xiou Ge
Surprising sequences for communication and conversation. CISS 2018: 1-6 - [c4]Ting-Yi Wu, Anshoo Tandon, Lav R. Varshney, Mehul Motani:
Skip-Sliding Window Codes. ISIT 2018: 1799-1803 - [i4]Ting-Yi Wu, Anshoo Tandon, Lav R. Varshney, Mehul Motani:
Multicasting Energy and Information Simultaneously. CoRR abs/1806.11271 (2018) - 2017
- [c3]Ting-Yi Wu, Lav R. Varshney, Vincent Y. F. Tan:
Communication over a channel that wears out. ISIT 2017: 581-585 - [i3]Ting-Yi Wu, Lav R. Varshney, Vincent Y. F. Tan:
Communication over a Channel that Wears Out. CoRR abs/1701.01474 (2017) - [i2]Ting-Yi Wu, Anshoo Tandon, Lav R. Varshney, Mehul Motani:
Skip-Sliding Window Codes. CoRR abs/1711.09494 (2017) - 2014
- [i1]Yunghsiang S. Han, Hung-Ta Pai, Po-Ning Chen, Ting-Yi Wu:
Maximum-likelihood Soft-decision Decoding for Binary Linear Block Codes Based on Their Supercodes. CoRR abs/1408.1310 (2014) - 2013
- [j5]Ting-Yi Wu, Po-Ning Chen
On the Design of Variable-Length Error-Correcting Codes. IEEE Trans. Commun. 61(9): 3553-3565 (2013) - 2011
- [c2]Ting-Yi Wu, Po-Ning Chen
On the construction and MAP decoding of optimal variable-length error-correcting codes. ISIT 2011: 2223-2227 - 2010
- [j4]Yuh-Ming Huang, Ting-Yi Wu, Yunghsiang S. Han:
An A*-Based Algorithm for Constructing Reversible Variable Length Codes with Minimum Average Codeword Length. IEEE Trans. Commun. 58(11): 3175-3185 (2010) - [j3]Shin-Lin Shieh, Po-Ning Chen
Early-Elimination Modification for Priority-First Search Decoding. IEEE Trans. Commun. 58(12): 3459-3469 (2010) - [c1]Ting-Yi Wu, Po-Ning Chen
Reliability-Based Decoding for Convolutional Tail-Biting Codes. VTC Spring 2010: 1-4
2000 – 2009
- 2008
- [j2]Yuh-Ming Huang, Yunghsiang S. Han, Ting-Yi Wu:
Soft-decision priority-first decoding algorithms for variable-length error-correcting codes. IEEE Commun. Lett. 12(8): 572-574 (2008) - [j1]Hung-Ta Pai, Yunghsiang S. Han, Ting-Yi Wu, Po-Ning Chen
Low-complexity ML decoding for convolutional tail-biting codes. IEEE Commun. Lett. 12(12): 883-885 (2008)
Coauthor Index
aka: Yunghsiang S. Han
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-12-03 21:23 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: