Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On achievability of linear source coding over finite rings
KTH, School of Electrical Engineering (EES), Communication Theory.
KTH, School of Electrical Engineering (EES), Communication Theory.ORCID iD: 0000-0002-7926-5081
2013 (English)In: IEEE International Symposium on Information Theory: Proceedings, IEEE conference proceedings, 2013, 1984-1988 p.Conference paper, Published paper (Refereed)
Abstract [en]

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 mappings over rings, instead of its field counterparts, is reducing implementation complexity. More importantly, the ring version dominates the field version in terms of achieving strictly better coding rates with strictly smaller alphabet size in the source coding for computing problem [1]. This paper is dedicated to proving an achievability theorem of linear source coding over finite rings in the Slepian-Wolf problem. This result includes those given by Elias [2] and Csiszár [3] saying that linear coding over finite fields is optimal, i.e. achieves the Slepian-Wolf region. Although the optimality issue remains open, it has been verified in various scenarios including particularly many cases use non-field rings [1], [4].

Place, publisher, year, edition, pages
IEEE conference proceedings, 2013. 1984-1988 p.
Series
IEEE International Symposium on Information Theory - Proceedings, ISSN 2157-8095
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-139141DOI: 10.1109/ISIT.2013.6620573ISI: 000348913402023Scopus ID: 2-s2.0-84890419066ISBN: 9781479904464 (print)OAI: oai:DiVA.org:kth-139141DiVA: diva2:684943
Conference
2013 IEEE International Symposium on Information Theory, ISIT 2013; Istanbul, Turkey, 7-12 July 2013
Note

QC 20140108

Available from: 2014-01-08 Created: 2014-01-07 Last updated: 2015-12-04Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Skoglund, Mikael

Search in DiVA

By author/editor
Huang, ShengSkoglund, Mikael
By organisation
Communication Theory
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 38 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf