Strong Coordination over Noisy Channels with Strictly Causal Encoding
| Autor: | Giulia Cervia, Matthieu R. Blochz, Maël Le Treust, Laura Luzzi |
|---|---|
| Přispěvatelé: | Cervia, Giulia, Equipes Traitement de l'Information et Systèmes (ETIS - UMR 8051), Ecole Nationale Supérieure de l'Electronique et de ses Applications (ENSEA)-Centre National de la Recherche Scientifique (CNRS)-CY Cergy Paris Université (CY), School of Electrical and Computer Engineering - Georgia Insitute of Technology (ECE GeorgiaTech), Georgia Institute of Technology [Atlanta], Georgia Tech Lorraine [Metz], Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Ecole Supérieure d'Electricité - SUPELEC (FRANCE)-Georgia Institute of Technology [Atlanta]-CentraleSupélec-Ecole Nationale Supérieure des Arts et Metiers Metz-Centre National de la Recherche Scientifique (CNRS) |
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
FOS: Computer and information sciences
Noise measurement Computer science Decoding Computer Science - Information Theory Markov process 02 engineering and technology Topology [SPI]Engineering Sciences [physics] symbols.namesake [MATH.MATH-IT] Mathematics [math]/Information Theory [math.IT] Encoding (memory) Memoryless systems 0202 electrical engineering electronic engineering information engineering Markov processes Information Theory (cs.IT) [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT] 020206 networking & telecommunications Telecommunications network Communication networks Encoding symbols Polar Inner bound Decoding methods Communication channel |
| Zdroj: | Allerton 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Oct 2018, Monticello, United States. IEEE, pp.519-526, 2018, ⟨10.1109/ALLERTON.2018.8635991⟩ |
| DOI: | 10.1109/ALLERTON.2018.8635991⟩ |
| Popis: | We consider a network of two nodes separated by a noisy channel, in which the input and output signals have to be coordinated with the source and its reconstruction. In the case of strictly causal encoding and non-causal decoding, we prove inner and outer bounds for the strong coordination region and show that the inner bound is achievable with polar codes. 10 pages, 3 figures, conference paper |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|