Pith. sign in

REVIEW 1 cited by

Quasi-optimal cyclic orbit 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 2501.03802 v1 pith:ZTNSHRS2 submitted 2025-01-07 cs.IT math.COmath.IT

Chiara Castello , Heide Gluesing-Luerssen , Olga Polverino , Ferdinando Zullo This is my paper · ORCID
classification cs.ITmath.COmath.IT
keywords codescyclicorbitcodederivefamilygeneralgroup
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We focus on two aspects of cyclic orbit codes: invariants under equivalence and quasi-optimality. Regarding the first aspect, we establish a connection between the codewords of a cyclic orbit code and a certain linear set on the projective line. This allows us to derive new bounds on the parameters of the code. In the second part, we study a particular family of (quasi-)optimal cyclic orbit codes and derive a general existence theorem for quasi-optimal codes in even-dimensional vector spaces over finite fields of any characteristic. Finally, for our particular code family we describe the automorphism groups under the general linear group and a suitable Galois group.

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. Asymptotically optimal cyclic subspace codes

    cs.IT 2025-07 conditional novelty 8.0 of 10

    A nesting operation builds cyclic subspace codes with minimum distance 2k-2 whose size asymptotically matches the Johnson bound when n/k is a power of 3.

Pith tools