◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Jin Li

5 papers hereh-index 7154 citations20 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author1
  • middle author3

Across the 5 of 5 papers where every author was matched, so the position is known.

fields
  • cs.IT4
  • math.NT1
same name
  • Jin Li — 70 papers, h 35
  • Jin Li — 43 papers
  • Jin Li — 18 papers
  • Jin Li — 18 papers, h 25
  • Jin Li — 13 papers, h 15
  • Jin Li — 13 papers, h 4

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

most citedGeneralized Hamming Weights of Irreducible Cyclic Codes

4 citations · 6 across the 5 of their papers we have counts for

collaborators
Showing cs.ITShow all

4 papers · 1 filter

cs.IT2016

Linear Codes over Fq​[x]/(x2) and GR(p2,m) Reaching the Griesmer Bound

Jin Li, Aixian Zhang, Keqin Feng

We construct two series of linear codes over finite ring Fq​[x]/(x2) and Galois ring GR(p2,m) respectively reaching the Griesmer bound. They derive two series of c…

cs.IT2016★ 2 cited

Construction of Cyclic and Constacyclic Codes for b-symbol Read Channels Meeting the Plotkin-like Bound

Minghui Yang, Jin Li, Keqin Feng

The symbol-pair codes over finite fields have been raised for symbol-pair read channels and motivated by application of high-density data storage technologies [1, 2]. Their general…

cs.IT2016

Linear Codes over Galois Ring GR(p2,r) Related to Gauss sums

Aixian Zhang, Jin Li, Keqin Feng

Linear codes over finite rings become one of hot topics in coding theory after Hommons et al.([4], 1994) discovered that several remarkable nonlinear binary codes with some linear-…

cs.IT2014★ 4 cited

Generalized Hamming Weights of Irreducible Cyclic Codes

Minghui Yang, Jin Li, Keqin Feng +1

The generalized Hamming weight (GHW) dr​(C) of linear codes C is a natural generalization of the minimum Hamming distance d(C)(=d1​(C)) and has become one of important resear…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.