Network coding with modular lattices

DOI10.1142/S0219498811005208MaRDI QIDQ3117930zbMATH OpenOpenAlexFDO

Authors Andreas Kendziorra, Stefan E. Schmidt

Publication date 1 March 2012

Published in Journal of Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1009.0682

zbMATH Keywords

bounds on codesmodular latticesnetwork coding

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Modular lattices, Desarguesian lattices (06C05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29) Bounds on codes (94B65)

Abstract: 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 �igcap 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 �igvee y) - h(x �igwedge 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

Recommendations

• On lattices, binary codes, and network codes
• Network codes
• Algebraic codes for network coding
• Coding for Errors and Erasures in Random Network Coding
• Codes, compositions and lattices

Cites work

• A linear construction for certain Kerdock and Preparata codes
• A Random Linear Network Coding Approach to Multicast
• Coding for Errors and Erasures in Random Network Coding
• Linear authentication codes: bounds and constructions
• Network information flow
• Quaternary constructions for the binary single-error-correcting codes of Julin, Best and others
• Representations of primary Arguesian lattices

Cited in

(6)

• Induced weights on quotient modules and an application to error correction in coherent networks
• Harder-Narasimhan theory for linear codes (with an appendix on Riemann-Roch theory)
• On lattices, binary codes, and network codes
• Codes, compositions and lattices
• Conditions for the existence of spreads in projective Hjelmslev spaces
• Vector multispaces and multispace codes

This page was built for publication: Network coding with modular lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3117930)