activity
20082026
most citedA Construction for Constant-Composition Codes

13 citations · 18 across the 6 of their papers we have counts for

collaborators

6 papers

cs.SC2026

Explicit Factorization of over via Cofactor-Free Single-Seed Hensel Lifting

Yongchao Wang, Yang Ding, Jiansheng Yang +1

We present a complete framework for the explicit factorization of over integer residue rings for arbitrary with . Classical approaches…

cs.IT2026

Explicit Factorization of over : A Structural Approach via Dickson Polynomials

Yongchao Wang, Yang Ding, Jiansheng Yang +1

Let be an odd prime. The factorization of the polynomial over the integer residue ring is pivotal for constructing cyclic codes with Hermitian sy…

cs.IT2014

On List-decodability of Random Rank Metric Codes

Yang Ding

In the present paper, we consider list decoding for both random rank metric codes and random linear rank metric codes. Firstly, we show that, for arbitrary and ( a…

cs.IT2014

Erasure List-Decodable Codes from Random and Algebraic Geometry Codes

Yang Ding, Lingfei Jin, Chaoping Xing

Erasure list decoding was introduced to correct a larger number of erasures with output of a list of possible candidates. In the present paper, we consider both random linear codes…

cs.IT2008★ 5 cited

Asymptotic Bound on Binary Self-Orthogonal Codes

Yang Ding

We present two constructions for binary self-orthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when t…

cs.IT2008★ 13 cited

A Construction for Constant-Composition Codes

Yang Ding

By employing the residue polynomials, a construction of constant-composition codes is given. This construction generalizes the one proposed by Xing[16]. It turns out that when d=3…