The following pages link to On binary tree encodements (Q795519):
Displaying 11 items.
- Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
- On efficient entreeings (Q1323334) (← links)
- Encoding trees by linear recurrence sequences (Q1699391) (← links)
- Bit-optimal decoding of codes whose Tanner graphs are trees (Q1811114) (← links)
- Non-malleable codes for decision trees (Q2181859) (← links)
- Generalized Huffman coding for binary trees with choosable edge lengths (Q2512825) (← links)
- How to Construct Interval Encryption from Binary Tree Encryption (Q3575034) (← links)
- Tree-Based Encoding for Cancellations on Morse Complexes (Q3651625) (← links)
- (Q4489231) (← links)
- A New Coding Algorithm for Trees (Q4542812) (← links)
- Information Security and Cryptology - ICISC 2003 (Q5714114) (← links)