The weight distributions of the (256, k) extended binary primitive BCH codes with k ≤ 71 and k ≥ 187

Toru Fujiwara, Takuya Kusaka

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)1321-1328
Number of pages8
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE104A
Issue number9
DOIs
Publication statusPublished - 2021

Keywords

  • Affine permutation
  • Automorphism group of code
  • BCH code
  • SIMD
  • Weight distribution

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'The weight distributions of the (256, k) extended binary primitive BCH codes with k ≤ 71 and k ≥ 187'. Together they form a unique fingerprint.

Cite this