The Augustin center and the sphere packing bound for memoryless channels
| Autor: | Baris Nakiboglu |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Polynomial
Hamming bound Computer Science - Information Theory Regular polygon 020206 networking & telecommunications 02 engineering and technology Center (group theory) Computer Science::Computational Geometry Empirical distribution function Combinatorics 020303 mechanical engineering & transports Sphere packing 0203 mechanical engineering 0202 electrical engineering electronic engineering information engineering Decoding methods Computer Science::Information Theory Communication channel Mathematics |
| Zdroj: | ISIT |
| DOI: | 10.1109/isit.2017.8006759 |
| Popis: | For any channel with a convex constraint set and finite Augustin capacity, existence of a unique Augustin center and associated Erven-Harremoes bound are established. Augustin-Legendre capacity, center, and radius are introduced and proved to be equal to the corresponding Renyi-Gallager entities. Sphere packing bounds with polynomial prefactors are derived for codes on two families of channels: (possibly non-stationary) memoryless channels with multiple additive cost constraints and stationary memoryless channels with convex constraints on the empirical distribution of the input codewords. Comment: Accepted to ISIT 2017 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|