On matrices potentially useful for tree codes

DOI10.1016/j.ipl.2021.106180OpenAlexW3187884296MaRDI QIDQ2059875

Pavel Pudlák

Publication date: 14 December 2021

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

Full work available at URL: https://arxiv.org/abs/2012.03013

zbMATH Keywords

finite fieldtree codetheory of computationmatrixsingleton bound

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Linear tree codes and the problem of explicit constructions
• Explicit binary tree codes with polylogarithmic size alphabet

This page was built for publication: On matrices potentially useful for tree codes