Error-Correction Coding of QR Code Based on Guruswami–Sudan Algorithm

[1]  Eric Jui-Lin Lu,et al.  Secret Hiding Mechanism Using QR Barcode , 2013, 2013 International Conference on Signal-Image Technology & Internet-Based Systems.

[2]  Luciano Bononi,et al.  A Collaborative Internet of Things Architecture for Smart Cities and Environmental Monitoring , 2018, IEEE Internet of Things Journal.

[3]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[4]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[5]  E. Graeme Chester,et al.  Performance of Reed-Solomon codes using the Guruswami-Sudan algorithm with improved interpolation efficiency , 2007, IET Commun..

[6]  Trieu-Kien Truong,et al.  An efficient Euclidean algorithm for Reed-Solomon code to correct both errors and erasures , 2003, 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) (Cat. No.03CH37490).

[7]  Min-Chun Hu,et al.  Efficient QR Code Beautification With High Quality Visual Content , 2015, IEEE Transactions on Multimedia.

[8]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .