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
Berlekamp-Massey 알고리즘의 사용을 기반으로 2개 및 3개 구성 요소 코드의 일부 크로네커 시퀀스의 선형 복잡도(LC)에 대한 6가지 추측이 제공됩니다. 구성 요소는 Gold, Kasami, Barker, Golay 보완 및 제품군에서 선택되었습니다. M-순서. 일반적으로 LC 값은 코드 길이의 큰 부분을 차지합니다. 가장 바깥쪽 코드의 LC 값은 주로 LC 값에 영향을 미칩니다.
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.
부
Kari H. A. KARKKAINEN, "Linear Complexity of Kronecker Sequences" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 5, pp. 1348-1351, May 2001, doi: .
Abstract: Based on the use of Berlekamp-Massey algorithm, six conjectures for the linear complexity (LC) of some Kronecker sequences of two and three component codes are given. Components were chosen from the families of Gold, Kasami, Barker, Golay complementary and M-sequences. Typically, the LC value is a large part of the code length. The LC value of the outermost code influences mostly on the LC value.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_5_1348/_p
부
@ARTICLE{e84-a_5_1348,
author={Kari H. A. KARKKAINEN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Linear Complexity of Kronecker Sequences},
year={2001},
volume={E84-A},
number={5},
pages={1348-1351},
abstract={Based on the use of Berlekamp-Massey algorithm, six conjectures for the linear complexity (LC) of some Kronecker sequences of two and three component codes are given. Components were chosen from the families of Gold, Kasami, Barker, Golay complementary and M-sequences. Typically, the LC value is a large part of the code length. The LC value of the outermost code influences mostly on the LC value.},
keywords={},
doi={},
ISSN={},
month={May},}
부
TY - JOUR
TI - Linear Complexity of Kronecker Sequences
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1348
EP - 1351
AU - Kari H. A. KARKKAINEN
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2001
AB - Based on the use of Berlekamp-Massey algorithm, six conjectures for the linear complexity (LC) of some Kronecker sequences of two and three component codes are given. Components were chosen from the families of Gold, Kasami, Barker, Golay complementary and M-sequences. Typically, the LC value is a large part of the code length. The LC value of the outermost code influences mostly on the LC value.
ER -