On Linear Coding over Finite Rings and Applications to Computing

This paper presents a coding theorem for linear coding over finite rings, in the setting of the Slepian–Wolf source coding problem. This theorem covers corresponding achievability theorems of Elias (IRE Conv. Rec. 1955, 3, 37–46) and Csiszár (IEEE Trans. Inf. Theory 1982, 28, 585–592) for linear cod...

Full description

Bibliographic Details

Published in:	Entropy (Basel, Switzerland) Vol. 19; no. 5; p. 233
Main Authors:	Huang, Sheng, Skoglund, Mikael
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 20.05.2017
Subjects:	Coders Codes Coding Correlation Data compression Discrete functions Field Linear coding Mathematical analysis Optimization Recovering Ring Source coding Source coding for computing Theorems
ISSN:	1099-4300, 1099-4300
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!