Diagonal tree codes

DOI10.1016/S0019-9958(79)90410-8zbMath0398.05028OpenAlexW2025215148MaRDI QIDQ4182770

A. K. Dewdney

Publication date: 1979

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(79)90410-8

zbMATH Keywords

Diagonal Tree Codes

Mathematics Subject Classification ID

Trees (05C05)

Related Items (9)

On optimal realizations of finite metric spaces by graphs ⋮ A note on distance matrices with unicyclic graph realizations ⋮ Submatrices of non-tree-realizable distance matrices ⋮ Level-\(2\) networks from shortest and longest distances ⋮ A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices ⋮ Trees related to realizations of distance matrices ⋮ On optimal embeddings of metrics in graphs ⋮ An Optimal Diagonal Tree Code ⋮ Linear time tree codes

This page was built for publication: Diagonal tree codes