Pages that link to "Item:Q898793"
From MaRDI portal
The following pages link to Linear tree codes and the problem of explicit constructions (Q898793):
Displaying 6 items.
- Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
- Bit-optimal decoding of codes whose Tanner graphs are trees (Q1811114) (← links)
- On matrices potentially useful for tree codes (Q2059875) (← links)
- Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture (Q5009787) (← links)
- Palette-alternating tree codes (Q5092459) (← links)
- (Q6090912) (← links)