NETWORK CODING WITH MODULAR LATTICES

DOI10.1142/S0219498811005208zbMath1260.94034arXiv1009.0682OpenAlexW2964053870MaRDI QIDQ3117930

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

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

Related Items (1)

Conditions for the existence of spreads in projective Hjelmslev spaces

Cites Work

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

This page was built for publication: NETWORK CODING WITH MODULAR LATTICES