Error estimates for low rate codes
From MaRDI portal
Recommendations
- Lower bounds to error probability for coding on discrete memoryless channels. I
- scientific article; zbMATH DE number 3242951
- A simple derivation of the coding theorem and some applications
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Good error-correcting codes based on very sparse matrices
Cites work
Cited in
(18)- Erasure correction by low-density codes
- New approach to estimation of the decoding error probability
- Properties of noncommutative Rényi and Augustin information
- The sphere packing bound for memoryless channels
- Diagnostische Vorgabeexperimente mit stochastischen Automaten. (Diagnosing preset experiments with stochastic automata)
- A class of measures of informativity of observation channels
- Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman-Vlăduţ-Zink bounds
- Variational Bayes and a problem of reliable communication. II: Infinite systems
- Error analysis and reduction in lossy TLM
- Estimation d'erreurs dans un problème de transmission
- Lower bounds on the code rate for a model of data transmission with side information
- Constructive codes for arbitrary discrete memoryless channels
- A simple derivation of the refined sphere packing bound under certain symmetry hypotheses
- scientific article; zbMATH DE number 3242951 (Why is no real title available?)
- scientific article; zbMATH DE number 3294106 (Why is no real title available?)
- Lower bounds to error probability for coding on discrete memoryless channels. I
- Average and reliability error exponents in low-density parity-check codes
- Variations on the Gallager bounds with some applications
This page was built for publication: Error estimates for low rate codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5604959)
