Ting-Yi Wu

Orcid: 0000-0003-2993-8329

According to our database1, Ting-Yi Wu authored at least 37 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Generalization of Minimum Storage Regenerating Codes for Heterogeneous Distributed Storage Systems.
IEEE Trans. Inf. Theory, June, 2024

On Lengths of Singleton-Optimal Locally Repairable Codes.
IEEE Trans. Commun., January, 2024

Special Session: Overcoming Transient Faults and Aging Effects in Digital Computing-in-Memory Architectures: Detection, Tolerance, and Mitigation Strategies.
Proceedings of the IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems, 2024

2023
Optimal and Asymptotically Good Locally Repairable Codes via Propagation Rules.
IEEE Trans. Commun., October, 2023

A New Construction of Nonlinear Codes via Algebraic Function Fields.
IEEE Trans. Inf. Theory, September, 2023

Optimal Busy-Node Repair of (k+4,k,4) MDS Codes With Small Sub-Packetization Level.
IEEE Commun. Lett., April, 2023

Designing Discontinuities.
CoRR, 2023

Capacity-Achieving Sparse Regression Codes via Vector Approximate Message Passing.
Proceedings of the IEEE International Symposium on Information Theory, 2023

The Re-encoding Transform in Algebraic List Decoding of Algebraic Geometric Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Side Encoding for MDS Array Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Cache-Aided Distributed Storage Systems.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Balancing Repair Bandwidth and Sub-Packetization in Erasure-Coded Storage via Elastic Transformation.
Proceedings of the IEEE INFOCOM 2023, 2023

ParaRC: Embracing Sub-Packetization for Repair Parallelization in MSR-Coded Storage.
Proceedings of the 21st USENIX Conference on File and Storage Technologies, 2023

2022
Mining relations between personality traits and learning styles.
Inf. Process. Manag., 2022

Optimal-Repair-Cost MDS Array Codes for a Class of Heterogeneous Distributed Storage Systems.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Create More Than One Design: A Case Study of Applying Ethnographic Approach to Explore the Potential Information Application in Senior Karaoke Community.
Proceedings of the Human-Computer Interaction. User Experience and Behavior, 2022

2021
Skip-Sliding Window Codes.
IEEE Trans. Commun., 2021

Lower Bound on the Optimal Access Bandwidth of (K+2, K, 2)-MDS Array Code with Degraded Read Friendly.
CoRR, 2021

Achievable Lower Bound on the Optimal Access Bandwidth of (K + 2, K, 2)-MDS Array Code with Degraded Read Friendly.
Proceedings of the IEEE Information Theory Workshop, 2021

On the Repair Bandwidth and Repair Access of Two Storage Systems: Large-Scale and Uniform Rack-Aware Storage Systems.
Proceedings of the IEEE Information Theory Workshop, 2021

2020
Outage-Constrained Rate of Skip-Sliding Window Codes.
IEEE Trans. Green Commun. Netw., 2020

Iterative Soft Decoding of Reed-Solomon Tail-Biting Convolutional Concatenated Codes.
Proceedings of the 2020 International Conference on Wireless Communications and Signal Processing (WCSP), 2020

ML Soft-decision Decoding for Binary Linear Block Codes Based on Trellises of Their Supercodes.
Proceedings of the 29th International Conference on Computer Communications and Networks, 2020

2019
On the Throughput of Channels That Wear Out.
IEEE Trans. Commun., 2019

Multicasting Energy and Information Simultaneously.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
A Low-Complexity Maximum-Likelihood Decoder for Tail-Biting Convolutional Codes.
IEEE Trans. Commun., 2018

An Efficient Tree Search Algorithm for the Free Distance of Variable-Length Error-Correcting Codes.
IEEE Commun. Lett., 2018

Surprising sequences for communication and conversation.
Proceedings of the 52nd Annual Conference on Information Sciences and Systems, 2018

2017
Communication over a channel that wears out.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2014
Maximum-likelihood Soft-decision Decoding for Binary Linear Block Codes Based on Their Supercodes.
CoRR, 2014

2013
On the Design of Variable-Length Error-Correcting Codes.
IEEE Trans. Commun., 2013

2011
On the construction and MAP decoding of optimal variable-length error-correcting codes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Early-Elimination Modification for Priority-First Search Decoding.
IEEE Trans. Commun., 2010

An A*-Based Algorithm for Constructing Reversible Variable Length Codes with Minimum Average Codeword Length.
IEEE Trans. Commun., 2010

Reliability-Based Decoding for Convolutional Tail-Biting Codes.
Proceedings of the 71st IEEE Vehicular Technology Conference, 2010

2008
Low-complexity ML decoding for convolutional tail-biting codes.
IEEE Commun. Lett., 2008

Soft-decision priority-first decoding algorithms for variable-length error-correcting codes.
IEEE Commun. Lett., 2008


  Loading...