Diagonal tree codes

DOI10.1016/S0019-9958(79)90410-8MaRDI QIDQ4182770zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(9)

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

This page was built for publication: Diagonal tree codes

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