arrow
返回

Using cantor sets for error detection

delete2019-01-14
delete2
delete
OA
AI
N
Nithin Nagaraj *
DOI:10.7717/peerj-cs.171delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Error detection is a fundamental need in most computer networks and communication systems in order to combat the effect of noise. Error detection techniques have also been incorporated with lossless data compression algorithms for transmission across communication networks. In this paper, we propose to incorporate a novel error detection scheme into a Shannon optimal lossless data compression algorithm known as Generalized Luroth Series (GLS) coding. GLS-coding is a generalization of the popular Arithmetic Coding which is an integral part of the JPEG2000 standard for still image compression. GLS-coding encodes the input message as a symbolic sequence on an appropriate 1D chaotic map Generalized Luroth Series (GLS) and the compressed file is obtained as the initial value by iterating backwards on the map. However, in the presence of noise, even small errors in the compressed file leads to catastrophic decoding errors owing to sensitive dependence on initial values, the hallmark of deterministic chaos. In this paper, we first show that repetition codes, the oldest and the most basic error correction and detection codes in literature, actually lie on a Cantor set with a fractal dimension of 1/n, which is also the rate of the code. Inspired by this, we incorporate error detection capability to GLS-coding by ensuring that the compressed file (initial value on the chaotic map) lies on a Cantor set. Even a 1-bit error in the initial value will throw it outside the Cantor set, which can be detected while decoding. The rate of the code can be adjusted by the fractal dimension of the Cantor set, thereby controlling the error detection performance.
Keyword:
Error detection
Error control coding
Cantor sets
Shannon entropy
Arithmetic coding
Repetition codes
GLS-coding
Chaos
Lossless data compression
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

PeerJ Computer Science 封面图
PeerJ Computer Science
IF:
2.5
论文数:
3.4K
被引数:
6.9K

机构

暂无机构信息
引用论文

引用论文

Arithmetic coding as a non-linear dynamical system
err2009-04-01
err37
errOAAI
errNagaraj, Nithin; Vaidya, Prabhakar G.; Bhat, Kishor G.
err分享
err收藏
Variable Dimerization of the Ly49A Natural Killer Cell Receptor Results in Differential Engagement of its MHC Class I Ligand
err2006-09-01
err0
PREAI
errJulie Dam; James Baber; Alexander Grishaev; Emilio L. Malchiodi; Peter Schuck; Ad Bax; Roy A. Mariuzza
err分享
err收藏
err分享
err收藏
Multiscale processes controlling niobium mobility during supergene weathering
err2023-07-01
err0
errOAAI
errQuentin Bollaert; Mathieu Chassé; Thierry Allard; Alexandra Courtin; Laurence Galoisy; Gautier Landrot; Cécile Quantin; Delphine Vantelon; Georges Calas
err分享
err收藏
err分享
err收藏
Joint source/channel coding using arithmetic codes
err2001-05-01
err40
PREAI
errPettijohn, BD; Hoffman, MW; Sayood, K
err分享
err收藏
学者 查看更多内容