On binary tree encodements

DOI10.1007/BF00289239zbMATH Open0542.68080MaRDI QIDQ795519FDOQ795519

Authors: Will D. Gillett 

Publication date: 1984

Published in: Acta Informatica (Search for Journal in Brave)

Recommendations

• A compact encoding of unordered binary trees
• Encoding trees by linear recurrence sequences
• A New Coding Algorithm for Trees
• scientific article; zbMATH DE number 1472176
• Coding Binary Trees by Words over an Alphabet with Four Letters

zbMATH Keywords

associative memorydata encoding schemelinearization of binary treesnumber of legal memory configurationsordered forests of complete binary trees

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Effects of Configuration Interaction on Intensities and Phase Shifts
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (12)

• TCAM representations of intervals of integers encoded by binary trees
• Bijective linear time coding and decoding for \(k\)-trees
• Generalized Huffman coding for binary trees with choosable edge lengths
• Encoding trees by linear recurrence sequences
• Bit-optimal decoding of codes whose Tanner graphs are trees
• Non-malleable codes for decision trees
• Title not available (Why is that?)
• Information Security and Cryptology - ICISC 2003
• How to Construct Interval Encryption from Binary Tree Encryption
• A compact encoding of unordered binary trees
• Tree-Based Encoding for Cancellations on Morse Complexes
• A New Coding Algorithm for Trees

This page was built for publication: On binary tree encodements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795519)