SYSTEMATIC ASYMMETRIC 1-ERROR- CORRECTING CODES AND ITS APPLICATION WITH ALPHABETS
Main Article Content
Keywords
Abstract
A new Correcting codes with single Asymmetric-error are presented. Hamming Codes are optimal systematic single error correcting codes. When a few information words are used, two different construction procedure of 1-error correcting codes with systematic Asymmetric cases when, n= 2r or 2r +1, where r ≥ 4 are described. An important application of systematic single asymmetric error-correcting code is also discussed which may be very useful in computer codes.
Downloads
References
1. Bose, B and Al Bassam , On Systematic Single Asymmetric Error Correcting Code. IEEE Trans. Information Theory, VOL 46, n0. 2, 669-672 (2000). 2. S. Al-Bassam, R. Venkatesan and S. Al-Muhammadi, "New single asymmetric error correcting codes", IEEE Trans. Inform. Theory, vol. 43, pp. 1619-1623, Sept. 1997. 3. K. Abdel-Ghaffar and H. Ferreira, "Systematic encoding of the Varshamov-Tenengol'ts codes and the Constantin -Rao codes", IEEE Trans. Inform. Theory, vol. 43, pp. 340-354, Jan. 1997. 4. J. M. Berger, "A note on error detecting codes for asymmetric channels", Inform. Contr., vol. 4, pp. 68-73, Mar. 1961. 5. J. M. Borden, "Optimal asymmetric error detecting codes", Inform. Contr., vol. 53, pp. 66-73, Apr. 1982. 6. B. Bose and D. Lin, "Systematic unidirectional error detecting codes", IEEE Trans. Comput., vol. C-34, pp. 1026-1032, Nov. 1985. 7. S. D. Constantin and T. R. N. Rao, "On the theory of binary asymmetric error-correcting codes", Inform. Contr., vol. 40, pp. 20-36, Jan. 1979. 8. C. V. Freeman, "Optimal error detection codes for completely asymmetric binary channels", Inform. Contr., vol. 5, pp. 64-71, Mar. 1962 9. T. Kløve, "Upper bounds on codes correcting asymmetric errors", IEEE Trans. Inform. Theory, vol. IT-27, pp. 128-131, Jan. 1981. 10. J. E. Smith, "On separable unordered codes", IEEE Trans. Comput., vol. C-33, pp. 741-743, Aug. 1984. 11. R. R. Varshamov, "A class of codes for asymmetric channels and a problem from the additive theory of numbers", IEEE Trans. Inform. Theory, vol. IT-19, pp. 92-95, Jan. 1973. 12. J. Weber, C. De Vroedt and D. Boekee, " Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than \$6\$ ", IEEE Trans. Inform. Theory, vol. 34, pp. 1321-1331, Sept. 1988.
Article Sidebar
Article Details
How to Cite
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by-nc/4.0) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Transfer of Copyright and Permission to Reproduce Parts of Published Papers.
Authors retain the copyright for their published work. No formal permission will be required to reproduce parts (tables or illustrations) of published papers, provided the source is quoted appropriately and reproduction has no commercial intent. Reproductions with commercial intent will require written permission and payment of royalties.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.