On symbol-pair weight distribution of MDS codes and simplex codes over finite fields
From MaRDI portal
Publication:2040335
DOI10.1007/s12095-020-00455-xzbMath1469.94136OpenAlexW3091595369MaRDI QIDQ2040335
Publication date: 13 July 2021
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-020-00455-x
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Related Items (4)
Constructions of MDS symbol-pair codes with minimum distance seven or eight ⋮ AMDS symbol-pair codes from repeated-root cyclic codes ⋮ Another expression of the MacWilliams identities and its applications ⋮ MDS symbol-pair codes from repeated-root cyclic codes
Cites Work
- Maximum distance separable codes for \(b\)-symbol 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
- 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
- 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
This page was built for publication: On symbol-pair weight distribution of MDS codes and simplex codes over finite fields
