Codes for Symbol-Pair Read Channels

DOI10.1109/TIT.2011.2164891zbMath1365.94551OpenAlexW2092031626MaRDI QIDQ5272217

Mario Blaum, Yuval Cassuto

Publication date: 12 July 2017

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

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

Mathematics Subject Classification ID

Cyclic codes (94B15) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (29)

Complete \(b\)-symbol weight distribution of some irreducible cyclic codes ⋮ Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes ⋮ The primitive idempotents of irreducible constacyclic codes and LCD cyclic codes ⋮ Maximum distance separable codes for \(b\)-symbol read channels ⋮ Constructions of MDS symbol-pair codes with minimum distance seven or eight ⋮ AMDS symbol-pair codes from repeated-root cyclic codes ⋮ On symbol-pair distances of repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\) and MDS symbol-pair codes ⋮ On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) ⋮ 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 ⋮ Symbol-pair distance of some repeated-root constacyclic codes of length \(p^s\) over the Galois ring \(\mathrm{GR}(p^a, m)\) ⋮ MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes ⋮ Symbol-pair weight distribution of some irreducible cyclic codes ⋮ The \(b\)-symbol weight hierarchy of the Kasami codes ⋮ The symbol-pair distance distribution of a class of repeated-root cyclic codes over \(\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\) ⋮ Cyclic codes of length \(5p\) with MDS symbol-pair ⋮ Optimal b-symbol constacyclic codes with respect to the Singleton bound ⋮ Symbol-triple distance of repeated-root constacyclic codes of prime power lengths ⋮ On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\) ⋮ New constructions of MDS symbol-pair codes ⋮ Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds ⋮ A direct method for the computation of waiting times ⋮ Affine variety codes over a hyperelliptic curve ⋮ On symbol-pair weight distribution of MDS codes and simplex codes over finite fields ⋮ On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths ⋮ 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}\) ⋮ MDS symbol-pair codes from repeated-root cyclic codes ⋮ On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\)

This page was built for publication: Codes for Symbol-Pair Read Channels