Decoding of cyclic codes over F/sub 2/+uF/sub 2/
From MaRDI portal
DOI10.1109/18.782165zbMATH Open0959.94028OpenAlexW1985944932MaRDI QIDQ4503383FDOQ4503383
Authors: P. 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
Recommendations
- Decoding of cyclic codes over the ring \(F_2+uF_2+u^2F_2\)
- Decoding of cyclic codes over the ring \(\frac{F_2[u]}{{\langle{u^t}\rangle }}\)
- Cyclic codes over \({\mathbb{F}}_2 + u{\mathbb{F}}_2 + v{\mathbb{F}}_2 + uv{\mathbb{F}}_2\)
- scientific article; zbMATH DE number 6698978
- Decoding of cyclic codes over the ring \(\frac{F_p[u]}{\langle u^k \rangle}\)
Gray mapself-dual codescodes over ringsspectral representationdecoding algorithmLee distancelinear cyclic codesBCH-like bound
Cited In (28)
- Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels
- Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u]}{\langle u^a \rangle}\) and their duals
- Decoding of cyclic codes over the ring \(\frac{F_2[u]}{{\langle{u^t}\rangle }}\)
- Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)
- Cyclic codes over rings of matrices
- Linear codes over \(\mathbb{F}_q\times (\mathbb{F}_q+v\mathbb{F}_q)\)
- DFT for cyclic code over \(F_p+ uF_p+\cdots+ u^{k-1}F_p\)
- Cyclic codes over \(R_{k}\)
- On cyclic DNA codes over \({\mathbb {F}}_2+u{\mathbb {F}}_2\)
- Cyclic and negacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Decoding of cyclic codes over the ring \(F_2+uF_2+u^2F_2\)
- RT distances and Hamming distances of constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
- MacWilliams identities of the linear codes over \(\mathbb{F}_q\times (\mathbb{F}_q+v \mathbb{F}_q)\)
- Cyclic DNA codes over \(\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2\) and their applications
- Skew constacyclic codes over finite fields and finite chain rings
- Decoding of cyclic codes over the ring \(\frac{F_p[u]}{\langle u^k \rangle}\)
- Skew constacyclic codes over finite commutative semi-simple rings
- Statistical Decoding of Codes over $\mathbb{F}_q$
- Negacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- RT distance and weight distributions of Type 1 constacyclic codes of length 4ps over Fpm[u]
- On self-dual constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Construction of cyclic codes over \(\mathbb F_2 + u\mathbb F_2\) for DNA computing
- On a class of constacyclic codes of length \(2p^s\) over \(\frac{\mathbb{F}_{p^m}[u]}{\langle u^a \rangle}\)
- On \((\alpha + u \beta)\)-constacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}^\ast\)
- On constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} +u\mathbb{F}_{p^m}\)
- Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
- Constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\)
- \((1+\lambda u)\)-constacyclic codes over \(\mathbb F_{p}[u]/\langle u^m\rangle\)
This page was built for publication: Decoding of cyclic codes over F/sub 2/+uF/sub 2/
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503383)