Unified parallel encoding and decoding algorithms for Dandelion-like codes
From MaRDI portal
Publication:666249
Recommendations
Cites work
- scientific article; zbMATH DE number 3954145 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 1735659 (Why is no real title available?)
- scientific article; zbMATH DE number 1472143 (Why is no real title available?)
- scientific article; zbMATH DE number 1744078 (Why is no real title available?)
- scientific article; zbMATH DE number 3340110 (Why is no real title available?)
- scientific article; zbMATH DE number 3079148 (Why is no real title available?)
- A general bijective algorithm for trees.
- Bijections for Cayley trees, spanning trees, and their q-analogues
- Computing Prüfer codes efficiently in parallel
- Computing and Combinatorics
- Constrained minimal spanning trees solved by a GA with feasible encodings
- Genetic algorithms: Principles and perpectives. A guide to GA theory
- Introduction to algorithms
- Linear-time algorithms for encoding trees as sequences of node labels
- On coding labeled trees
- Parallel algorithms for encoding and decoding Blob code
- Probabilistic parallel prefix computation
- Tree codes that preserve increases and degree sequences
- Unified parallel encoding and decoding algorithms for Dandelion-like codes
Cited in
(3)
This page was built for publication: Unified parallel encoding and decoding algorithms for Dandelion-like codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666249)