Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Two types of narrow-sense negacyclic BCH codes (2307.12762v2)

Published 24 Jul 2023 in cs.IT and math.IT

Abstract: Negacyclic BCH codes are an important subclass of negacyclic codes and are the best linear codes in most cases, but their parameters are hard to determine. In this paper, we mainly study two types of negacyclic BCH codes of length $n=\frac{q{m}-1}{4},\frac{q{m}+1}{4}$, and give their dimensions and the lower bound on their minimum distance. Furthermore, we provide the weight distribution of narrow-sense neagcyclic BCH codes of length $n=\frac{qm-1}{4}$ for some special designed distances.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Yanhui Zhang (11 papers)
  2. Li Liu (311 papers)
  3. Xianhong Xie (7 papers)

Summary

We haven't generated a summary for this paper yet.