Unified parallel encoding and decoding algorithms for Dandelion-like codes

DOI10.1016/j.jpdc.2010.07.003zbMath1233.68222OpenAlexW1994108045MaRDI QIDQ666249

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

zbMATH Keywords

bijective tree encodingDandelion-like codesPRAM algorithmsPrüfer code

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Other types of codes (94B60)

Related Items (1)

Unified parallel encoding and decoding algorithms for Dandelion-like codes

Uses Software

• PRIX

Cites Work

• Unified parallel encoding and decoding algorithms for Dandelion-like codes
• Bijections for Cayley trees, spanning trees, and their q-analogues
• Tree codes that preserve increases and degree sequences
• Computing Prüfer codes efficiently in parallel
• Genetic algorithms: Principles and perpectives. A guide to GA theory
• Probabilistic parallel prefix computation
• On coding labeled trees
• Parallel Algorithms for Encoding and Decoding Blob Code
• A general bijective algorithm for trees.
• Computing and Combinatorics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Unified parallel encoding and decoding algorithms for Dandelion-like codes