An HARQ Based Optimized Error Correction Technique

International Journal of Computer Applications
© 2010 by IJCA Journal
Number 1 - Article 1
Year of Publication: 2010
Kaustuv Kunal
R. C. Tripathi
Vrijendra Singh

Kaustuv Kunal, R C Tripathi and Vrijendra Singh. Article:An HARQ Based Optimized Error Correction Technique. International Journal of Computer Applications 9(1):1–5, November 2010. Published By Foundation of Computer Science. BibTeX

	author = {Kaustuv Kunal and R. C. Tripathi and Vrijendra Singh},
	title = {Article:An HARQ Based Optimized Error Correction Technique},
	journal = {International Journal of Computer Applications},
	year = {2010},
	volume = {9},
	number = {1},
	pages = {1--5},
	month = {November},
	note = {Published By Foundation of Computer Science}


Errors during data communication are inevitable. Noise in the channel leads to bit error. The paper proposes a matrix based novel bits encoding technique, aim to achieve error correction capability with optimize redundancy. Furthermore an efficient software based decoding algorithm to detect and correct transmission errors is introduced. Here errors include single bit error, multiple bits error and burst errors. The proposed technique maintains high code rate, provides multiple bit error correction capability and can best be implemented as hybrid automatic repeat request (HARQ).


  • R.W. Hamming,” Error correction and error detection coding, “Bell System technical journal, Vol XXIX, No.2, April 1950.
  • Peter Elias,” Error Free coding,” IRE Professional Group on Information Theory, 1954
  • Peterson W,”Encoding and Error-Correction Procedures for the Bose-Chaudhuri Codes,” IRE Transactions on information theory, Volume: 6, Issue: 4, 1960.
  • J Cho, W Sung,”Efficient Software-Based Encoding and Decoding of BCH Codes” IEEE Transactions on Computers, 2009.
  • EH Lu, T Chang,” New decoder for double-error-correcting binary BCH codes,” IEEE Proceedings-Communications, Vol. 143, No. 3, June 1996.
  • Ben Cooke, “Reed-Muller Error Correcting Codes,” MIT Undergraduate Journal of Mathematics, pp. 21-26, 1999.
  • P Gopalan, AR Klivans, D Zuckerman, “List-decoding reed-muller codes over small fields” Proceedings of the 40th annual ACM symposium on Theory of computing, 2008.
  • R Gallager, “Low density parity check codes,” IRE Transactions on Information Theory, 1962.
  • Casado, A.I.V, Wen-yen Weng, Valle, S, Wesel R, “Multiple-rate low-density parity-check codes with constant blocklength”, IEEE Transactions on Communications, Volume: 57, 2009.
  • Kaufman, A Wigderson, “Symmetric LDPC codes and local testing” Proceedings of ICS, 2010.
  • S. Adrian Barbulescu, Steven S. Pietrobon, “Turbo Codes: a tutorial on a new class of powerful error correcting coding schemes Part- I,” Journal of Electrical and Electronics Engineering, Australia, 19(3):129–152, Sept. 1999.
  • Louay Bazzi , Mohammad Mahdian ,Daniel A. Spielman,” The Minimum Distance of Turbo-Like Codes” IEEE Transactions on Communications, volume 57 , Issue 5, May 2009.
  • Shu Lin, Philip S. Yu,” A Hybrid ARQ Scheme with Parity Retransmission for Error Control of Satellite Channels,” IEEE Transactions on Communications, Vol. Com-30, NO. I, July 1982.
  • Jianming Wu, Jinyin Xue, and Tomohiko Taniguchi, “A Novel HARQ Using Grouping and Encoding Technique” IEEE 70th Vehicular Technology Conference, Fall 2009.
  • U. K. Kumar, and B. S. Umashankar,”Improved Hamming Code for Error Detection and Correction,” 2nd International Symposium on Wireless Pervasive Computing, 2007.
  • A J Viterbi, “Convolutional Codes and Their Performance in Communication Systems,” IEEE Transactions on Communications, 1971.
  • Norman Matloff, “Cyclic Redundancy Checking,”2001.