Hengjia Wei

Ron M. Roth

CoRR, 2024

2023

Robust Network Function Computation.

[BibT_eX]

[DOI]

Min Xu

IEEE Trans. Inf. Theory, November, 2023

Perfect Codes Correcting a Single Burst of Limited-Magnitude Errors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, February, 2023

Reconstruction from Noisy Substrings.

[BibT_eX]

[DOI]

CoRR, 2023

Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2023

2022

Sequence Reconstruction for Limited-Magnitude Errors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Improved Coding Over Sets for DNA-Based Data Storage.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Nearly Optimal Robust Positioning Patterns.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

On the Generalized Covering Radii of Reed-Muller Codes.

[BibT_eX]

[DOI]

Dor Elimelech

IEEE Trans. Inf. Theory, 2022

On tilings of asymmetric limited-magnitude balls.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

2021

On Lattice Packings and Coverings of Asymmetric Limited-Magnitude Balls.

[BibT_eX]

[DOI]

Xin Wang

IEEE Trans. Inf. Theory, 2021

On the Gap Between Scalar and Vector Solutions of Generalized Combination Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

2020

Burst-Deletion-Correcting Codes for Permutations and Multipermutations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Efficient and Explicit Balanced Primer Codes.

[BibT_eX]

[DOI]

Yeow Meng Chee

Han Mao Kiah

IEEE Trans. Inf. Theory, 2020

Low-Power Cooling Codes With Efficient Encoding and Decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Robust Positioning Patterns with Low Redundancy.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

Maximum Length of Robust Positioning Sequences.

[BibT_eX]

[DOI]

Duc Tu Dao

Han Mao Kiah

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

On Private Information Retrieval Array Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Binary Robust Positioning Patterns with Low Redundancy and Efficient Locating Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Geometric Orthogonal Codes of Size Larger Than Optical Orthogonal Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

A strengthened inequality of Alon-Babai-Suzuki's conjecture on set systems with restricted intersections modulo p.

[BibT_eX]

[DOI]

Xin Wang

Discret. Math., 2018

2017

Some more uniformly resolvable designs with block sizes 2 and 4.

[BibT_eX]

[DOI]

Discret. Math., 2017

Generic constructions for partitioned difference families with applications: a unified combinatorial approach.

[BibT_eX]

[DOI]

Shuxing Li

Des. Codes Cryptogr., 2017

Permutation codes correcting a single burst deletion II: Stable deletions.

[BibT_eX]

[DOI]

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

Geometric orthogonal codes better than optical orthogonal codes.

[BibT_eX]

[DOI]

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

2016

New Bounds and Constructions for Multiply Constant-Weight Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Uniformly resolvable designs with block sizes 3 and 4.

[BibT_eX]

[DOI]

Discret. Math., 2016

2015

Optimal ternary constant-composition codes with weight four and distance six.

[BibT_eX]

[DOI]

Discret. Math., 2015

Group divisible designs with block size four and group type gum1.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2015

Spectrum of sizes for perfect 2-deletion-correcting codes of length 4.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2015

Completely reducible super-simple designs with block size five and index two.

[BibT_eX]

[DOI]

Hui Zhang

Des. Codes Cryptogr., 2015

2014

Some more 5-GDDs, 4-frames and 4-RGDDs.

[BibT_eX]

[DOI]

Discret. Math., 2014

Group divisible designs with block sizes from Kl(3) and Kirkman frames of type huml.

[BibT_eX]

[DOI]

Discret. Math., 2014

Kirkman frames having hole type $$h^{u} m^{1}$$ for $$h \equiv 0 {\, \, \mathrm{mod}\, 12}\, $$.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2014

2013

Group divisible designs with block size four and group type gum1gum1 for more small gg.

[BibT_eX]

[DOI]