Network coding with modular lattices

Details Network coding with modular lattices Network coding with modular lattices

2010-09-03

arxiv.org/abs/1009.0682v1

Computer Science

Information Theory

26 pages, 1 figure

Scientific paper

In [1], K\"otter and Kschischang presented a new model for error correcting codes in network coding. The alphabet in this model is the subspace lattice of a given vector space, a code is a subset of this lattice and the used metric on this alphabet is the map d: (U, V) \longmapsto dim(U + V) - dim(U \bigcap V). In this paper we generalize this model to arbitrary modular lattices, i.e. we consider codes, which are subsets of modular lattices. The used metric in this general case is the map d: (x, y) \longmapsto h(x \bigvee y) - h(x \bigwedge y), where h is the height function of the lattice. We apply this model to submodule lattices. Moreover, we show a method to compute the size of spheres in certain modular lattices and present a sphere packing bound, a sphere covering bound, and a singleton bound for codes, which are subsets of modular lattices. [1] R. K\"otter, F.R. Kschischang: Coding for errors and erasures in random network coding, IEEE Trans. Inf. Theory, Vol. 54, No. 8, 2008

Affiliated with

Also associated with

No associations

Rating

Network coding with modular lattices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Network coding with modular lattices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network coding with modular lattices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-684993