An improvement of the tree code construction
From MaRDI portal
Publication:845688
DOI10.1016/j.ipl.2006.03.007zbMath1184.68624OpenAlexW2031579086MaRDI QIDQ845688
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
Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20)
Related Items (5)
Interactive communication with unknown noise rate ⋮ Linear tree codes and the problem of explicit constructions ⋮ Efficient Error-Correcting Codes for Sliding Windows ⋮ 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
Cites Work
This page was built for publication: An improvement of the tree code construction
