Pages that link to "Item:Q4020276"
From MaRDI portal
The following pages link to OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES (Q4020276):
Displaying 8 items.
- Unified parallel encoding and decoding algorithms for Dandelion-like codes (Q666249) (← links)
- Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
- Time-optimal tree computations on sparse meshes (Q1364469) (← links)
- Bit-optimal decoding of codes whose Tanner graphs are trees (Q1811114) (← links)
- Accelerated partial decoding in wavelet trees (Q2295619) (← links)
- A New Coding Algorithm for Trees (Q4542812) (← links)
- A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗ (Q4820078) (← links)
- Constructing Huffman Trees in Parallel (Q4862791) (← links)