Is the class of cyclic codes asymptotically good?

From MaRDI portal
Revision as of 01:04, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3547327

DOI10.1109/TIT.2005.862123zbMath1317.94148OpenAlexW2145581153MaRDI QIDQ3547327

Conchita Martínez-Pérez, Wolfgang Willems

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2005.862123





Related Items (21)

Good cyclic codes and the uncertainty principleSeveral classes of asymptotically good quasi-twisted codes with a low index\( \mathbb{Z}_p\mathbb{Z}_{p^s} \)-additive cyclic codes are asymptotically goodBinary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\)Asymptotically good quasi-cyclic codes of fractional indexSome \(q\)-ary cyclic codes from explicit monomials over \(\mathbb{F}_{q^m}\)Self-dual and LCD double circulant and double negacirculant codes over a family of finite rings \(\mathbb{F}_q[v_1,v_2,\dots,v_t\)] ⋮ Hermitian self-dual 2-quasi-abelian codesAsymptotically good \(\mathbb{Z}_p\mathbb{Z}_p[u/\langle u^t\rangle\)-additive cyclic codes] ⋮ \(\mathbb{F}_2[u\mathbb{F}_2[u]\)-additive cyclic codes are asymptotically good] ⋮ Double circulant matricesOn the exact evaluation of certain instances of the Potts partition function by quantum computersThe uncertainty principle over finite fieldsOn self-dual double circulant codes\(\mathbb{Z}_4 \mathbb{Z}_4 \mathbb{Z}_4\)-additive cyclic codes are asymptotically goodAsymptotically good LCD 2-quasi-abelian codes over finite fieldsAsymptotically good generalized quasi-cyclic codes over finite chain ringsSelf-dual 2-quasi negacyclic codes over finite fieldsA modified Gilbert-Varshamov bound for self-dual quasi-twisted codes of index fourThe hulls of matrix-product codes over commutative rings and applicationsSelf-orthogonal quasi-abelian codes are asymptotically good







This page was built for publication: Is the class of cyclic codes asymptotically good?