San Ling

Nanyang Technological University (NTU)

Singapore

Research Interests

Contact this professor

Get a free first email built on one of their papers, ready for you to edit and send yourself.

Articles (21)

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2024

Year:

2024

Year:

2024

Year:

2023

Year:

2023

Year:

2023

Year:

2023

Year:

2021

Year:

2021

Year:

2021

Year:

2020

Year:

2020

Year:

2020

Collaborators (3)

Huaxiong Wang

Nanyang Technological University (NTU)

SINGAPORE

View details

Jae Hong Seo

Hanyang University

SOUTH KOREA

View details

Markus Grassl

University of Gdańsk

POLAND

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

San Ling

Research Interests

Contact this professor

Articles (21)

Characterization of Nearly Self-Orthogonal Quasi-Twisted Codes and Related Quantum Codes

On the Error Coefficients of Asymptotic Frame Error Rate Optimal Binary Linear Codes

Bounds and Constructions of Quantum Locally Recoverable Codes From Quantum CSS Codes

A Mass Formula for Linear Codes With Prescribed Hull Dimension and Related Classification

An Open Problem and a Conjecture on Binary Linear Complementary Pairs of Codes

On the b-Symbol Distances of Matrix Product Codes, Constacyclic Codes, and Reed-Muller Codes

Nonexistence of Several Infinite Families of Binary Self-Orthogonal Codes

Optimal Linear Codes from Duals of Punctured Concatenated Codes

On the Weights of Linear Codes with Prescribed Automorphisms

On the Weights of Linear Codes With Prescribed Automorphisms

Explicit Low-Bandwidth Evaluation Schemes for Weighted Sums of Reed-Solomon-Coded Symbols

A Construction of Maximum Distance Profile Convolutional Codes With Small Alphabet Sizes

New Families of MDS Symbol-Pair Codes From Matrix-Product Codes

Hulls of Reed-Solomon Codes via Algebraic Geometry Codes

Three New Constructions of Optimal Locally Repairable Codes From Matrix-Product Codes

Adaptive oblivious transfer with access control from lattice assumptions

A Comparison of Distance Bounds for Quasi-Twisted Codes

Binary de Bruijn Sequences via Zech’s Logarithms

Provably Secure Group Signature Schemes From Code-Based Assumptions

Compact Code-Based Signature for Reconfigurable Devices With Side Channel Resilience

Public key encryption with equality test in the standard model

Collaborators (3)

Huaxiong Wang

Jae Hong Seo

Markus Grassl

Make your next move.