Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels
From MaRDI portal
Publication:2976878
DOI10.1109/TIT.2016.2522434zbMath1359.94872MaRDI QIDQ2976878
Jehoshua Bruck, Eitan Yaakobi, Paul H. Siegel
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (16)
Complete \(b\)-symbol weight distribution of some irreducible cyclic codes ⋮ Maximum distance separable codes for \(b\)-symbol read channels ⋮ The \(b\)-symbol weight distributions of all semiprimitive irreducible cyclic codes ⋮ 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 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}}\) ⋮ 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 ⋮ New constructions of MDS symbol-pair codes ⋮ On \(t\)-revealing codes in binary Hamming spaces ⋮ 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}\)
This page was built for publication: Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels