Pages that link to "Item:Q2826052"
From MaRDI portal
The following pages link to Towards deterministic tree code constructions (Q2826052):
Displaying 17 items.
- An improvement of the tree code construction (Q845688) (← links)
- Linear tree codes and the problem of explicit constructions (Q898793) (← links)
- Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
- Interactive communication with unknown noise rate (Q1641020) (← links)
- Bit-optimal decoding of codes whose Tanner graphs are trees (Q1811114) (← links)
- Non-malleable codes for decision trees (Q2181859) (← links)
- Interactive Coding for Interactive Proofs (Q2799101) (← links)
- List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise (Q2968158) (← links)
- Tree-Based Encoding for Cancellations on Morse Complexes (Q3651625) (← links)
- Generating binary trees in A-order from codewords defined on a four-letter alphabet (Q4321109) (← links)
- Towards Optimal Deterministic Coding for Interactive Communication (Q4575719) (← links)
- Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions (Q5002754) (← links)
- Sparse MDS Matrices over Small Fields: A Proof of the GM-MDS Conjecture (Q5009787) (← links)
- Palette-alternating tree codes (Q5092459) (← links)
- Efficient Error-Correcting Codes for Sliding Windows (Q5220468) (← links)
- Fast Interactive Coding against Adversarial Noise (Q5501938) (← links)
- (Q6090912) (← links)