Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On matrices potentially useful for tree codes

From MaRDI portal
Publication:2059875
Jump to:navigation, search

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2059875&oldid=14539653"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 20:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki