Pankaj Kumar Das
Department of Mathematical Sciences, Tezpur University, Napaam, Sonitpur, Assam-784028, India.

Subodh Kumar
Shyam Lal College, University of Delhi, G. T. Road Shahdara, Delhi-110032, India.

DOI https://doi.org/10.33889/IJMEMS.2020.5.6.092

  ;

Abstract

To protect the information from disturbances created by noisy channels, redundant symbols (check symbols) with the information symbols are added. These extra symbols play important role for the efficiency of the communication system. It is always important to know how much these check symbols are required for a code designed for a specific purpose. In this communication, we give lower and upper bounds on check symbols needed to a linear code correcting key errors of length upto p which are confined to a single sub-block. We provide two examples of such linear codes. We, further, obtain those bounds for the case when key error occurs in the whole code length, but the number of disturbing components within key error is upto a certain number. Two examples in this case also are provided.

Keywords- Parity check matrix, Syndromes, Bounds, Key errors.

Citation

Das, P. K., & Kumar, S. (2020). Blockwise and Low Density Key Error Correcting Codes. International Journal of Mathematical, Engineering and Management Sciences, 5(6), 1234-1248. https://doi.org/10.33889/IJMEMS.2020.5.6.092.