Xiangliang Kong

Orcid: 0000-0002-7893-2276

According to our database1, Xiangliang Kong authored at least 16 papers between 2019 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
On MDS Convertible Codes in the Merge Regime.
IEEE Trans. Inf. Theory, May, 2026

New Capacity Bounds for PIR on Graph and Multigraph-Based Replicated Storage.
IEEE Trans. Inf. Theory, January, 2026

2025
Combinatorial Alphabet-Dependent Bounds for Insdel Codes.
IEEE Trans. Inf. Theory, May, 2025

Batch Array Codes.
IEEE Trans. Inf. Theory, February, 2025

A Point-Variety Incidence Theorem over Finite Fields, and Its Applications.
SIAM J. Discret. Math., 2025

Private Information Retrieval on Multigraph-Based Replicated Storage.
Proceedings of the IEEE International Symposium on Information Theory, 2025

On Linear Field Size Access-Optimal MDS Convertible Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2025

New Bounds and Constructions for Variable Packet-Error Coding.
Proceedings of the IEEE International Symposium on Information Theory, 2025

2024
Bounds and Constructions for Generalized Batch Codes.
IEEE Trans. Inf. Theory, October, 2024

Locally Repairable Convertible Codes With Optimal Access Costs.
IEEE Trans. Inf. Theory, September, 2024

Batch Array Codes.
CoRR, 2024

2022
Bollobás-type theorems for hemi-bundled two families.
Eur. J. Comb., 2022

Optimal Quaternary Locally Repairable Codes Attaining the Singleton-like Bound.
CoRR, 2022

2021
New Constructions of Optimal Locally Repairable Codes With Super-Linear Length.
IEEE Trans. Inf. Theory, 2021

New Bounds and Constructions for Constant Weighted X-Codes.
IEEE Trans. Inf. Theory, 2021

2019
New Bounds on the Field Size for Maximally Recoverable Codes Instantiating Grid-like Topologies.
CoRR, 2019


  Loading...