Coding for Relaying and Networks
Coding for relaying and networks refers to methods and algorithms that network nodes use to process symbol streams so as to optimize communication efficiency, reliability, and security. The focus here is on code structure. The term "structure" is not meant to preclude randomization but it does require that a software implementation of the encoders and decoders is feasible so that one may run performance simulations.
For example, consider an analog (network or relay) coding strategy where a source node uses a turbo code, a relay node transmits a scaled version of its received symbols, and a destination node uses an iterative (turbo) decoder. One can implement this system in software, compute bit and block error rates, and compare the performance to information-theoretic limits. As a second example, consider a digital (network or relay) coding strategy where the relay digitizes its symbols using a trellis-coded vector quantizer (TCVQ) and encodes the quantization bits using a convolutional low-density parity-check (C-LDPC) code. One can again implement the system in software and compute bit and block error rates, although this will be more difficult than for the analog coding strategy.
- Network Coding for Distributed Storage Systems (Hannes Bartz)
- Detection and Adaptive Transmission for MIMO-OFDM (Ronald Böhnke)
- Network and Channel Coding for Wireless Relay Networks (Onurcan İşcan)
- Optimal Relay Positioning (Mohit Thakur)
- Network Coding and flow optimization (Mohit Thakur)