An improvement of the tree code construction

DOI10.1016/J.IPL.2006.03.007zbMATH Open1184.68624OpenAlexW2031579086MaRDI QIDQ845688FDOQ845688

Authors: Marcin Peczarski 

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.03.007

Recommendations

• A New Coding Algorithm for Trees
• Towards deterministic tree code constructions
• The coding of binary trees
• Codes Over Trees
• Improved Constructions of Nested Code Pairs
• Improved algorithms for constructing consensus trees
• Improved Algorithms for Constructing Consensus Trees
• A coding algorithm for Rényi trees
• scientific article; zbMATH DE number 1926670
• scientific article; zbMATH DE number 743588

zbMATH Keywords

randomized algorithmsfault tolerancecombinatorial problems

Mathematics Subject Classification ID

Randomized algorithms (68W20) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Coding for interactive communication
• A coding theorem for distributed computation
• Deterministic coding for interactive communication

Cited In (6)

• Efficient error-correcting codes for sliding windows
• Linear tree codes and the problem of explicit constructions
• Title not available (Why is that?)
• Counting linear extension majority cycles in partially ordered sets on up to 13 elements
• Sparse MDS matrices over small fields: a proof of the GM-MDS conjecture
• A New Coding Algorithm for Trees

This page was built for publication: An improvement of the tree code construction

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