On lattices, binary codes, and network codes
Author:
Open Access
- 1 January 2011
- journal article
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 5 (2) , 225-232
Abstract
Network codes are sets of subspaces of a finite vectorspace over a finite field. Recently, this class of codes has found application in the error correction of message transmission within networks. Furthermore, binary codes can be represented as sets of subsets of a finite set. Hence, both kinds of codes can be regarded as substructures of lattices — in the first case it is the linear lattice and in the second case it is the power set lattice. This observation leads us to a more general investigation of similarities of both theories by means of lattice theory. In this paper we first examine general results of lattices in order to comprise basic considerations of network coding and binary vector coding theory. Afterwards we consider the issue of finding complements of subspaces.Keywords
This publication has 2 references indexed in Scilit:
- Coding for Errors and Erasures in Random Network CodingIEEE Transactions on Information Theory, 2008
- Error-Correcting Codes in Projective Space2008