\(\mathbb{Z}_p \mathbb{Z}_p[v]\)-additive cyclic codes are asymptotically good

From MaRDI portal
Publication:2053262

DOI10.1007/s12190-020-01466-wOpenAlexW3108402870MaRDI QIDQ2053262

Xiaotong Hou, Jian Gao

Publication date: 29 November 2021

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-020-01466-w




Related Items (20)

\(\mathbb{F}_qR\)-linear skew cyclic codes\(n\)-dimension quasi-twisted codes of arbitrary length over finite fieldsComplete weight enumerator of torsion codes\(\mathbb{Z}_2\mathbb{Z}_2[u^4\)-cyclic codes and their duals] ⋮ \((x^n - (a+bw), \xi, \eta)\)-skew constacyclic codes over \(\mathbb{F}_q + w\mathbb{F}_q\) and their applications in quantum codesNew MDS EAQECCs derived from constacyclic codes over \(\mathbb{F}_{q^2} + v \mathbb{F}_{q^2}\)Non-binary quantum codes from cyclic codes over \(\mathbb{F}_p \times (\mathbb{F}_p +v\mathbb{F}_p)\)New MDS operator quantum error-correcting codes derived from constacyclic codes over \(\mathbb{F}_{q^2} + v\mathbb{F}_{q^2}\)Asymptotically good \(\mathbb{Z}_p\mathbb{Z}_p[u/\langle u^t\rangle\)-additive cyclic codes] ⋮ Minimal linear codes from defining sets over \(\mathbb{F}_p + u \mathbb{F}_p\)Weight distribution of double cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\)Constacyclic codes over mixed alphabets and their applications in constructing new quantum codes\(\mathbb{F}_2[u\mathbb{F}_2[u]\)-additive cyclic codes are asymptotically good] ⋮ \(n\)-dimensional quasi-cyclic codes over finite chain ringsWeight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\)\(( \sigma, \delta )\)-skew quasi-cyclic codes over the ring \(\mathbb{Z}_4+u\mathbb{Z}_4 \)Enumeration of \({\mathbb{Z}}_4\)-double cyclic codesMaximal entanglement EAQECCs from cyclic and constacyclic codes over \(\mathbb{F}_q+v_1\mathbb{F}_q+\cdots +v_{s-1}\mathbb{F}_q\)Weight distribution of double cyclic codes over Galois ringsOn \(\mathbb{Z}_2\mathbb{Z}_4\)-additive polycyclic codes and their Gray images



Cites Work




This page was built for publication: \(\mathbb{Z}_p \mathbb{Z}_p[v]\)-additive cyclic codes are asymptotically good