Finite Frame as Code: Some Characterizations for Error Correction Codes and Three Algorithms for Troubleshooting in Data Transfer

Document Type : Original Article

Authors

yazd university

Abstract

"Linear codes in coding theory need matrices whose rows form a basis for a finite dimensional space. In this paper, after introducing some preliminaries about frames, we state the idea of using finite frames    instead of basis for encoding of information and then we introduce some frames which their related linear codes are useful in finding and correcting errors in data transfer. A number of methods for producing    examples of such frames are presented using some well-known frame types and we show specifically that the families of frames which have been considered in some papers can be extended. Finally, we modify the idea of encoding to facilitate the use of approximate and generalized duals for decoding of received information. Also, some algorithms for decoding of frame coefficients with erasures are proposed.
 

Keywords

References

[1]     M. Hadi and M. R. Pakravan, “Sequential decoding algorithms of convolutional codes: Implementation, improvement and comparison,” Journal of Electronical & Cyber Defence, vol. 3, no. 2, pp. 61-73, 2017. (in Persian)##
[2]     M. Kenerkouhi and H. Tavakoli, “A new method for combining the channel coding with polar coding-based encryption,” Journal of Electronical & Cyber Defence, vol. 4, no. 1, pp. 1-8, 2016. (in Persian)##
[3]     R. Mceliece, “The theory of information and coding,” Cambridge University Press, 2002.##
[4]     A. Nourazar, Z. Noroozi, and M. Mir, “An optimal method for images steganography based on linear codes features,” Journal of Electronical & Cyber Defence, vol. 5, no. 4, pp.  43-53, 2017. (in Persian)##
[5]     B.G. Bodmann and V. I. Paulsen, “Frames, graphs and erasures,” Linear Algebra Appl.vol404, pp. 118-146, 2005.##
[6]     P. G. Casazza, “The art of frames theory,” Taiwanese J. Math., vol. 4, pp. 129-201, 2005.##
[7]     O. Christensen, “An Introduction to Frames and Riesz Bases,” second edition, Brikhauser, Boston, 2016.##
[8]     H. Javanshiri, “Some properties of approximately dual frames,” Results Math, vol. 70, pp.  475-485, 2016.##
[9]     M. A. Dehghan and M. A. H. Fard, “G-dual frames in Hilbert spaces,” UPB Sci. Bull., Series A,vol. 75, no. 1, pp. 129-140, 2013.##
[10]  D. Hanand and W. Sun, “Reconstruction of signals from frame coefficients with erasures at unknown locations,” IEEE Trans. Inf. Theory, vol. 60, pp. 4013-4025, 2014.##
 [11]  D. Han, F. Lv, and W. Sun, “Recovery of signals from unordered partial frame coefficients,” Appl. Comput. Harm. Anal., vol. 44, pp. 38-58, 2018.##
[12]  R. Holmes and V. I. Paulsen, “Optimal frames for erasures,” Linear Algebra Appl., vol. 394, pp. 31-51, 2004.##
[13]  D. Kalra, “Complex equiangular cyclic frames and erasures,” Linear Algebra Appl, vol. 419, pp. 373-399, 2006.##
[14]  F. Lv and W. Sun, “Construction of robust frames in erasure recovery,” Linear Algebra Appl., vol. 479, pp. 155-170, 2015.##
[15]  G. J. Murphy, C*-algebra, and Operator Theory, Academic Press, London, 1990.##
[16]  M. Mardanpour, M. A. Zare Chahooki, and H. Javanshiri, “Comparative analysis of effectiveness of extended wavelet transforms  on transparency and robustness of image watermarking based on matrix factorization,” Machine Vision and Image Processing (MVIP), vol. 4, no. 1, pp. 71-87, 2017. (in Persian)##

Files

History

  • Receive Date: 10 March 2018
  • Accept Date: 27 May 2018
  • Publish Date: 22 June 2019

Share

How to cite

Statistics