MDS symbol-pair codes from repeated-root cyclic codes
From MaRDI portal
Publication:2068385
DOI10.1007/S10623-021-00967-4OpenAlexW3208635886MaRDI QIDQ2068385
Publication date: 19 January 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.05050
constacyclic codesrepeated-root cyclic codesMDS symbol-pair codesAMDS symbol-pair codesminimum symbol-pair distance
Related Items (4)
Constructions of MDS symbol-pair codes with minimum distance seven or eight ⋮ AMDS symbol-pair codes from repeated-root cyclic codes ⋮ MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes ⋮ Cyclic codes of length \(5p\) with MDS symbol-pair
Cites Work
- 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
- On symbol-pair weight distribution of MDS codes and simplex codes over finite fields
- 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
- A Construction of New MDS Symbol-Pair Codes
- Polyadic Constacyclic Codes
- Fundamentals of Error-Correcting Codes
- Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions
- On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths
- Bounds and Constructions of Codes Over Symbol-Pair Read Channels
- MDS Symbol-Pair Cyclic Codes of Length $2p^s$ over $\mathbb F_{p^m}$
- List Decodability of Symbol-Pair Codes
- Codes for Symbol-Pair Read Channels
- Maximum Distance Separable Codes for Symbol-Pair Read Channels
- Polynomial weights and code constructions
- On repeated-root cyclic codes
- Unnamed Item
This page was built for publication: MDS symbol-pair codes from repeated-root cyclic codes
