Simple Systematic Pearson Coding

Jos Weber; Theo Swart; KA Schouhamer Immink

doi:10.1109/ISIT.2016.7541326

Simple Systematic Pearson Coding

Jos Weber, Theo Swart, KA Schouhamer Immink

Cyber Security

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

10 Citations (Scopus)

38 Downloads (Pure)

Abstract

The recently proposed Pearson codes offer immunity against channel gain and offset mismatch. These codes have very low redundancy, but efficient coding procedures were lacking. In this paper, systematic Pearson coding schemes are presented. The redundancy of these schemes is analyzed for memoryless uniform sources. It is concluded that simple coding can be established at only a modest rate loss.

Original language	English
Title of host publication	Proceedings ISIT 2016
Subtitle of host publication	2016 IEEE International Symposium on Information Theory
Publisher	IEEE
Pages	385-389
Number of pages	5
ISBN (Electronic)	978-1-5090-1806-2
DOIs	https://doi.org/10.1109/ISIT.2016.7541326
Publication status	Published - 2016
Event	2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain Duration: 10 Jul 2016 → 15 Jul 2016

Conference

Conference	2016 IEEE International Symposium on Information Theory, ISIT 2016
Abbreviated title	ISIT 2016
Country/Territory	Spain
City	Barcelona
Period	10/07/16 → 15/07/16

Bibliographical note

Accepted Author Manuscript

Keywords

Redundancy
Encoding
Detectors
Systematics
Art
Euclidean distance

Access to Document

10.1109/ISIT.2016.7541326

8958213 - ISIT2016 Systematic PearsonAccepted author manuscript, 113 KB

Cite this

@inproceedings{08eabe4420914579aacb8c237b8a474f,

title = "Simple Systematic Pearson Coding",

abstract = "The recently proposed Pearson codes offer immunity against channel gain and offset mismatch. These codes have very low redundancy, but efficient coding procedures were lacking. In this paper, systematic Pearson coding schemes are presented. The redundancy of these schemes is analyzed for memoryless uniform sources. It is concluded that simple coding can be established at only a modest rate loss.",

keywords = "Redundancy, Encoding, Detectors, Systematics, Art, Euclidean distance",

author = "Jos Weber and Theo Swart and {Schouhamer Immink}, KA",

note = "Accepted Author Manuscript; 2016 IEEE International Symposium on Information Theory, ISIT 2016, ISIT 2016 ; Conference date: 10-07-2016 Through 15-07-2016",

year = "2016",

doi = "10.1109/ISIT.2016.7541326",

language = "English",

pages = "385--389",

booktitle = "Proceedings ISIT 2016",

publisher = "IEEE",

address = "United States",

}

TY - GEN

T1 - Simple Systematic Pearson Coding

AU - Weber, Jos

AU - Swart, Theo

AU - Schouhamer Immink, KA

N1 - Accepted Author Manuscript

PY - 2016

Y1 - 2016

N2 - The recently proposed Pearson codes offer immunity against channel gain and offset mismatch. These codes have very low redundancy, but efficient coding procedures were lacking. In this paper, systematic Pearson coding schemes are presented. The redundancy of these schemes is analyzed for memoryless uniform sources. It is concluded that simple coding can be established at only a modest rate loss.

AB - The recently proposed Pearson codes offer immunity against channel gain and offset mismatch. These codes have very low redundancy, but efficient coding procedures were lacking. In this paper, systematic Pearson coding schemes are presented. The redundancy of these schemes is analyzed for memoryless uniform sources. It is concluded that simple coding can be established at only a modest rate loss.

KW - Redundancy

KW - Encoding

KW - Detectors

KW - Systematics

KW - Art

KW - Euclidean distance

UR - http://resolver.tudelft.nl/uuid:08eabe44-2091-4579-aacb-8c237b8a474f

U2 - 10.1109/ISIT.2016.7541326

DO - 10.1109/ISIT.2016.7541326

M3 - Conference contribution

SP - 385

EP - 389

BT - Proceedings ISIT 2016

PB - IEEE

T2 - 2016 IEEE International Symposium on Information Theory, ISIT 2016

Y2 - 10 July 2016 through 15 July 2016

ER -

Simple Systematic Pearson Coding

Abstract

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this