Fountain Codes and Invertible Matrices

Simple item page
dc.creatorMalinen, Mikko
dc.date2009-03-26
dc.date.accessioned2026-07-07T12:57:02Z
dc.date.available2026-07-07T12:57:02Z
dc.descriptionThis paper deals with Fountain codes, and especially with their encoding matrices, which are required here to be invertible. A result is stated that an encoding matrix induces a permutation. Also, a result is that encoding matrices form a group with multiplication operation. An encoding is a transformation, which reduces the entropy of an initially high-entropy input vector. A special encoding matrix, with which the entropy reduction is more effective than with matrices created by the Ideal Soliton distribution is formed. Experimental results with entropy reduction are shown.
dc.description3 pages, 2 figures, submitted to the IEEE Transactions on Information Theory
dc.identifierhttps://arxiv.org/abs/0903.4554
dc.identifierhttp://arxiv.org/abs/0903.4554
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/224791
dc.subjectInformation Theory
dc.titleFountain Codes and Invertible Matrices
dc.typetext

Files

Collections

arXiv