Pages that link to "Item:Q5510064"
From MaRDI portal
The following pages link to Two inequalities implied by unique decipherability (Q5510064):
Displayed 6 items.
- Binary trees with choosable edge lengths (Q989581) (← links)
- The asymptotic number of solutions of a diophantine equation from coding theory (Q1215657) (← links)
- A fast algorithm for the unique decipherability of multivalued encodings (Q1341741) (← links)
- Robust universal complete codes for transmission and compression (Q1917238) (← links)
- Inaccuracy and coding theory (Q2528858) (← links)
- A note on growing binary trees (Q2555859) (← links)