Pages that link to "Item:Q4034459"
From MaRDI portal
The following pages link to A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate (Q4034459):
Displaying 4 items.
- On quasilinear-time complexity theory (Q672330) (← links)
- Non-malleable encryption: simpler, shorter, stronger (Q2210445) (← links)
- Non-Malleable Encryption: Simpler, Shorter, Stronger (Q2796130) (← links)
- Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes (Q5066947) (← links)