One generator quasi-cyclic codes over \(\mathbb F_2 + u\mathbb F_2\)
From MaRDI portal
Publication:1926343
DOI10.1016/j.jfranklin.2011.10.020zbMath1305.94110WikidataQ58473661 ScholiaQ58473661MaRDI QIDQ1926343
Bahattin Yildiz, Taher Abualrub, Siap, Irfan
Publication date: 28 December 2012
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jfranklin.2011.10.020
rank; type; minimal spanning set; 2-quasi-cyclic codes; lower bound for minimum distance of free quasi-cyclic codes; optimal binary linear codes
Related Items
Unnamed Item, Unnamed Item, The homogeneous weight for Rk, related gray map and new binary quasi-cyclic codes, 1-generator two-dimensional quasi-cyclic codes over $\mathbb{Z}_4[u/\langle u^2-1\rangle$], A Chinese remainder theorem approach to skew generalized quasi-cyclic codes over finite fields, 1-generator quasi-cyclic and generalized quasi-cyclic codes over the ring \(\frac{\mathbb Z_4[u}{\langle u^2 - 1\rangle}\)], Self-dual and LCD double circulant codes over a class of non-local rings, A note on constacyclic and quasi-cyclic codes over \({\mathbb{F}}_2+u{\mathbb{F}}_2+v{\mathbb{F}}_2+uv{\mathbb{F}}_2\), Bounds on quasi-cyclic codes over finite chain rings, Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\), A class of 1-generator quasi-cyclic codes over finite chain rings, ℤ2(ℤ2 + uℤ2)-Additive cyclic codes and their duals, Quasi-cyclic codes over the ring 𝔽p[u/〈u2 − u〉]
Cites Work
- Unnamed Item
- Cyclic DNA codes over the ring \(F_2[u/(u^2-1)\) based on the deletion distance]
- Linear codes over \({\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}\)
- Optimal ternary quasi-cyclic codes
- Constacyclic codes over \(\mathbb F_2 + u\mathbb F_2\)
- Cyclic codes over the rings \(\mathbb Z_2 + u\mathbb Z_2\) and \(\mathbb Z_2 + u\mathbb Z_2 + u^2 \mathbb Z_2\)
- Cyclic codes over \({\mathbb{F}}_2 + u{\mathbb{F}}_2 + v{\mathbb{F}}_2 + uv{\mathbb{F}}_2\)
- \((1+\lambda u)\)-constacyclic codes over \(\mathbb F_{p}[u/\langle u^m\rangle\)]
- Linear codes over \({\mathbb F}_{q}[u/(u^s)\) with respect to the Rosenbloom-Tsfasman metric]
- Nine good rate (m-1)/pm quasi-cyclic codes
- Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
- Six new binary quasi-cyclic codes
- New ternary quasi-cyclic codes with better minimum distances
- Quasi-cyclic codes over Z/sub 4/ and some new binary codes
- Some rate-<tex>p/(p+1)</tex>quasi-cyclic codes (Corresp.)
