A geometric approach to dynamic network coding
Author:
- 1 October 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 207-211
Abstract
Subspace coding over linear network channels assuming incoherent transmission allows independent design of channel and network codes. Joint design however would be desirable for dynamic network conditions. In this work a geometrical approach (in the Kleinian sense) to dynamic network coding is presented. The approach consists of capturing the communication process with group actions. Specifically, codes are chosen as geometries: homogeneous spaces obtained from group actions carry the information and the dynamic network code is the stabilizer of the action. The approach subsumes other approaches and provides natural adaptive encoding and decoding schemes with linear algebra tractability over different communication ambient spaces. The algebraic object called flag is proposed to encode information while the dynamic network coding is specified by its stabilizer (Borel group) showing the interplay between the flag, the channel impairing the flag and the network code stabilizing the flag. Ergodic capacity achievability is discussed.Keywords
This publication has 11 references indexed in Scilit:
- Arithmetic geometry of compute and forward2014
- Advanced Linear Algebra2014
- Cyclic Orbit CodesIEEE Transactions on Information Theory, 2013
- Communication Over Finite-Field Matrix ChannelsIEEE Transactions on Information Theory, 2010
- Algebra: Chapter 02009
- A Rank-Metric Approach to Error Control in Random Network CodingIEEE Transactions on Information Theory, 2008
- Coding for Errors and Erasures in Random Network Coding2007
- On the optimality of group network codes2005
- The benefits of coding over routing in a randomized setting2003
- A comparative review of recent researches in geometryBulletin of the American Mathematical Society, 1893