Cyclic codes of length \(5p\) with MDS symbol-pair
From MaRDI portal
Publication:2701494
DOI10.1007/s10623-023-01184-xOpenAlexW4317039685MaRDI QIDQ2701494
Publication date: 28 April 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-023-01184-x
Cites Work
- Maximum distance separable codes for \(b\)-symbol read channels
- New constructions of MDS symbol-pair codes
- MDS symbol-pair codes from repeated-root cyclic codes
- On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths
- On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\)
- Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
- Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels
- 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
- Codes for Symbol-Pair Read Channels
- Maximum Distance Separable Codes for Symbol-Pair Read Channels
- On repeated-root cyclic codes
This page was built for publication: Cyclic codes of length \(5p\) with MDS symbol-pair