Error correcting codes for uncompressed messages
From MaRDI portal
Cites work
- A theory of goal-oriented communication
- Algorithmic Results in List Decoding
- Better Binary List Decodable Codes Via Multilevel Concatenation
- Communication with contextual uncertainty
- Communication With Imperfectly Shared Randomness
- Decoding of Reed Solomon codes beyond the error-correction bound
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- Deterministic compression with uncertain priors
- Epsilon-entropy of an ellipsoid in a Hamming space
- scientific article; zbMATH DE number 1759459 (Why is no real title available?)
- Local list recovery of high-rate tensor codes \& applications
- New hash functions and their use in authentication and set equality
- On the role of shared randomness in simultaneous communication
- Optimal rate code constructions for computationally simple channels
- The Capacity of Online (Causal) q -Ary Error-Erasure Channels
- The existence of binary linear concatenated codes with Reed - Solomon outer codes which asymptotically meet the Gilbert- Varshamov bound
- The Power of Shared Randomness in Uncertain Communication
This page was built for publication: Error correcting codes for uncompressed messages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229330)
