Van Khu Vu

Orcid: 0000-0002-3236-0575

According to our database1, Van Khu Vu authored at least 36 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Maximum Length RLL Sequences in de Bruijn Graph.
CoRR, 2024

2023
Scheduling to reduce close contacts: resolvable grid graph decomposition and packing.
Des. Codes Cryptogr., December, 2023

Transverse-Read-Codes for Domain Wall Memories.
IEEE J. Sel. Areas Inf. Theory, 2023

Efficient Approximation of Quantum Channel Fidelity Exploiting Symmetry.
CoRR, 2023

Codes for Correcting Asymmetric Adjacent Transpositions and Deletions.
CoRR, 2023

Codes for Correcting t Limited-Magnitude Sticky Deletions.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Maximal Length Constrained de Bruijn Sequences.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Thermal-Aware Channel Capacity.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Endurance-Limited Memories: Capacity and Codes.
IEEE Trans. Inf. Theory, 2022

Codes for the Asymmetric Damerau-Levenshtein Distance.
Proceedings of the IEEE Information Theory Workshop, 2022

Robust Locally Positioning Sequences and Codes: Capacity, Constructions and Applications.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Run Length Limited de Bruijn Sequences for Quantum Communications.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Group Testing with Blocks of Positives.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications.
IEEE Trans. Inf. Theory, 2021

Two-Dimensional Weight-Constrained Codes for Crossbar Resistive Memory Arrays.
IEEE Commun. Lett., 2021

Coding for Transverse-Reads in Domain Wall Memories.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Two Dimensional Deletion Correcting Codes and their Applications.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Burst-Deletion-Correcting Codes for Permutations and Multipermutations.
IEEE Trans. Inf. Theory, 2020

Constrained de Bruijn Codes: Properties, Enumeration, Constructions, and Applications.
CoRR, 2020

Codes Correcting Synchronization Errors for Symbol-Pair Read Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Capacity-Achieving Codes That Mitigate Intercell Interference and Charge Leakage in Flash Memories.
IEEE Trans. Inf. Theory, 2019

Proceedings of the 11th Asia-Europe Workshop on Concepts in Information Theory.
CoRR, 2019

Endurance-Limited Memories with Informed Decoder.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Coding for Write ℓ-step-up Memories.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Constrained de Bruijn Codes and their Applications.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Coding for Racetrack Memories.
IEEE Trans. Inf. Theory, 2018

Reconstruction from Deletions in Racetrack Memories.
Proceedings of the IEEE Information Theory Workshop, 2018

Codes for Endurance-Limited Memories.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Codes Correcting Limited-Shift Errors in Racetrack Memories.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Codes correcting position errors in racetrack memories.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Permutation codes correcting a single burst deletion II: Stable deletions.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
String concatenation construction for Chebyshev permutation channel codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Efficient encoding/decoding of capacity-achieving constant-composition ICI-free codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Rates of constant-composition codes that mitigate intercell interference.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Permutation codes correcting a single burst deletion I: Unstable deletions.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Breakpoint analysis and permutation codes in generalized Kendall tau and Cayley metrics.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014


  Loading...