Constructions of MDS symbol-pair codes with minimum distance seven or eight

DOI10.1007/s10623-022-01081-9OpenAlexW4286817187WikidataQ114226818 ScholiaQ114226818MaRDI QIDQ2673981

Jinquan Luo, Junru Ma

Publication date: 22 September 2022

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.04329

zbMATH Keywords

constacyclic codesrepeated-root cyclic codesMDS symbol-pair codesminimum symbol-pair distance

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Related Items (1)

AMDS symbol-pair codes from repeated-root cyclic codes

Cites Work

• Unnamed Item
• 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 symbol-pair weight distribution of MDS codes and simplex codes over finite fields
• MDS symbol-pair codes from repeated-root cyclic 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
• 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
• Polynomial weights and code constructions
• On repeated-root cyclic codes

This page was built for publication: Constructions of MDS symbol-pair codes with minimum distance seven or eight