A Class of Triple Error Correcting Bch Likes Codes
O.P.Vinocha1, Ajay Kumar2
1O.P.Vinocha, Principal, Ferozepur College of Engineering and Technology, Ferozeshah (Punjab), India.
2Ajay Kumar, PhD Scholar, A.P, Department of Mathematics, LRRIET, MOGA (Punjab), India.
Manuscript received on 8 August 2013 | Revised Manuscript received on 18 August 2013 | Manuscript Published on 30 August 2013 | PP: 144-145 | Volume-3 Issue-3, August 2013 | Retrieval Number: C1103083313/13©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In a recent paper, Bracken and Helleseth  showed that one can construct triple-error-correcting codes using zero set consisting different zero set than the BCH codes. In this correspondence we present some new triple error correcting code having zeros 𝟏 , 𝟐 𝟐𝒌 + 𝟏, 𝟐 𝟒𝒌 + 𝟏 and 𝟏 , 𝟐 𝟐𝒌 + 𝟏, 𝟐 𝟔𝒌 + 𝟏 where gcd (2k, n) =1 and n be odd.
Keywords: Triple Error, Parity Check Matrix & Minimum Distance.
Scope of the Article: Cryptography and Applied Mathematics