Maximum distance separable codes for b-symbol read channels

DOI10.1016/J.FFA.2017.10.002MaRDI QIDQ1679709zbMATH OpenOpenAlexFDO

Authors Baokun Ding, Tao Zhang, Gennian Ge

Publication date 21 November 2017

Published in Finite Fields and their Applications (Search for Journal in Brave)

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

zbMATH Keywords

projective geometryconstacyclic codesMDS \(b\)-symbol codes

Mathematics Subject Classification ID

Combinatorial codes (94B25) Other types of codes (94B60)

Abstract: Recently, Yaakobi et al. introduced codes for $b$-symbol read channels, where the read operation is performed as a consecutive sequence of $b>2$ symbols. In this paper, we establish a Singleton-type bound on $b$-symbol codes. Codes meeting the Singleton-type bound are called maximum distance separable (MDS) codes, and they are optimal in the sense they attain the maximal minimum $b$-distance. Based on projective geometry and constacyclic codes, we construct new families of linear MDS $b$-symbol codes over finite fields. And in some sense, we completely determine the existence of linear MDS $b$-symbol codes over finite fields for certain parameters.

Recommendations

• Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
• Constructions of MDS symbol-pair codes with minimum distance seven or eight
• Optimal \(b\)-symbol constacyclic codes with respect to the Singleton bound
• New constructions of MDS symbol-pair codes
• MDS symbol-pair codes from repeated-root cyclic codes

Cites work

• A Construction of New MDS Symbol-Pair Codes
• Codes for Symbol-Pair Read Channels
• Constacyclic Symbol-Pair Codes: Lower Bounds and Optimal Constructions
• Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels
• Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes
• Maximum Distance Separable Codes for Symbol-Pair Read Channels

Cited in

(17)

• Cyclic codes of length \(5p\) with MDS symbol-pair
• On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths
• On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring
• Another expression of the MacWilliams identities and its applications
• Complete \(b\)-symbol weight distribution of some irreducible cyclic codes
• The \(b\)-symbol weight distributions of all semiprimitive irreducible cyclic codes
• The \(b\)-weight distribution for MDS codes
• Codes for Symbol-Pair Read Channels
• The \(b\)-symbol weight hierarchy of the Kasami codes
• On symbol-pair weight distribution of MDS codes and simplex codes over finite fields
• Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
• Constructions of MDS symbol-pair codes with minimum distance seven or eight
• Construction of optimal codes from a class of constacyclic codes
• On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
• MDS symbol-pair repeated-root constacylic codes of prime power lengths over \(\mathbb{F}_q+ u\mathbb{F}_q + u^2\mathbb{F}_q\)
• Optimal \(b\)-symbol constacyclic codes with respect to the Singleton bound
• On Hamming and \(b\)-symbol distance distributions of repeated-root constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}+u \mathbb{F}_{p^m}\)

This page was built for publication: Maximum distance separable codes for \(b\)-symbol read channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679709)