Source-pinned research

Research proof index

Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.

This index contains 3 research declarations. Search 10,000 more complete Mathlib declarations.

1 topic

3 results

Clear filters
Project-declaredLean 4.31.0

Eq of le unique Decoding Radius

Code.eq_of_le_uniqueDecodingRadius

Plain-language statement

A stronger version of distFromCode_eq_of_lt_half_dist: If two codewords v and w are both within the uniqueDecodingRadius of u (i.e. 2 * Δ₀(u, v) < ‖C‖₀ and 2 * Δ₀(u, w) < ‖C‖₀), then they must be equal.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

UDR close iff exists unique close codeword

Code.UDR_close_iff_exists_unique_close_codeword

Plain-language statement

A word u is within the uniqueDecodingRadius of a code C if and only if there exists exactly one codeword v in C that is that close.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

UDR close iff rel URD close

Code.UDR_close_iff_relURD_close

Plain-language statement

A word u is close to a code C within the absolute unique decoding radius if and only if it is close within the relative unique decoding radius.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record