Sphere-Packing Bounds Revisited for Moderate Block Lengths
From MaRDI portal
Publication:3547743
Recommendations
- An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
- The sphere packing bound for memoryless channels
- Sphere-bound-achieving coset codes and multilevel coset codes
- Constructive spherical codes near the Shannon bound
- Lower bounds to error probability for coding on discrete memoryless channels. I
Cited in
(5)- The sphere packing bound for memoryless channels
- scientific article; zbMATH DE number 1515661 (Why is no real title available?)
- An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
- A simple derivation of the refined sphere packing bound under certain symmetry hypotheses
- An efficient solution space exploring and descent method for packing equal spheres in a sphere
This page was built for publication: Sphere-Packing Bounds Revisited for Moderate Block Lengths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547743)