Bin Chen

Neurocomputing, 2020

On the Generalized Hamming Weights of (r, δ)-Locally Repairable Codes.

[BibT_eX]

[DOI]

IEEE Access, 2020

DIPDefend: Deep Image Prior Driven Defense against Adversarial Examples.

[BibT_eX]

[DOI]

Proceedings of the MM '20: The 28th ACM International Conference on Multimedia, 2020

Perfect LRCs and k-Optimal LRCs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Complete Characterization of Optimal LRCs with Minimum Distance 6 and Locality 2: Improved Bounds and Constructions.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Transferable Adversarial Attacks for Deep Scene Text Detection.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Pattern Recognition, 2020

Sample-aware Data Augmentor for Scene Text Recognition.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Pattern Recognition, 2020

Targeted Attack for Deep Hashing Based Retrieval.

[BibT_eX]

[DOI]

Proceedings of the Computer Vision - ECCV 2020, 2020

Adversarial Attack on Deep Product Quantization Network for Image Retrieval.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Constructions of Optimal $(r, \delta)$ Locally Repairable Codes via Constacyclic Codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2019

Complete Characterizations of Optimal Locally Repairable Codes With Locality 1 and $K-1$.

[BibT_eX]

[DOI]

Yichong Xia

IEEE Access, 2019

Improved bounds and Optimal Constructions of Locally Repairable Codes with distance 5 and 6.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Mean-Removed Product Quantization for Approximate Nearest Neighbor Search.

[BibT_eX]

[DOI]

Jiacheng Yang

Proceedings of the 2019 International Conference on Data Mining Workshops, 2019

2018

Constructions of Optimal Cyclic (r, δ) Locally Repairable Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

On Optimal (r, δ)-LRCs with Length n | (q+1).

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

Bandwidth Efficiency of Distance-optimal Scalar Locally Repairable Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

On Optimal Pseudo-cyclic ($r, \delta$) Locally Repairable Codes.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Locally Repairable Codes with Multiple (r<sub>i</sub>, δ<sub>i</sub>)-Localities.

[BibT_eX]

[DOI]

CoRR, 2017

On the weight hierarchy of locally repairable codes.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

On optimal ternary locally repairable codes.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Locally repairable codes with multiple (ri, δi)-localities.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

On the linear codes with (r, δ)-locality for distributed storage.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2017

2016

Recursive bounds for locally repairable codes with multiple repair groups.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Some results on optimal locally repairable codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

On the single-parity locally repairable codes with availability.

[BibT_eX]

[DOI]