|
This article is cited in 10 scientific papers (total in 10 papers)
Construction of linear and robust codes based on wavelet decomposition
A. B. Levina, S. V. Taranov St. Petersburg National Research University of Information Technologies, Mechanics and Optics, 49 Kronverskii av., 197101 St. Petersburg
Abstract:
Today wavelet transform is used in many fields such as computer graphics, image and signal processing, speech recognition. We want to provide method for the wavelet transform application in coding theory. Wavelet analysis is a special type of linear transformation of the signals and the physical data; therefore, it is possible to construct a linear code based on wavelets. Using coefficients of the wavelet decomposition scaling functions, we can derive generator and check matrix for the linear code. Linear codes are standard approach used in the schemes of error detection and correction. Compared to other codes, linear codes allow the implementation of more efficient encoding and decoding algorithms of information. However, error protection scheme based on linear codes do not provide the uniform level of protection against any possible errors, and concentrates their detect ability to certain errors set. This relationship between linear code opportunities and error distribution can cause an error if mistake belongs to undetectable error set. To reduce the error masking probability, it is necessary that error distribution was uniform. This distribution provides by robust codes. Robust codes are a nonlinear code that does not depend on type and dimension of errors. We provide method for constructing robust codes based on wavelets. Also characteristics of the proposed codes compares with each other.
Keywords:
robust code, linear code, wavelet decomposition, scaling function, error masking probability.
Received: 25.11.2014 Revised: 23.03.3015
Citation:
A. B. Levina, S. V. Taranov, “Construction of linear and robust codes based on wavelet decomposition”, Sib. Zh. Ind. Mat., 18:3 (2015), 49–56; J. Appl. Industr. Math., 9:4 (2015), 540–546
Linking options:
https://www.mathnet.ru/eng/sjim893 https://www.mathnet.ru/eng/sjim/v18/i3/p49
|
|