Improved bounds for codes over trees

DOI10.1007/S10623-025-01741-6MaRDI QIDQ6866609zbMATH OpenFDO

Authors Yanzhi Li, Wen Jie Zhong, Tingting Chen, Xian De Zhang

Publication date 28 January 2026

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10623-025-01741-6

zbMATH Keywords

codesforeststree-distancetrees

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph theory (including graph drawing) in computer science (68R10) Theory of error-correcting codes and error-detecting codes (94B99)

Cites work

• A theorem on trees.
• Codes Over Trees
• Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars
• Graph theory
• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• scientific article; zbMATH DE number 3340110 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• New asymptotics for bipartite Turán numbers
• On Cayley's formula for counting forests
• The analytic representation of substitutions on a power of a prime number of letters with a discussion of the linear group. I, II.
• The log-structured merge-tree (LSM-tree)
• Über ein Problem von K. Zarankiewicz

This page was built for publication: Improved bounds for codes over trees

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