Algorithms of constructing linear and robust codes based on wavelet decomposition and its application

11Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This article presents the algorithms of constructing error detecting codes using wavelet decomposition. Linear code, presented in the paper, based on the coefficients of scaling function of wavelet transformation. Constructed linear code was used for creation of robust codes that have a smaller number of undetectable errors and have an ability to detect any error with a predetermined probability. Robust codes are generated by applying a nonlinear function to the redundancy part of the linear code. The article describes comparative characteristics between the proposed wavelet code constructions and other error detecting codes. The paper proposes two constructions of robust code, first robust code base on the multiplicative inverse in a finite field, redundancy part of second code construction build as a cube in the field of the information component. The paper describes a model of application proposed code constructions in ADV612 system. Characteristics of robustness of the described model for uniform and nonuniform codeword distribution are also presented in the paper.

Cite

CITATION STYLE

APA

Levina, A., & Taranov, S. (2015). Algorithms of constructing linear and robust codes based on wavelet decomposition and its application. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9084, pp. 247–258). Springer Verlag. https://doi.org/10.1007/978-3-319-18681-8_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free