Multi-twisted additive codes over finite fields are asymptotically good
From MaRDI portal
Publication:6101846
DOI10.1007/s12095-022-00583-6zbMath1518.94142OpenAlexW4280601860WikidataQ114849115 ScholiaQ114849115MaRDI QIDQ6101846
Anuradha Sharma, Sandeep Sharma
Publication date: 20 June 2023
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-022-00583-6
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constacyclic \(\mathbb F_q\)-linear codes over \(\mathbb F_{q^l}\)
- Cyclic \(\mathbb F_{q}\)-linear \(\mathbb F_{q^t}\)-codes
- Enumeration of complementary-dual cyclic \(\mathbb{F}_q\)-linear \(\mathbb{F}_{q^t}\)-codes
- Multi-twisted codes over finite fields and their dual codes
- Long quasi-polycyclic \(t\)-CIS codes
- Hamming weight enumerators of multi-twisted codes with at most two non-zero constituents
- Skew multi-twisted codes over finite fields and their Galois duals
- On cyclic \(\mathbb F_q\)-linear \(\mathbb F_{q^{t}}\)-codes
- A generalization of quasi-twisted codes: multi-twisted codes
- Thresholds of Random Quasi-Abelian Codes
- ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
- A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
- Quantum twisted codes
- Nonbinary quantum codes
- Quantum error correction via codes over GF(4)
- Artin's Primitive Root Conjecture – A Survey
- Constacyclic additive codes over finite fields
- Probability and Computing
- Some results on quasi-cyclic codes
- On Artin's conjecture.
- Additive cyclic codes over \(\mathbb F_4\)
- Additive cyclic codes over \(\mathbb F_4\)
- Multi-twisted additive codes with complementary duals over finite fields
This page was built for publication: Multi-twisted additive codes over finite fields are asymptotically good
