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
Calcular a distribuição de peso de um código é um problema desafiador na teoria da codificação. Neste artigo, as distribuições de peso de (256, k) códigos BCH primitivos binários estendidos com k≤71 e k≥187 são dados. As distribuições de peso dos códigos com k≤63 e k≥207 já foram obtidos em nosso trabalho anterior. Permutação afim e estrutura de treliça são usadas para reduzir o tempo de computação. São desenvolvidos programas de computador em linguagem C que utilizam instruções recentes da CPU, como SIMD. Esses programas podem ser implantados até mesmo em uma estação de trabalho de modelo básico para obter os novos resultados deste artigo.
Toru FUJIWARA
Osaka University
Takuya KUSAKA
Okayama University
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.
Copiar
Toru FUJIWARA, Takuya KUSAKA, "The Weight Distributions of the (256, k) Extended Binary Primitive BCH Codes with k≤71 and k≥187" in IEICE TRANSACTIONS on Fundamentals,
vol. E104-A, no. 9, pp. 1321-1328, September 2021, doi: 10.1587/transfun.2020EAP1119.
Abstract: Computing the weight distribution of a code is a challenging problem in coding theory. In this paper, the weight distributions of (256, k) extended binary primitive BCH codes with k≤71 and k≥187 are given. The weight distributions of the codes with k≤63 and k≥207 have already been obtained in our previous work. Affine permutation and trellis structure are used to reduce the computing time. Computer programs in C language which use recent CPU instructions, such as SIMD, are developed. These programs can be deployed even on an entry model workstation to obtain the new results in this paper.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020EAP1119/_p
Copiar
@ARTICLE{e104-a_9_1321,
author={Toru FUJIWARA, Takuya KUSAKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={The Weight Distributions of the (256, k) Extended Binary Primitive BCH Codes with k≤71 and k≥187},
year={2021},
volume={E104-A},
number={9},
pages={1321-1328},
abstract={Computing the weight distribution of a code is a challenging problem in coding theory. In this paper, the weight distributions of (256, k) extended binary primitive BCH codes with k≤71 and k≥187 are given. The weight distributions of the codes with k≤63 and k≥207 have already been obtained in our previous work. Affine permutation and trellis structure are used to reduce the computing time. Computer programs in C language which use recent CPU instructions, such as SIMD, are developed. These programs can be deployed even on an entry model workstation to obtain the new results in this paper.},
keywords={},
doi={10.1587/transfun.2020EAP1119},
ISSN={1745-1337},
month={September},}
Copiar
TY - JOUR
TI - The Weight Distributions of the (256, k) Extended Binary Primitive BCH Codes with k≤71 and k≥187
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1321
EP - 1328
AU - Toru FUJIWARA
AU - Takuya KUSAKA
PY - 2021
DO - 10.1587/transfun.2020EAP1119
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E104-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2021
AB - Computing the weight distribution of a code is a challenging problem in coding theory. In this paper, the weight distributions of (256, k) extended binary primitive BCH codes with k≤71 and k≥187 are given. The weight distributions of the codes with k≤63 and k≥207 have already been obtained in our previous work. Affine permutation and trellis structure are used to reduce the computing time. Computer programs in C language which use recent CPU instructions, such as SIMD, are developed. These programs can be deployed even on an entry model workstation to obtain the new results in this paper.
ER -