Codes for Symbol-Pair Read Channels

DOI10.1109/TIT.2011.2164891MaRDI QIDQ5272217zbMATH OpenOpenAlexFDO

Authors Yuval Cassuto, Mario Blaum

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)

Recommendations

• Bounds and Constructions of Codes Over Symbol-Pair Read Channels
• Maximum Distance Separable Codes for Symbol-Pair Read Channels
• Binary codes for compound channels (Corresp.)
• Maximum distance separable codes for b-symbol read channels
• Separable Codes for the Symmetric Multiple-Access Channel
• Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels
• Parameters of Codes for the Binary Asymmetric Channel
• Error Control Codes for Parallel Asymmetric Channels
• Coding for a multiple-access channel

Cited in

(50)

• 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}}\)
• 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
• Affine variety codes over a hyperelliptic curve
• On symbol-pair weight distribution of MDS codes and simplex codes over finite fields
• 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
• Complete \(b\)-symbol weight distribution of some irreducible cyclic codes
• The primitive idempotents of irreducible constacyclic codes and LCD cyclic codes
• On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths
• 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 of MDS symbol-pair codes with minimum distance seven or eight
• On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring
• 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
• Symbolic Gray Code As A Data Allocation Scheme For Two-disc Systems
• Optimal b-symbol constacyclic codes with respect to the Singleton bound
• Symbol-triple distance of repeated-root constacyclic codes of prime power lengths
• A direct method for the computation of waiting times
• 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}\)
• 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
• Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes
• The \(b\)-weight distribution for MDS codes
• Repeated-root constacyclic codes of length k^s l^m p^n over finite fields
• Function-correcting codes with homogeneous distance
• On \(b\)-symbol distance, Hamming distance and RT distance of type 1 \(\lambda \)-constacyclic codes of length \(8 p^s\) over \(\mathbb{F}_{p^m}[u]/\langle u^k\rangle \)
• Lee metric codes for symbol-pair read channels
• The \(b\)-symbol weight hierarchies of two families of cyclic codes over \(\mathbb{F}_q\)
• Several new classes of MDS symbol-pair codes
• New constructions of MDS symbol-pair codes via simple-root cyclic codes
• On a class of constacyclic codes and MDS code construction over \(\frac{\mathbb{F}_{p^m} [u, v]}{\langle u^2 - \delta u, v^2 - \gamma v, uv - vu \rangle}\)
• Some bounds on the cardinality of the b-symbol weight spectrum of codes
• Shortest-path and antichain metrics
• On the MDS \(b\)-symbol of repeated-root constacyclic codes of prime power length over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}+u^2 \mathbb{F}_{p^m}\)
• A new family of AMDS symbol-pair constacyclic codes of length 4p and symbol-pair distance 9p
• Bounds and constructions of optimal symbol-pair codes with constant pair-weight
• On Hamming distance and RT distance of a class of constacyclic codes over \(\mathbb{F}_{p^n}+u\mathbb{F}_{p^n}+\cdots +u^{t-1}\mathbb{F}_{p^n}\)
• On symbol-pair distance distributions of repeated-root constacyclic codes of length 4p^s and MDS codes
• Two new classes of AMDS symbol-pair cyclic codes of length 4p
• A new class of AMDS symbol-pair codes from repeated-root codes
• New constructions of optimal symbol-pair constacyclic codes of length 4p^s

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

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