Pith. sign in

REVIEW 2 cited by

Improving the Linkage Construction with Echelon-Ferrers for Constant-Dimension Codes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2002.10035 v3 pith:YCVX2VR3 submitted 2020-02-24 cs.IT math.IT

classification cs.ITmath.IT
keywords boundscodesconstant-dimensionconstructionechelon-ferrerslinkagelowerobtain
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Echelon-Ferrers is an important method to improve lower bounds for constant-dimension codes, which can be applied on various parameters. Fagang Li [12] combined the linkage construction and echelon-Ferrers to obtain some new lower bounds of constant-dimension codes. In this letter, we generalize this linkage construction to obtain new lower bounds.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Mainframe-Style Channel Controllers for Modern Disaggregated Memory Systems

    cs.OS 2025-06 conditional novelty 6.0 of 10

    The paper proposes memory channel controllers, an OS-centric, virtualizable abstraction for near-data processing over cache-coherent disaggregated memory.

  2. MetaAdvDet: Towards Robust Detection of Evolving Adversarial Attacks

    cs.CV 2019-08 conditional novelty 5.0 of 10

    MetaAdvDet uses a MAML-style double-network meta-learner to detect evolving adversarial attacks with one to five labeled examples, outperforming non-meta baselines on most tested benchmarks.

Pith tools