Pith. sign in

REVIEW 1 cited by

Optimal Ferrers Diagram Rank-Metric Codes

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1405.1885 v2 pith:AP7DI73B submitted 2014-05-08 cs.IT math.IT

Antonia Wachter-Zeh , Tuvi Etzion This is my paper · ORCID
classification cs.ITmath.IT
keywords codesferrersoptimalrank-metricdiagramdiagramscertainconsidered
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Optimal rank-metric codes in Ferrers diagrams are considered. Such codes consist of matrices having zeros at certain fixed positions and can be used to construct good codes in the projective space. Four techniques and constructions of Ferrers diagram rank-metric codes are presented, each providing optimal codes for different diagrams and parameters.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. New Constructions of Subspace Codes Using Subsets of MRD codes in Several Blocks

    cs.IT 2019-08 conditional novelty 6.0 of 10

    Parallel versions of the linkage construction and of multi-block lifted MRD codes yield new lower bounds on A_q(n,d,k), beating the previous tables in more than 110 cases.

Pith tools