Bounds and Constructions of Codes Over Symbol-Pair Read Channels

DOI10.1109/TIT.2019.2942283MaRDI QIDQ5123792zbMATH OpenOpenAlexFDO

Authors Ohad Elishco, Ryan Gabrys, Eitan Yaakobi

Publication date 29 September 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2019.2942283

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Cited in

(11)

• On symbol-pair weight distribution of MDS codes and simplex codes over finite fields
• MDS symbol-pair codes from repeated-root cyclic codes
• Constructions of MDS symbol-pair codes with minimum distance seven or eight
• Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels
• Codes for Symbol-Pair Read Channels
• AMDS symbol-pair codes from repeated-root cyclic codes
• Another expression of the MacWilliams identities and its applications
• The b-symbol weight hierarchy of the Kasami codes
• The \(b\)-weight distribution for MDS codes
• Some bounds on the cardinality of the b-symbol weight spectrum of codes
• Bounds and constructions of optimal symbol-pair codes with constant pair-weight

This page was built for publication: Bounds and Constructions of Codes Over Symbol-Pair Read Channels

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