On achievability of linear source coding over finite rings

We propose using linear mappings over finite rings as encoders in the Slepian-Wolf and the source coding for computing problems. It is known that the arithmetic of many finite rings is substantially easier to implement than the one of finite fields. Hence, one of the advantages of using linear mappi...

Full description

Bibliographic Details

Published in:	Proceedings / IEEE International Symposium on Information Theory pp. 1984 - 1988
Main Authors:	Sheng Huang, Skoglund, Mikael
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.07.2013
Subjects:	Context Decoding Polynomials Random variables Source coding
ISSN:	2157-8095
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!