Constacyclic additive codes over finite fields
From MaRDI portal
Publication:5367531
DOI10.1142/S1793830917500379zbMATH Open1421.94103MaRDI QIDQ5367531FDOQ5367531
Anuradha Sharma, Taranjot Kaur
Publication date: 20 October 2017
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Cites Work
- Byte-Oriented Error-Correcting Codes for Semiconductor Memory Systems
- Title not available (Why is that?)
- Switching codes for delta-I noise reduction
- Quantum error correction via codes over GF(4)
- Title not available (Why is that?)
- Constacyclic \(\mathbb F_q\)-linear codes over \(\mathbb F_{q^l}\)
- Additive cyclic codes over \(\mathbb F_4\)
- Cyclic \(\mathbb F_{q}\)-linear \(\mathbb F_{q^t}\)-codes
- On cyclic \(\mathbb F_q\)-linear \(\mathbb F_{q^{t}}\)-codes
- Subspace subcodes of Reed-Solomon codes
- Enumeration of complementary-dual cyclic \(\mathbb{F}_q\)-linear \(\mathbb{F}_{q^t}\)-codes
Cited In (15)
- The theory of cyclic codes and a generalization to additive codes
- Multi-twisted additive codes over finite fields are asymptotically good
- Multi-twisted additive codes with complementary duals over finite fields
- Constacyclic codes over finite fields
- A class of constacyclic codes over a finite field
- Multi-twisted additive codes over finite fields
- Variable-length integer codes based on the Goldbach conjecture, and other additive codes
- Multi-twisted additive self-orthogonal and ACD codes are asymptotically good
- Non-Malleable Codes from Additive Combinatorics
- On addition and multiplication with Hensel codes
- Additive cyclic codes over mixed alphabets and the football pool problem
- On additive MDS codes over small fields
- Title not available (Why is that?)
- On additive quasi-abelian codes over finite fields and their duality properties
- A characterization of 1-perfect additive codes
This page was built for publication: Constacyclic additive codes over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5367531)
