Decoding of cyclic codes over F/sub 2/+uF/sub 2/
From MaRDI portal
Publication:4503383
DOI10.1109/18.782165zbMath0959.94028MaRDI QIDQ4503383
Parampalli Udaya, Alexis Bonnecaze
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.782165
spectral representation; self-dual codes; codes over rings; decoding algorithm; Gray map; Lee distance; linear cyclic codes; BCH-like bound
Related Items
Unnamed Item, Cyclic and negacyclic codes of length 4ps over 𝔽pm + u𝔽pm, Unnamed Item, On (α + uβ)-constacyclic codes of length 4ps over 𝔽pm + u𝔽pm∗, RT distance and weight distributions of Type 1 constacyclic codes of length 4ps over Fpm[u], Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u}{\langle u^a \rangle}\) and their duals], On cyclic DNA codes over \({\mathbb {F}}_2+u{\mathbb {F}}_2\), Negacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\), On constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} +u\mathbb{F}_{p^m}\), Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\), Cyclic codes over \(R_{k}\), DFT for cyclic code over \(F_p+ uF_p+\cdots+ u^{k-1}F_p\), Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\), Cyclic DNA codes over \(\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2\) and their applications, On self-dual constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\), Skew constacyclic codes over finite fields and finite chain rings, Decoding of cyclic codes over the ring \(\frac{F_2[u}{{\langle{u^t}\rangle }}\)], Construction of cyclic codes over \(\mathbb F_2 + u\mathbb F_2\) for DNA computing, \((1+\lambda u)\)-constacyclic codes over \(\mathbb F_{p}[u/\langle u^m\rangle\)]
