Difference Equations and Sbec Optimal Codes

Volume 7, Issue 4, pp 258-265 http://dx.doi.org/10.22436/jmcs.07.04.04

Download PDF

Download XML

• Export citations
  • CITATIONS & REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • ARTICLE CITATION
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)

• 1724 Downloads
• 2840 Views

Authors

P. K. Das - Department of Mathematics, Shivaji College (University of Delhi), Raja Garden, Delhi-110027, India.

Abstract

This paper studies the patterns of the solutions of an equation on bounds for one kind of optimal codes that corrects all solid bursts of length b or less and no others. Difference equations that are satisfied by the solutions (namely the parameters-the code length and information digits of such codes) are obtained.

Share and Cite

Keywords

• Parity check digits
• bounds
• solid burst error
• optimal codes
• difference equation.

MSC

•  39A99
•  94B65
•  94B25

References

• [1] J. Arlat, W. C. Carter, Implementation and Evaluation of a (b, k)-Adjacent Error Correcting / Detecting Scheme for Supercomputer Systems, IBM J. RES. DEVELOP., 28(2) (1984), 159-169
  • View Article
  • Google Scholar


• [2] P. K. Das, Codes Detecting and Correcting Solid Burst Errors, Bulletin of Electrical Engineering and Informatics, 1(3) (2012), 225-232
  • View Article
  • Google Scholar


• [3] P. Dass, L. Berardi, B. K. Dass, Difference equations and Rao-Hamming bound, Journal of Interdisciplinary Mathematics, 9(2) (2006), 397-403
  • View Article
  • MathSciNet
  • Google Scholar
  • MATH


• [4] M. J. E. Golay, Notes on digital coding, Proc. IRE, 37 (1949), 657
  • Google Scholar


• [5] R. W. Hamming, Error-detecting and error-correcting codes, Bell System Technical Journal, 29 (1950), 147-160
  • View Article
  • Google Scholar


• [6] D. W. Jensen, Block code to efficiently correct adjacent data and/or check bit errors, Patent no: US 6604222 B1, Date of Patent Aug 5, (www.google.com/patents/US6604222) (2003)
  • Google Scholar


• [7] R. Kazemi, S. Delavar, The Moments of the Profile in Random Binary Digital Trees, Journal of mathematics and computer science, 6(3) (2013), 176-190
  • Google Scholar


• [8] W. W. Peterson, E. J. Weldon(Jr), Error-Correcting Codes, 2nd edition, The MIT Press, Mass (1972)
  • Google Scholar


• [9] B. D. Sharma, B. K. Dass, Adjacent error correcting binary perfect codes, J. Cybernetics, 7 (1977), 9-13
  • View Article
  • Google Scholar
  • MATH


• [10] A. Tietavainen, On the nonexistence of perfect codes over finite fields, SIAM J. Appl. Math., 24 (1973), 88-96
  • View Article
  • Google Scholar


• [11] J. H. van Lint, A survey of perfect codes , Rocky Mountain J. Math., 5 (1975), 199-226
  • View Article
  • MathSciNet
  • Google Scholar