Xiande Zhang

Orcid: 0000-0003-4234-3610

According to our database1, Xiande Zhang authored at least 51 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Improved upper bounds for wide-sense frameproof codes.
CoRR, 2024

2023
Reconstruction of Sequences Distorted by Two Insertions.
IEEE Trans. Inf. Theory, August, 2023

2022
k-Uniform States in Heterogeneous Systems.
IEEE Trans. Inf. Theory, 2022

Sparse and Balanced MDS Codes Over Small Fields.
IEEE Trans. Inf. Theory, 2022

Strongly nonlocal unextendible product bases do exist.
Quantum, 2022

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

Balanced reconstruction codes for single edits.
CoRR, 2022

2021
Optimal Fraction Repetition Codes for Access-Balancing in Distributed Storage.
IEEE Trans. Inf. Theory, 2021

Optimal Ternary Codes With Weight w and Distance 2w - 2 in ℓ<sub>1</sub>-Metric.
IEEE Trans. Inf. Theory, 2021

New Results on Self-Dual Generalized Reed-Solomon Codes.
IEEE Trans. Inf. Theory, 2021

Optimal Codes With Small Constant Weight in ℓ₁-Metric.
IEEE Trans. Inf. Theory, 2021

New optimal error-correcting codes for crosstalk avoidance in on-chip data buses.
Adv. Math. Commun., 2021

2020
Some New Results on Splitter Sets.
IEEE Trans. Inf. Theory, 2020

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

Bounds on the number of mutually unbiased entangled bases.
Quantum Inf. Process., 2020

Suitable sets of permutations, packings of triples, and Ramsey's theorem.
Eur. J. Comb., 2020

Covering radius of permutation groups with infinity-norm.
Discret. Math., 2020

Optimal Constant-Weight Codes under l<sub>1</sub>-Metric.
CoRR, 2020

2019
Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families.
SIAM J. Discret. Math., 2019

Constructions of unextendible entangled bases.
Quantum Inf. Process., 2019

Repairing Generalized Reed-Muller Codes.
CoRR, 2019

2018
Optimal q-Ary Error Correcting/All Unidirectional Error Detecting Codes.
IEEE Trans. Inf. Theory, 2018

Linear Size Constant-Composition Codes Meeting the Johnson Bound.
IEEE Trans. Inf. Theory, 2018

2017
Splitter Sets and k-Radius Sequences.
IEEE Trans. Inf. Theory, 2017

Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes.
IEEE Trans. Inf. Theory, 2017

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

2015
On the List-Decodability of Random Self-Orthogonal Codes.
IEEE Trans. Inf. Theory, 2015

Complexity of Dependences in Bounded Domains, Armstrong Codes, and Generalizations.
IEEE Trans. Inf. Theory, 2015

Hanani triple packings and optimal q-ary codes of constant weight three.
Des. Codes Cryptogr., 2015

Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses.
Des. Codes Cryptogr., 2015

Optimal Codes in the Enomoto-Katona Space.
Comb. Probab. Comput., 2015

Linear Size Constant-Composition Codes.
CoRR, 2015

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

Spectrum of sizes for perfect burst deletion-correcting codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions.
IEEE Trans. Inf. Theory, 2014

2013
Transversals of Latin squares and covering radius of sets of permutations.
Eur. J. Comb., 2013

A new existence proof for Steiner quadruple systems.
Des. Codes Cryptogr., 2013

On the existence of retransmission permutation arrays.
Discret. Appl. Math., 2013

Complexity of dependencies in bounded domains, Armstrong Codes, and generalizations.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Optimal Ternary Constant-Weight Codes With Weight 4 and Distance 5.
IEEE Trans. Inf. Theory, 2012

Improved Constructions of Frameproof Codes.
IEEE Trans. Inf. Theory, 2012

Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences.
Math. Comput., 2012

Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four.
Des. Codes Cryptogr., 2012

2011
The α-Arboricity of Complete Uniform Hypergraphs.
SIAM J. Discret. Math., 2011

Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order.
Adv. Math. Commun., 2011

2010
H-designs with the properties of resolvability or (1, 2)-resolvability.
Des. Codes Cryptogr., 2010

Existence of resolvable H-designs with group sizes 2, 3, 4 and 6.
Des. Codes Cryptogr., 2010

Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices.
Discret. Appl. Math., 2010

2009
On Block Sequences of Steiner Quadruple Systems with Error Correcting Consecutive Unions.
SIAM J. Discret. Math., 2009

2007
On the existence of partitionable skew Room frames.
Discret. Math., 2007

Existence of Z-cyclic 3PDTWh(p) for Prime p == 1 (mod 4).
Des. Codes Cryptogr., 2007


  Loading...