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
홀수 소수의 경우 q 및 정수 m≤q, 우리는 정규 준순환 패리티 검사 행렬을 구성할 수 있습니다 HI(m,q) 선형 블록 코드를 지정하는 CI(m,q)라고 불리는 부적절한 배열 암호. 이 편지에서 우리는 최소 거리를 증명합니다 CI(4,q)는 모든 경우에 대해 10과 같습니다. q≥11. 또한, 우리는 최소 거리를 증명합니다. CI(5,q)의 상한은 12입니다. q≥11이고 상한이 빡빡하다고 추측됩니다.
Haiyang LIU
the Institute of Microelectronics of Chinese Academy of Sciences
Lianrong MA
Tsinghua University
Hao ZHANG
the Institute of Microelectronics of Chinese Academy of Sciences
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.
부
Haiyang LIU, Lianrong MA, Hao ZHANG, "On the Minimum Distance of Some Improper Array Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 12, pp. 2021-2026, December 2019, doi: 10.1587/transfun.E102.A.2021.
Abstract: For an odd prime q and an integer m≤q, we can construct a regular quasi-cyclic parity-check matrix HI(m,q) that specifies a linear block code CI(m,q), called an improper array code. In this letter, we prove the minimum distance of CI(4,q) is equal to 10 for any q≥11. In addition, we prove the minimum distance of CI(5,q) is upper bounded by 12 for any q≥11 and conjecture the upper bound is tight.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.2021/_p
부
@ARTICLE{e102-a_12_2021,
author={Haiyang LIU, Lianrong MA, Hao ZHANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On the Minimum Distance of Some Improper Array Codes},
year={2019},
volume={E102-A},
number={12},
pages={2021-2026},
abstract={For an odd prime q and an integer m≤q, we can construct a regular quasi-cyclic parity-check matrix HI(m,q) that specifies a linear block code CI(m,q), called an improper array code. In this letter, we prove the minimum distance of CI(4,q) is equal to 10 for any q≥11. In addition, we prove the minimum distance of CI(5,q) is upper bounded by 12 for any q≥11 and conjecture the upper bound is tight.},
keywords={},
doi={10.1587/transfun.E102.A.2021},
ISSN={1745-1337},
month={December},}
부
TY - JOUR
TI - On the Minimum Distance of Some Improper Array Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2021
EP - 2026
AU - Haiyang LIU
AU - Lianrong MA
AU - Hao ZHANG
PY - 2019
DO - 10.1587/transfun.E102.A.2021
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E102-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2019
AB - For an odd prime q and an integer m≤q, we can construct a regular quasi-cyclic parity-check matrix HI(m,q) that specifies a linear block code CI(m,q), called an improper array code. In this letter, we prove the minimum distance of CI(4,q) is equal to 10 for any q≥11. In addition, we prove the minimum distance of CI(5,q) is upper bounded by 12 for any q≥11 and conjecture the upper bound is tight.
ER -