New upper bounds for error-correcting codes

Bassalygo, L. A. (1965). New upper bounds for error-correcting codes.

Type

Unclassified

Intellectual base

Unclassified

Year

1965

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Elias Bassalygo bound
  • The Elias–Bassalygo argument uses averaging or translation to find many codewords in a Hamming ball or sphere, shortens or maps them, and bounds their pairwise distance to limit code size.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:827088169b76 · see in the full table