Linear-time encodable/decodable codes with near-optimal rate

Guruswami, V., & Indyk, P. Linear-time encodable/decodable codes with near-optimal rate.

Type

Web resource

Intellectual base

Web

Link

https://www.cs.cmu.edu/~venkatg/pubs/papers/lin-zyablov.pdf

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Domain-specific

• Zyablov Bound
  • The multilevel Blokh–Zyablov curve is a distinct stronger construction, not an alias for this single-level bound.

    This sourceOriginal research; ε-qualified linear-time construction and distinct multilevel extension.

Verification

Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:b7c84524f297 · see in the full table