Jun Zhang

Orcid: 0000-0003-2173-3302

Affiliations:
  • Capital Normal University, School of Mathematical Sciences, Beijing, China
  • Nankai University, Chern Institute of Mathematics, Tianjin, China (former)
  • University of California, Irvine, CA, USA (2012-2013)


According to our database1, Jun Zhang authored at least 39 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Twisted Generalized Reed-Solomon Codes With ℓ Twists.
IEEE Trans. Inf. Theory, January, 2024

A Federated Online Restless Bandit Framework for Cooperative Resource Allocation.
CoRR, 2024

2023
On Deep Holes of Elliptic Curve Codes.
IEEE Trans. Inf. Theory, July, 2023

The solution to an open problem on the bentness of Mesnager's functions.
Finite Fields Their Appl., June, 2023

Improved Singleton-type bounds for list-decoding and average-radius list-decoding.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Constructions and Weight Distributions of Optimal Locally Repairable Codes.
IEEE Trans. Commun., 2022

A class of almost MDS codes.
Finite Fields Their Appl., 2022

A class of twisted generalized Reed-Solomon codes.
Des. Codes Cryptogr., 2022

LWE from non-commutative group rings.
Des. Codes Cryptogr., 2022

New constructions of self-dual generalized Reed-Solomon codes.
Cryptogr. Commun., 2022

New Constructions of Paraunitary Matrices for Golay Sequences.
Proceedings of the 10th International Workshop on Signal Design and Its Applications in Communications, 2022

Cross-Guided Feature Fusion with Intra-Modality Reweighting for Multi-Spectral Pedestrian Detection.
Proceedings of the 26th International Conference on Pattern Recognition, 2022

2021
Hulls of Generalized Reed-Solomon Codes via Goppa Codes and Their Applications to Quantum Codes.
IEEE Trans. Inf. Theory, 2021

An Open Problem on the Bentness of Mesnager’s Functions.
IACR Cryptol. ePrint Arch., 2021

Optimal quaternary (r, δ)-Locally Recoverable Codes: Their Structures and Complete Classification.
CoRR, 2021

An Open Problem on the Bentness of Mesnager's Functions.
CoRR, 2021

2020
On the 2-Adic Complexity of the Ding-Helleseth-Martinsen Binary Sequences.
IEEE Trans. Inf. Theory, 2020

Deep Holes of Projective Reed-Solomon Codes.
IEEE Trans. Inf. Theory, 2020

Rational points on complete symmetric hypersurfaces over finite fields.
Discret. Math., 2020

A Note on Self-Dual Generalized Reed-Solomon Codes.
CoRR, 2020

Weight Distributions of q-ary Optimal Locally Repairable Codes with Locality 2, Distance 5 and Even Dimension.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
A construction of <i>V</i><sub><i>h</i></sub>-sequences and its application to binary asymmetric error-correcting codes.
Finite Fields Their Appl., 2019

2018
Relative generalized Hamming weights of cyclic codes.
Finite Fields Their Appl., 2018

New constructions of MDS symbol-pair codes.
Des. Codes Cryptogr., 2018

2017
Explicit Deep Holes of Reed-Solomon Codes.
CoRR, 2017

2016
Multiple Repair Localities with Distinct Erasure Tolerance.
Int. J. Found. Comput. Sci., 2016

Deterministic convolutional compressed sensing matrices.
Finite Fields Their Appl., 2016

On deep holes of projective Reed-Solomon codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Some Improvements on Locally Repairable Codes.
CoRR, 2015

On the minimum distance of elliptic curve codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Stopping Sets of Algebraic Geometry Codes.
IEEE Trans. Inf. Theory, 2014

Capacity Region of Wireless Network Coding.
Proceedings of the Network and Parallel Computing, 2014

An analysis of scheduling mechanism in wireless network coding.
Proceedings of the 20th IEEE International Workshop on Local & Metropolitan Area Networks, 2014

Multi-receiver Authentication Scheme for Multiple Messages Based on Linear Codes.
Proceedings of the Information Security Practice and Experience, 2014

2013
An Authentication Scheme for Subspace Codes over Network Based on Linear Codes
CoRR, 2013

Security Analysis on "An Authentication Code Against Pollution Attacks in Network Coding"
CoRR, 2013

2012
New Deep Holes of Generalized Reed-Solomon Codes
CoRR, 2012

Stopping Set Distributions of Algebraic Geometry Codes from Elliptic Curves.
Proceedings of the Theory and Applications of Models of Computation, 2012

Constructions for Binary Codes Correcting Asymmetric Errors from Function Fields.
Proceedings of the Theory and Applications of Models of Computation, 2012


  Loading...