MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes
From MaRDI portal
Publication:6156915
DOI10.1016/j.ffa.2023.102203zbMath1516.94071arXiv2206.00462OpenAlexW4366505927MaRDI QIDQ6156915
Publication date: 19 June 2023
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.00462
Cites Work
- MDS symbol-pair codes from repeated-root cyclic codes
- Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
- A Construction of New MDS Symbol-Pair Codes
- Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions
- On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
- Generalized Pair Weights of Linear Codes and Linear Isomorphisms Preserving Pair Weights
- MDS Symbol-Pair Cyclic Codes of Length $2p^s$ over $\mathbb F_{p^m}$
- Codes for Symbol-Pair Read Channels
- Maximum Distance Separable Codes for Symbol-Pair Read Channels
- On repeated-root cyclic codes
- AMDS symbol-pair codes from repeated-root cyclic codes
This page was built for publication: MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes