Wentu Song

Orcid: 0000-0003-2720-1622

According to our database1, Wentu Song authored at least 45 papers between 2010 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
New Construction of q-ary Codes Correcting a Burst of at most t Deletions.
CoRR, 2024

2023
Non-Binary Two-Deletion Correcting Codes and Burst-Deletion Correcting Codes.
IEEE Trans. Inf. Theory, October, 2023

Non-binary Codes Correcting Two Deletions.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Systematic Codes Correcting Multiple-Deletion and Multiple-Substitution Errors.
IEEE Trans. Inf. Theory, 2022

Asymmetric Decentralized Caching With Coded Prefetching Under Nonuniform Requests.
IEEE Syst. J., 2022

List-decodable Codes for Single-deletion Single-substitution with List-size Two.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Optimal Single Chromosome-Inversion Correcting Codes for Data Storage in Live DNA.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Dynamic Programming for Sequential Deterministic Quantization of Discrete Memoryless Channels.
IEEE Trans. Commun., 2021

On Multiple-Deletion Multiple-Substitution Correcting Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Sequence-Subset Distance and Coding for Error Control in DNA-Based Data Storage.
IEEE Trans. Inf. Theory, 2020

Secure Erasure Codes With Partial Reconstructibility.
IEEE Trans. Inf. Theory, 2020

Systematic Single-Deletion Multiple-Substitution Correcting Codes.
CoRR, 2020

Coded Caching with Polynomial Subpacketization.
CoRR, 2020

2019
Some new Constructions of Coded Caching Schemes with Reduced Subpacketization.
CoRR, 2019

Dynamic Programming for Discrete Memoryless Channel Quantization.
CoRR, 2019

Dynamic Programming for Quantization of q-ary Input Discrete Memoryless Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
On Sequential Locally Repairable Codes.
IEEE Trans. Inf. Theory, 2018

Codes With Run-Length and GC-Content Constraints for DNA-Based Data Storage.
IEEE Commun. Lett., 2018

Sequence-Subset Distance and Coding for Error Control in DNA-based Data Storage.
CoRR, 2018

Some Constructions of Optimal Locally Repairable Codes.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Generalized Reed-Solomon Codes with Sparsest and Balanced Generator Matrices.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2016
On Sequential Locally Repairable Codes.
CoRR, 2016

Binary Locally Repairable Codes - Sequential Repair for Multiple Erasures.
Proceedings of the 2016 IEEE Global Communications Conference, 2016

2015
Minimizing Transmission Cost for Third-Party Information Exchange with Network Coding.
IEEE Trans. Mob. Comput., 2015

On Simple Multiple Access Networks.
IEEE J. Sel. Areas Commun., 2015

Locally Repairable Codes with Functional Repair and Multiple Erasure Tolerance.
CoRR, 2015

On the Solvability of 3s/nt Sum-Network - A Region Decomposition and Weak Decentralized Code Method.
CoRR, 2015

Erasure codes with symbol locality and group decodability for distributed storage.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Local codes with addition based repair.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Weakly secure MDS codes for simple multiple access networks.
Proceedings of the IEEE International Symposium on Information Theory, 2015

False data injection attacks with local topology information against linear state estimation.
Proceedings of the 2015 IEEE Innovative Smart Grid Technologies, 2015

Secure erasure codes with partial decodability.
Proceedings of the 2015 IEEE International Conference on Communications, 2015

Locally Encodable and Decodable Codes for Distributed Storage Systems.
Proceedings of the 2015 IEEE Global Communications Conference, 2015

Constructions of MDS codes via random Vandermonde and Cauchy matrices over small fields.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
Optimal Locally Repairable Linear Codes.
IEEE J. Sel. Areas Commun., 2014

Network Coding for $3$s$/n$t Sum-Networks.
CoRR, 2014

On block security of regenerating codes at the MBR point for distributed storage systems.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On the existence of MDS codes over small fields with constrained generator matrices.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
The Complexity of Network Coding With Two Unit-Rate Multicast Sessions.
IEEE Trans. Inf. Theory, 2013

Balanced Sparsest generator matrices for MDS codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Error Correction for Cooperative Data Exchange.
IEEE Commun. Lett., 2012

Network coding for two-unicast with rate (1, 2).
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Exchanging third-party information with minimum transmission cost.
Proceedings of the 2012 IEEE Global Communications Conference, 2012

The encoding complexity of network coding with two simple multicast sessions.
Proceedings of the 9th International Conference on Fuzzy Systems and Knowledge Discovery, 2012

2010
Encoding Complexity for Intersession Network Coding with Two Simple Multicast Sessions
CoRR, 2010


  Loading...