Research Article  Open Access
Pankaj Kumar Das, "Weight Distribution of Periodic Errors and Optimal/AntiOptimal Linear Codes", Journal of Mathematics, vol. 2014, Article ID 971410, 5 pages, 2014. https://doi.org/10.1155/2014/971410
Weight Distribution of Periodic Errors and Optimal/AntiOptimal Linear Codes
Abstract
The paper discusses weight distribution of periodic errors and then the optimal case on bounds of parity check digits for (, ) linear codes over that corrects all periodic errors of order in the first block of length and all periodic errors of order in the second block of length and no others. Further, we extend the study to the case when the errors are in the form of periodic errors of order (and ) or more in the two subblocks.
1. Introduction
In coding theory, many types of error patterns have been considered, and codes accordingly are constructed to combat such error patterns. Periodic errors are one type of error patterns that are found in channels like astrophotography [1], gyroscope and computed tomography [2]. Such error occurs due to happening of disturbances periodically. So, there is a need to study such errors and to develop codes dealing with such errors. It was in this spirit that codes detecting/correcting such errors were studied by Das and Tyagi [3, 4]. A periodic error of order is defined as follows.
Definition 1. A periodic error of order is a vector whose nonzero components are located at shifting positions in a code vector where and the number of its starting positions is among the first components.
For , the periodic errors of order 1 are the vectors where error may occur in 1st, 3rd, 5th, , positions or 2nd, 4th, 6th, …, positions. For example, in a vector of length 8, periodic errors of order 1 are of the type 10101000, 00101000, 0010101, 10101010, 10001010, 01010101, 01000101, 00000101, 00000001, and so forth.
For , the periodic errors of order 2 may look like 10010010, 10000010, 00010010, 01001001, 01000001, 01000000, 00001001, and so forth in a vector of length 8.
Perfect codes are the best codes among the linear codes since the parameters satisfy the SpherePacking (or Hamming) bound [5, 6]. It was a big challenge for mathematician to search for such codes for several years in the past. It was finally established that there are no perfect codes other than the single error correcting Hamming [5] codes, double and triple error correcting Golay codes [7], and the Repetitive codes (refer to Tietavainen [8], Tietavainen and Perko [9], and van Lint [10]).
By perfect codes we mean the linear codes that are capable of correcting all t or fewer errors and no others.
Thereafter several attempts were given to find codes that are not perfect in the usual sense but that correct certain type of error pattern and no more. Such codes are called optimal codes. Sharma and Dass [11] were the first who attempted to find such codes. In paper [12], Dass and Tyagi explored a new type of binary optimal codes. Similar kind of perfect codes is also studied in [13].
Further, mathematicians also started to find codes that are opposite in nature to perfect codes. Those codes are called antiperfect codes. In this direction, an attempt is given in paper [14] by Sharma et al. These codes correct all errors and more and no others.
In view of these studies, this paper presents linear optimal codes over that correct all periodic errors of order in the first block of length and all periodic errors of order in the second block of length and no others. Then the study has been extended to the case when the errors in the first block of length are in the form of order or more and the errors in the second block of length are in the form of order or more and no others. They are called antioptimal codes.
This paper also presents the weight structure of periodic errors in the space of tuples over . The study of weight structure for different types of error patterns is of considerable interest to many researchers. Various results are obtained in this direction (e.g., [15, 16]).
The paper is organized as follows. Section 1 is the introduction. In Section 2, we present minimum weight and weight structure of periodic errors in the space of tuples. In Section 3, we study optimal codes that correct all periodic errors of order in the first block of length and all periodic errors of order in the second block of length and no others. Section 4 presents the study of antioptimal codes mentioned above.
2. Weights of Periodic Errors
In coding theory, an important criterion is to look for minimum weight and structure of weight in a group of vectors. Our following theorems (which are equivalent to Plotkin bound [17], also Theorem 4.1, Peterson and Weldon [6]) are results in that direction. The weight of a vector is considered in Hamming’s sense.
Lemma 2. Let denote the total weight of all periodic errors of order in the space of all tuples over . Then, where ().
Proof. We first count the total number of periodic errors of order with weight in the space of all tuples.
Consider a periodic error of order . The number of positions in which periodic error of order can occur is where () and (refer to Tyagi and Das [4]). So, the total number of periodic errors of order with weight is given by
Then,
Theorem 3. The minimum weight of a periodic error of order in the space of tuples is at most where , .
Proof. The number of periodic errors of order in the space of tuples over is given by By using Lemma 2, the total weight of all periodic errors of order is given by Since the minimum weight element can have at most the average weight, an upper bound on the minimum weight of periodic errors of order is given by
During the process of transmission, periodic disturbances cause occurrence of periodic errors. But it is quite possible that all the periodic components in such periodic errors may not be affected; that is, some digits are received correctly while others get corrupted. In view of this, we have the following results for periodic errors with weight or less (without proof).
Lemma 4. Let denote the total weight of all periodic errors of order which are of weight or less in the space of all tuples. Then, where , .
Theorem 5. The minimum weight of a periodic error of order which is of weight or less in the space of tuples is at most where , .
3. Optimal Codes
Das [18] has studied the linear code over that corrects all periodic errors of order in the first block of length and all periodic errors of order in the second block of length as follows.
Theorem 6. The number of parity check digits for an linear code over that corrects all periodic errors of order in the first block of length and all periodic errors of order in the second block of length always satisfies where and ().
Considering the equality of inequality (10) gives us the optimal case; that is, where , , , .
We now give an example of a linear code over that corrects all periodic errors of order 2 in the first block of length 6 and all periodic errors of order 1 in the second block of length 4 and no other errors.
Example 7. By putting , , , and over , equality (11) gives rise to () linear code. Consider the following matrix: The code obtained from the above matrix as a parity check matrix is a () linear code. This code can correct all periodic errors of order 2 in the first block of length 6 and all periodic errors of order 1 in the second block of length 4 and no others. We list in Table 1 all the error vectors and their corresponding syndromes which can be seen to be all distinct and exhaustive.

4. AntiOptimal Codes
In this section, we will obtain bound on linear code over that corrects all periodic errors of order or more in the first block of length () and all periodic errors of order or more in the second block of length () and no other errors. Taking the bound tight, we obtain antioptimal codes. The codes are antioptimal codes in the sense that they correct all periodic errors of order or more in the first block of length and all periodic errors of order or more in the second block of length and no others. First we prove the following lemma.
Lemma 8. If (where ) denotes the number of periodic errors of order or more over the space of all tuples over , then where and .
Proof. For , there will be no common errors among the periodic errors of order or more except the single errors. Let be the number of periodic errors of order . Then,
(refer to Tyagi and Das [4]).
Therefore
where
Let . Since any periodic error of order is a periodic error of order , therefore we have
Let . Since represents the single errors and all single errors present in periodic errors of any order, so by counting the number of periodic errors of order or more, we take the value of up to . Also, any periodic error of order is a periodic error of order . Hence
Theorem 9. The number of parity check digits for an linear code over that corrects all periodic errors of order or more in the first block of length () and all periodic errors of order or more in the second block of length () and no other error patterns is at least where and are given in Lemma 8.
Proof. This proof is based on counting the number of errors above specific type and comparing with the available cosets in the linear code over .
By Lemma 8, we have the following.(a)The number of periodic errors of order or more in the first block of length is .(b)The number of periodic errors of order or more in the second block of length is .
Therefore, the total number of errors including the zero vector is
Thus
Hence the proof of Theorem 9 is complete.
Now the equality of inequality (21) gives us the optimal case. By considering the equality in (21), we get For and , (22) becomes
Example 10. For , , and , (23) gives rise to binary () linear code. The code whose parity check matrix is given below is a periodic error correcting antioptimal code that corrects all periodic errors of order 2 or more in the first block of length 3 and all periodic errors of order 2 or more in the second block of length 6 and no others. Consider It can be verified from the error pattern syndromes shown in Table 2.

Example 11. For , , and , (23) gives rise to binary () linear code. The code whose parity check matrix is given below is a periodic error correcting antioptimal codes in two blocks that correct all single errors in the first block of length 6 and all periodic errors of order 3 or more in the second block of length 9 and no more. It can also be verified by the error pattern syndrome table. Consider
Conflict of Interests
The author declares that there is no conflict of interests regarding the publication of this paper.
Acknowledgment
The author would like to thank referees for their careful reading of the paper and for their valuable suggestions.
References
 “Astrophotography mounts: periodic error correction,” http://www.themcdonalds.net/richard/index.php?title=Main_Page. View at: Google Scholar
 V. Tyagi and A. Tyagi, “Periodic error correcting perfect codes,” International Journal of Computer and Information Technology, vol. 2, no. 5, pp. 603–607, 2013. View at: Google Scholar
 P. K. Das and V. Tyagi, “Codes on speriodic errors,” Ratio Mathematica—Journal of Applied Mathematics, vol. 22, pp. 61–68, 2012. View at: Google Scholar
 V. K. Tyagi and P. K. Das, “salternate error correcting linear code,” Journal of Combinatorics, Information & System Sciences, vol. 35, no. 12, pp. 17–26, 2010. View at: Google Scholar
 R. W. Hamming, “Error detecting and error correcting codes,” The Bell System Technical Journal, vol. 29, pp. 147–160, 1950. View at: Publisher Site  Google Scholar  MathSciNet
 W. W. Peterson and J. Weldon, ErrorCorrecting Codes, MIT Press, Cambridge, Mass, UK, 2nd edition, 1972. View at: MathSciNet
 M. J. E. Golay, “Notes on digital coding,” Proceedings of the IRE, vol. 37, p. 657, 1949. View at: Google Scholar
 A. Tietavainen, “On the nonexistence of perfect codes over finite fields,” SIAM Journal on Applied Mathematics, vol. 24, no. 1, pp. 88–96, 1971. View at: Google Scholar
 A. Tietavainen and A. Perko, “There are no unknown perfect binary codes,” Annales Universitatis Turkuensis A, vol. 148, pp. 3–10, 1971. View at: Google Scholar
 J. H. van Lint, “A survey of perfect codes,” The Rocky Mountain Journal of Mathematics, vol. 5, pp. 199–224, 1975. View at: Publisher Site  Google Scholar  Zentralblatt MATH  MathSciNet
 B. D. Sharma and B. K. Dass, “Adjacenterror correcting binary perfect codes,” Journal of Cybernetics, vol. 7, no. 12, pp. 9–13, 1977. View at: Google Scholar
 B. K. Dass and V. K. Tyagi, “A new type of (1, 2)optimal codes over GF(2),” Indian Journal of Pure and Applied Mathematics, vol. 13, no. 7, pp. 750–756, 1982. View at: Google Scholar  MathSciNet
 P. K. Das, “(1, 3) Optimal linear codes on solid bursts,” International Journal of Information Security Science, vol. 1, no. 4, pp. 106–111, 2012. View at: Google Scholar
 B. D. Sharma, B. K. Dass, and S. N. Gupta, “A sufficient condition for the existence of highdensity burst correcting linear codes,” Indian Journal of Pure and Applied Mathematics, vol. 8, no. 7, pp. 816–820, 1977. View at: Google Scholar
 B. D. Sharma and B. K. Dass, “On weight of bursts,” in Proceedings of the 38th Annual Conference of IMS, Bhopal, India, 1972. View at: Google Scholar
 B. D. Sharma and B. Rohtagi, “Some results on weights of vectors having $m$repeated bursts,” Cybernetics and Information Technologies, vol. 11, no. 3, pp. 3–11, 2011. View at: Google Scholar  MathSciNet
 M. Plotkin, “Binary code with specified minimum weight,” IRE Transactions on Information Theory, vol. 6, pp. 440–450, 1960. View at: Google Scholar
 P. K. Das, “Bounds on codes correcting periodic errors blockwise,” International Journal of Informatics and Communication Technology, vol. 2, no. 1, pp. 51–56, 2013. View at: Google Scholar
Copyright
Copyright © 2014 Pankaj Kumar Das. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.