The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Kami membuktikan bahawa imej binari kod kitaran tidak boleh dikurangkan C atas GF(2m) dan kod bercantum binari bagi C dan perduaan [m+ 1,m,2] kod pariti genap adalah optimum (dalam erti kata ia memenuhi Griesmer terikat dengan kesamaan) dan betul, jika punca polinomial semak C adalah primitif berbanding GF(2m) atau sambungannya.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Katsumi SAKAKIBARA, Ritsuko IWASA, Yoshiharu YUBA, "On Optimal and Proper Binary Codes from Irreducible Cyclic Codes over GF(2m)" in IEICE TRANSACTIONS on Fundamentals,
vol. E82-A, no. 10, pp. 2191-2193, October 1999, doi: .
Abstract: We prove that binary images of irreducible cyclic codes C over GF(2m) and binary concatenated codes of C and a binary [m+1,m,2] even-parity code are optimal (in the sense that they meet the Griesmer bound with equality) and proper, if a root of the check polynomial of C is primitive over GF(2m) or its extensions.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e82-a_10_2191/_p
Salinan
@ARTICLE{e82-a_10_2191,
author={Katsumi SAKAKIBARA, Ritsuko IWASA, Yoshiharu YUBA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Optimal and Proper Binary Codes from Irreducible Cyclic Codes over GF(2m)},
year={1999},
volume={E82-A},
number={10},
pages={2191-2193},
abstract={We prove that binary images of irreducible cyclic codes C over GF(2m) and binary concatenated codes of C and a binary [m+1,m,2] even-parity code are optimal (in the sense that they meet the Griesmer bound with equality) and proper, if a root of the check polynomial of C is primitive over GF(2m) or its extensions.},
keywords={},
doi={},
ISSN={},
month={October},}
Salinan
TY - JOUR
TI - On Optimal and Proper Binary Codes from Irreducible Cyclic Codes over GF(2m)
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2191
EP - 2193
AU - Katsumi SAKAKIBARA
AU - Ritsuko IWASA
AU - Yoshiharu YUBA
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E82-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1999
AB - We prove that binary images of irreducible cyclic codes C over GF(2m) and binary concatenated codes of C and a binary [m+1,m,2] even-parity code are optimal (in the sense that they meet the Griesmer bound with equality) and proper, if a root of the check polynomial of C is primitive over GF(2m) or its extensions.
ER -