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
순환 코드의 경우 일부 잘 알려진 하한과 경계의 절반까지의 일부 디코딩 방법이 제안됩니다. 특히, 이동 경계는 순환 코드, Reed-Muller 코드 및 기하학적 Goppa 코드에 대한 최소 거리의 좋은 하한입니다. 이 논문에서 우리는 정의 세트에 의해 정의된 순환 코드를 고려하고, 알려지지 않은 요소와 Blahut 정리를 사용하여 이산 푸리에 변환을 사용하여 이동 경계의 새롭고 간단한 유도를 보여줍니다. 또한 이진 순환 코드의 두 가지 예가 제공됩니다.
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.
부
Junru ZHENG, Takayasu KAIDA, "A Note on the Shift Bound for Cyclic Codes by the DFT" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 11, pp. 1918-1922, November 2010, doi: 10.1587/transfun.E93.A.1918.
Abstract: For cyclic codes some well-known lower bounds and some decoding methods up to the half of the bounds are suggested. Particularly, the shift bound is a good lower bound of the minimum distance for cyclic codes, Reed-Muller codes and geometric Goppa codes. In this paper we consider cyclic codes defined by their defining set, and new simple derivation of the shift bound using the discrete Fourier transform with unknown elements and the Blahut theorem is shown. Moreover two examples of binary cyclic codes are given.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.1918/_p
부
@ARTICLE{e93-a_11_1918,
author={Junru ZHENG, Takayasu KAIDA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Note on the Shift Bound for Cyclic Codes by the DFT},
year={2010},
volume={E93-A},
number={11},
pages={1918-1922},
abstract={For cyclic codes some well-known lower bounds and some decoding methods up to the half of the bounds are suggested. Particularly, the shift bound is a good lower bound of the minimum distance for cyclic codes, Reed-Muller codes and geometric Goppa codes. In this paper we consider cyclic codes defined by their defining set, and new simple derivation of the shift bound using the discrete Fourier transform with unknown elements and the Blahut theorem is shown. Moreover two examples of binary cyclic codes are given.},
keywords={},
doi={10.1587/transfun.E93.A.1918},
ISSN={1745-1337},
month={November},}
부
TY - JOUR
TI - A Note on the Shift Bound for Cyclic Codes by the DFT
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1918
EP - 1922
AU - Junru ZHENG
AU - Takayasu KAIDA
PY - 2010
DO - 10.1587/transfun.E93.A.1918
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2010
AB - For cyclic codes some well-known lower bounds and some decoding methods up to the half of the bounds are suggested. Particularly, the shift bound is a good lower bound of the minimum distance for cyclic codes, Reed-Muller codes and geometric Goppa codes. In this paper we consider cyclic codes defined by their defining set, and new simple derivation of the shift bound using the discrete Fourier transform with unknown elements and the Blahut theorem is shown. Moreover two examples of binary cyclic codes are given.
ER -