The b-symbol weight hierarchy of the Kasami codes
From MaRDI portal
Publication:6184545
DOI10.1016/J.DISC.2023.113774arXiv2112.04019OpenAlexW4388545491MaRDI QIDQ6184545FDOQ6184545
Authors: Hongwei Zhu, Minjia Shi
Publication date: 25 January 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: The symbol-pair read channel was first proposed by Cassuto and Blaum. Later, Yaakobi et al. generalized it to the -symbol read channel. It is motivated by the limitations of the reading process in high density data storage systems. One main task in -symbol coding theory is to determine the -symbol weight hierarchy of codes. In this paper, we study the -symbol weight hierarchy of the Kasami codes, which are well known for their applications to construct sequences with optimal correlation magnitudes. The complete symbol-pair weight distribution of the Kasami codes is determined.
Full work available at URL: https://arxiv.org/abs/2112.04019
Recommendations
- \(b\)-symbol distance distribution of repeated-root cyclic codes
- Complete \(b\)-symbol weight distribution of some irreducible cyclic codes
- Maximum distance separable codes for \(b\)-symbol read channels
- The \(b\)-weight distribution for MDS codes
- Another expression of the MacWilliams identities and its applications
Cites Work
- Hamming weights in irreducible cyclic codes
- The weight distributions of a class of cyclic codes. III
- The weight distributions of a class of cyclic codes. II
- The Weight Distributions of Cyclic Codes and Elliptic Curves
- The Weight Distribution of Some Irreducible Cyclic Codes
- The Weight Distributions of the Duals of Cyclic Codes With Two Zeros
- The Weight Enumerator of a Class of Cyclic Codes
- Evaluation of the Weight Distribution of a Class of Cyclic Codes Based on Index 2 Gauss Sums
- The weight distributions of a class of cyclic codes
- Algebraically punctured cyclic codes
- A Bound for Error-Correcting Codes
- Generalized Hamming weights for linear codes
- A Construction of New MDS Symbol-Pair Codes
- Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions
- The weight hierarchy of the Kasami codes
- Maximum distance separable codes for \(b\)-symbol read channels
- Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels
- Codes for Symbol-Pair Read Channels
- Maximum Distance Separable Codes for Symbol-Pair Read Channels
- The symbol-pair distance distribution of a class of repeated-root cyclic codes over \(\mathbb {F}_{p^{m}}\)
- New constructions of MDS symbol-pair codes
- Bounds and Constructions of Codes Over Symbol-Pair Read Channels
- A New Approach to the Kasami Codes of Type 2
- Complete \(b\)-symbol weight distribution of some irreducible cyclic codes
- Geometric Approach tob-Symbol Hamming Weights of Cyclic Codes
This page was built for publication: The \(b\)-symbol weight hierarchy of the Kasami codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184545)