Unified parallel encoding and decoding algorithms for Dandelion-like codes
DOI10.1016/J.JPDC.2010.07.003zbMATH Open1233.68222OpenAlexW1994108045MaRDI QIDQ666249FDOQ666249
Authors: Saverio Caminiti, Rossella Petreschi
Publication date: 7 March 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: http://www.dsi.uniroma1.it/~caminiti/publications.html
Recommendations
bijective tree encodingDandelion-like codes[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Pr%EF%BF%BD%EF%BF%BDfer+code&go=Go Pr��fer code]PRAM algorithms
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Parallel algorithms in computer science (68W10) Other types of codes (94B60)
Cites Work
- Title not available (Why is that?)
- Introduction to algorithms
- Title not available (Why is that?)
- Bijections for Cayley trees, spanning trees, and their q-analogues
- Title not available (Why is that?)
- Title not available (Why is that?)
- A general bijective algorithm for trees.
- Linear-time algorithms for encoding trees as sequences of node labels
- Genetic algorithms: Principles and perpectives. A guide to GA theory
- Tree codes that preserve increases and degree sequences
- Computing Prüfer codes efficiently in parallel
- Probabilistic parallel prefix computation
- On coding labeled trees
- Constrained minimal spanning trees solved by a GA with feasible encodings
- Parallel algorithms for encoding and decoding Blob code
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing and Combinatorics
- Unified parallel encoding and decoding algorithms for Dandelion-like codes
Cited In (3)
Uses Software
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)