A New Coding Algorithm for Trees
From MaRDI portal
Recommendations
- A coding algorithm for Rényi trees
- The coding of binary trees
- scientific article; zbMATH DE number 743588
- Codes Over Trees
- On coding labeled trees
- An improvement of the tree code construction
- Tree approximation and optimal encoding
- On binary tree encodements
- OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES
- A note on trees and codes
Cited in
(19)- A note on trees and codes
- scientific article; zbMATH DE number 743588 (Why is no real title available?)
- Coding Binary Trees by Words over an Alphabet with Four Letters
- An improvement of the tree code construction
- Data coding by linear forms of numerical sequences
- Encoding trees by linear recurrence sequences
- Transforming trees into abelian groups
- Non-malleable codes for decision trees
- A coding algorithm for Rényi trees
- Explicit binary tree codes with polylogarithmic size alphabet
- On coding labeled trees
- On the reconstruction of a Motzkin Tree from its code
- A shift Gray code for fixed-content Łukasiewicz words
- scientific article; zbMATH DE number 1472176 (Why is no real title available?)
- scientific article; zbMATH DE number 1759379 (Why is no real title available?)
- Computing and Combinatorics
- On binary tree encodements
- Linear time tree codes
- A compact encoding of unordered binary trees
This page was built for publication: A New Coding Algorithm for Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542812)
