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
본 논문에서는 [n,k] 행이 다음과 같은 생성기 행렬에 의해 지정되는 선형 코드입니다. k 주어진 시퀀스의 벡터 n 유한 필드에 대한 선형 독립 벡터입니다. Feng-Rao 경계와 순서 경계는 본 논문에서 고려되는 코드의 이중 코드의 최소 거리에 대한 하한을 제공합니다. 우리는 제안된 경계가 Reed-Solomon 및 Reed-Muller 코드에 대한 실제 최소 거리를 제공하고 일부 코드에 대해서는 Goppa 경계를 초과한다는 것을 보여줍니다. L- 대수 기하학 코드를 입력합니다.
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.
부
Tomoharu SHIBUYA, Kohichi SAKANIWA, "A Dual of Well-Behaving Type Designed Minimum Distance" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 2, pp. 647-652, February 2001, doi: .
Abstract: In this paper, we propose a lower bound for the minimum distance of [n,k] linear codes which are specified by generator matrices whose rows are k vectors of a given sequence of n linearly independent vectors over a finite field. The Feng-Rao bound and the order bound give the lower bounds for the minimum distance of the dual codes of the codes considered in this paper. We show that the proposed bound gives the true minimum distance for Reed-Solomon and Reed-Muller codes and exceeds the Goppa bound for some L-type algebraic geometry codes.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_2_647/_p
부
@ARTICLE{e84-a_2_647,
author={Tomoharu SHIBUYA, Kohichi SAKANIWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Dual of Well-Behaving Type Designed Minimum Distance},
year={2001},
volume={E84-A},
number={2},
pages={647-652},
abstract={In this paper, we propose a lower bound for the minimum distance of [n,k] linear codes which are specified by generator matrices whose rows are k vectors of a given sequence of n linearly independent vectors over a finite field. The Feng-Rao bound and the order bound give the lower bounds for the minimum distance of the dual codes of the codes considered in this paper. We show that the proposed bound gives the true minimum distance for Reed-Solomon and Reed-Muller codes and exceeds the Goppa bound for some L-type algebraic geometry codes.},
keywords={},
doi={},
ISSN={},
month={February},}
부
TY - JOUR
TI - A Dual of Well-Behaving Type Designed Minimum Distance
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 647
EP - 652
AU - Tomoharu SHIBUYA
AU - Kohichi SAKANIWA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2001
AB - In this paper, we propose a lower bound for the minimum distance of [n,k] linear codes which are specified by generator matrices whose rows are k vectors of a given sequence of n linearly independent vectors over a finite field. The Feng-Rao bound and the order bound give the lower bounds for the minimum distance of the dual codes of the codes considered in this paper. We show that the proposed bound gives the true minimum distance for Reed-Solomon and Reed-Muller codes and exceeds the Goppa bound for some L-type algebraic geometry codes.
ER -