pith. sign in

Title resolution pending

· 2000

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.IT 1

years

2024 1

verdicts

UNVERDICTED 1

representative citing papers

Additive codes attaining the Griesmer bound

cs.IT · 2024-12-19 · unverdicted · novelty 7.0

Additive codes attain the Griesmer bound with equality for sufficiently large minimum distance, giving infinite series of optimal codes superior to linear codes.

citing papers explorer

Showing 1 of 1 citing paper.

  • Additive codes attaining the Griesmer bound cs.IT · 2024-12-19 · unverdicted · none · ref 54

    Additive codes attain the Griesmer bound with equality for sufficiently large minimum distance, giving infinite series of optimal codes superior to linear codes.