Ziling Heng

From MaRDI portal
Person:502402

Available identifiers

zbMath Open heng.zilingMaRDI QIDQ502402

List of research outcomes





PublicationDate of PublicationType
Two families of linear codes with desirable properties from some functions over finite fields2025-01-23Paper
Self-orthogonal codes from p-divisible codes2025-01-23Paper
Combinatorial \(t\)-designs and strongly regular graphs from projective codes over finite fields2024-11-04Paper
LCD codes and almost optimally extendable codes from self-orthogonal codes2024-10-14Paper
An improvement on Weil bounds for character sums of polynomials over finite fields2024-08-13Paper
Several families of self-orthogonal codes and their applications in optimal quantum codes and LCD codes2024-07-23Paper
Binary and ternary leading-systematic LCD codes from special functions2024-07-02Paper
Projective Linear Codes From Some Almost Difference Sets2024-03-18Paper
Constructions of MDS, Near MDS and Almost MDS Codes From Cyclic Subgroups of F*q 22024-03-14Paper
Ternary self-orthogonal codes from weakly regular bent functions and their application in LCD codes2023-11-20Paper
Three families of self-orthogonal codes and their application in optimal quantum codes2023-10-04Paper
Hybrid character sums and near-optimal partial Hadamard codebooks2023-09-25Paper
Near MDS codes with dimension 4 and their application in locally recoverable codes2023-08-10Paper
New infinite families of near MDS codes holding \(t\)-designs2023-07-19Paper
Infinite families of \(t\)-designs and strongly regular graphs from punctured codes2023-07-07Paper
A construction of optimal locally recoverable codes2023-07-03Paper
Constructions of cyclic codes and extended primitive cyclic codes with their applications2023-06-19Paper
Constructions of near MDS codes which are optimal locally recoverable codes2023-04-27Paper
Constructions of projective linear codes by the intersection and difference of sets2022-08-26Paper
Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation2022-08-04Paper
The Subfield Codes of Some [q + 1, 2, q] MDS Codes2022-07-13Paper
Constructions of near MDS codes which are optimal locally recoverable codes2022-04-24Paper
Projective binary linear codes from special Boolean functions2021-09-10Paper
Note on graphs with irreducible characteristic polynomials2021-09-02Paper
A family of projective two-weight linear codes2021-08-02Paper
Near MDS codes from oval polynomials2021-03-25Paper
Two Families of Optimal Linear Codes and Their Subfield Codes2020-12-04Paper
Optimal Binary Linear Codes From Maximal Arcs2020-09-29Paper
The Subfield Codes of Ovoid Codes2019-07-19Paper
A construction of \(q\)-ary linear codes with irreducible cyclic codes2019-05-17Paper
The subfield codes of hyperoval and conic codes2019-03-27Paper
Nearly optimal codebooks based on generalized Jacobi sums2018-10-26Paper
Minimal linear codes over finite fields2018-10-24Paper
Minimal Binary Linear Codes2018-09-19Paper
New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters2018-06-27Paper
A construction of \(q\)-ary linear codes with two weights2017-10-05Paper
Several Classes of Cyclic Codes With Either Optimal Three Weights or a Few Weights2017-04-28Paper
Evaluation of the Hamming weights of a class of linear codes based on Gauss sums2017-04-13Paper
Complete weight distributions of two classes of cyclic codes2017-02-09Paper
Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)2017-01-05Paper
Three classes of linear codes with two or three weights2016-07-05Paper
Two classes of two-weight linear codes2016-02-09Paper
Generalized Gray map and a class of \(p\)-ary nonlinear codes2015-10-19Paper
Weight distributions of a class of cyclic codes from \(\mathbb F_l\)-conjugates2015-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54994892015-02-11Paper
https://portal.mardi4nfdi.de/entity/Q53999612014-02-28Paper
More MDS codes of non-Reed-Solomon typeN/APaper

Research outcomes over time

This page was built for person: Ziling Heng