The Sphere Packing Bound for DSPCs With Feedback à la Augustin
| Autor: | Baris Nakiboglu |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
FOS: Computer and information sciences
Block code Discrete mathematics Computer science Hamming bound Computer Science - Information Theory Information Theory (cs.IT) 020206 networking & telecommunications 02 engineering and technology Computer Science::Computational Geometry 01 natural sciences Upper and lower bounds 010305 fluids & plasmas Channel capacity Product (mathematics) 0103 physical sciences 0202 electrical engineering electronic engineering information engineering Electrical and Electronic Engineering |
| Zdroj: | IEEE Transactions on Communications. 67:7456-7467 |
| ISSN: | 1558-0857 0090-6778 |
| DOI: | 10.1109/tcomm.2019.2931302 |
| Popis: | Establishing the sphere packing bound for block codes on the discrete stationary product channels with feedback ---which are commonly called the discrete memoryless channels with feedback--- was considered to be an open problem until recently, notwithstanding the proof sketch provided by Augustin in 1978. A complete proof following Augustin's proof sketch is presented, to demonstrate its adequacy and to draw attention to two novel ideas it employs. These novel ideas (i.e., the Augustin's averaging and the use of subblocks) are likely to be applicable in other communication problems for establishing impossibility results. Comment: 12 pages, 2 figures |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|