38 results on '"Heng, Ziling"'
Search Results
2. LCD codes and almost optimally extendable codes from self-orthogonal codes
3. Ternary self-orthogonal codes from weakly regular bent functions and their application in LCD Codes
4. Binary and ternary leading-systematic LCD codes from special functions
5. A construction of optimal locally recoverable codes
6. Three families of self-orthogonal codes and their application in optimal quantum codes
7. Hybrid character sums and near-optimal partial Hadamard codebooks
8. New infinite families of near MDS codes holding t-designs
9. Constructions of cyclic codes and extended primitive cyclic codes with their applications
10. Constructions of near MDS codes which are optimal locally recoverable codes
11. Linear complexity over Fq and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation
12. Note on graphs with irreducible characteristic polynomials
13. A family of projective two-weight linear codes
14. Projective binary linear codes from special Boolean functions
15. Nearly optimal codebooks based on generalized Jacobi sums
16. A construction of q-ary linear codes with irreducible cyclic codes
17. Complete weight distributions of two classes of cyclic codes
18. Evaluation of the Hamming weights of a class of linear codes based on Gauss sums
19. Optimal codebooks achieving the Levenshtein bound from generalized bent functions over ℤ 4
20. Constructions of MDS, Near MDS and Almost MDS Codes From Cyclic Subgroups of F* q 2.
21. Infinite families of t-designs and strongly regular graphs from punctured codes.
22. The Subfield Codes of Some [ q + 1, 2, q ] MDS Codes.
23. Two Families of Optimal Linear Codes and Their Subfield Codes.
24. Optimal Binary Linear Codes From Maximal Arcs.
25. The Subfield Codes of Ovoid Codes.
26. The subfield codes of hyperoval and conic codes.
27. Minimal linear codes over finite fields.
28. Minimal Binary Linear Codes.
29. A construction of q-ary linear codes with two weights.
30. New Constructions of Asymptotically Optimal Codebooks With Multiplicative Characters.
31. Optimal codebooks achieving the Levenshtein bound from generalized bent functions over $\mathbb {Z}_{4}$.
32. Three classes of linear codes with two or three weights.
33. Constructions of projective linear codes by the intersection and difference of sets.
34. Several Classes of Cyclic Codes With Either Optimal Three Weights or a Few Weights.
35. Two classes of two-weight linear codes.
36. Generalized Gray map and a class of p-ary nonlinear codes.
37. A Class of Binary Linear Codes With at Most Three Weights.
38. Near MDS codes from oval polynomials.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.