Z_p Z_p[v]-additive cyclic codes are asymptotically good
From MaRDI portal
Publication:2053262
rateasymptotically good codesrelative minimum distance\(\mathbb{Z}_p \mathbb{Z}_p[v\)-additive cyclic codes]
Recommendations
- \( \mathbb{Z}_p\mathbb{Z}_{p^s} \)-additive cyclic codes are asymptotically good
- Asymptotically good \(\mathbb{Z}_{p^r} \mathbb{Z}_{p^s} \)-additive cyclic codes
- \(\mathbb{F}_2[u]\mathbb{F}_2[u]\)-additive cyclic codes are asymptotically good
- Some results on \( \mathbb{Z}_p\mathbb{Z}_p[v] \)-additive cyclic codes
- \(\mathbb{Z}_{p}\mathbb{Z}_{p}[u]\)-additive cyclic codes
Cites work
- $\BBZ_{2}\BBZ_{4}$ -Additive Cyclic Codes
- ${\mathbb {Z}}_{2}{\mathbb {Z}}_{4}$ -Additive Cyclic Codes, Generator Polynomials, and Dual Codes
- A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
- Association schemes and coding theory
- Asymptotically good \(\mathbb{Z}_{p^r} \mathbb{Z}_{p^s} \)-additive cyclic codes
- Asymptotically good quasi-cyclic codes of fractional index
- On \(\mathbb{Z}_2 \mathbb{Z}_4\)-additive complementary dual codes and related LCD codes
- On \(\mathbb{Z}_{2}\mathbb{Z}_{2}[u]\)-additive codes
- On ℤprℤps-additive codes
- Quasi-Cyclic Codes of Index $1\frac {1}{3}$
- Self-Dual Doubly Even $2$-Quasi-Cyclic Transitive Codes Are Asymptotically Good
- Some randomized code constructions from group actions
- Some results on \( \mathbb{Z}_p\mathbb{Z}_p[v] \)-additive cyclic codes
- Thresholds of Random Quasi-Abelian Codes
- \( \mathbb{Z}_p\mathbb{Z}_{p^s} \)-additive cyclic codes are asymptotically good
- \(\mathbb Z_2\mathbb Z_4\)-linear codes: Generator matrices and duality
Cited in
(28)- \(\mathbb{F}_q\mathbb{F}_q[u]\)-additive constacyclic codes are asymptotically good
- \(\mathbb{F}_qR\)-linear skew cyclic codes
- Non-binary quantum codes from cyclic codes over \(\mathbb{F}_p \times (\mathbb{F}_p +v\mathbb{F}_p)\)
- Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\)
- Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\)
- New MDS EAQECCs derived from constacyclic codes over \(\mathbb{F}_{q^2} + v \mathbb{F}_{q^2}\)
- \((x^n - (a+bw), \xi, \eta)\)-skew constacyclic codes over \(\mathbb{F}_q + w\mathbb{F}_q\) and their applications in quantum codes
- Complete weight enumerator of torsion codes
- Structure of \(\mathbb{F}_q\mathcal{R}\)-linear \((\varTheta, \varDelta_\varTheta)\)-cyclic codes
- Enumeration of \({\mathbb{Z}}_4\)-double cyclic codes
- The asymptotic probability distribution of the relative distance of additive quantum codes
- \(n\)-dimension quasi-twisted codes of arbitrary length over finite fields
- \(\mathbb{Z}_{p^r}\mathbb{Z}_{p^s}\mathbb{Z}_{p^t}\)-additive cyclic codes
- Weight distribution of double cyclic codes over Galois rings
- \(( \sigma, \delta )\)-skew quasi-cyclic codes over the ring \(\mathbb{Z}_4+u\mathbb{Z}_4 \)
- On \(\mathbb{Z}_2\mathbb{Z}_4\)-additive polycyclic codes and their Gray images
- \(n\)-dimensional quasi-cyclic codes over finite chain rings
- Asymptotically good \(\mathbb{Z}_p\mathbb{Z}_p[u]/\langle u^t\rangle\)-additive cyclic codes
- \( \mathbb{Z}_p\mathbb{Z}_{p^s} \)-additive cyclic codes are asymptotically good
- New MDS operator quantum error-correcting codes derived from constacyclic codes over \(\mathbb{F}_{q^2} + v\mathbb{F}_{q^2}\)
- \(\mathbb{F}_2[u]\mathbb{F}_2[u]\)-additive cyclic codes are asymptotically good
- Asymptotically good \(\mathbb{Z}_{p^r} \mathbb{Z}_{p^s} \)-additive cyclic codes
- \(\mathbb{Z}_2\mathbb{Z}_2[u^4]\)-cyclic codes and their duals
- Maximal entanglement EAQECCs from cyclic and constacyclic codes over \(\mathbb{F}_q+v_1\mathbb{F}_q+\cdots +v_{s-1}\mathbb{F}_q\)
- Multi-twisted additive codes over finite fields are asymptotically good
- \(\mathbb{Z}_4 \mathbb{Z}_4 \mathbb{Z}_4\)-additive cyclic codes are asymptotically good
- Constacyclic codes over mixed alphabets and their applications in constructing new quantum codes
- Weight distribution of double cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\)
This page was built for publication: \(\mathbb{Z}_p \mathbb{Z}_p[v]\)-additive cyclic codes are asymptotically good
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053262)
