DocumentCode :
2445656
Title :
Perfect codes for metrics generated by primitive 2-error-correcting binary BCH codes
Author :
Gabidulin, Ernst M. ; Simonis, Juriaan
Author_Institution :
Moscow Inst. of Phys. & Technol., Russia
fYear :
1998
fDate :
16-21 Aug 1998
Firstpage :
68
Abstract :
For any positive integer m, a metric on F22m is considered which is induced by the quasi-perfect [2m-1,2 m-2m-1,5] binary BCH code. Constructions of codes are given which are perfect with respect to this metric. In addition, easy decoding methods for these codes are proposed
Keywords :
BCH codes; binary codes; decoding; error correction codes; linear codes; Hamming codes; binary BCH codes; decoding methods; linear codes; metrics; minimum Hamming distance; parent codes; perfect codes; primitive 2-error-correcting codes; Code standards; Decoding; Galois fields; Hamming distance; Information technology; Kernel; Linear code; Physics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
Type :
conf
DOI :
10.1109/ISIT.1998.708651
Filename :
708651
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2445656
بازگشت