On lattices, binary codes, and network codes
Michael Braun
Advances in Mathematics of Communications 2011, 5(2): 225-232 doi: 10.3934/amc.2011.5.225
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: posets complementary spaces. lattices metric spaces Binary codes network codes

Year of publication

Related Authors

Related Keywords

[Back to Top]