Singleton bounds for \(R\)-additive codes
From MaRDI portal
Publication:1783709
DOI10.3934/amc.2018006zbMath1414.94929OpenAlexW2791008170MaRDI QIDQ1783709
Publication date: 21 September 2018
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2018006
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Bounds on codes (94B65) Combinatorial codes (94B25)
Related Items (4)
Codes over \(\mathfrak{m}\)-adic completion rings ⋮ Unnamed Item ⋮ Additive codes over Galois rings ⋮ \(\mathbb{F}_q\)-linear codes over \(\mathbb{F}_q\)-algebras
Cites Work
- Unnamed Item
- Cyclic \(R\)-additive codes
- Cyclic \(\mathbb F_{q}\)-linear \(\mathbb F_{q^t}\)-codes
- A basic exact sequence for the Lee and Euclidean weights of linear codes over \(\mathbb{Z}_l\)
- The theory of cyclic codes and a generalization to additive codes
- Quadratic residue codes over \(\mathbb{F}_{p^r}+{u_1}\mathbb{F}_{p^r}+{u_2}\mathbb{F}_{p^r}+\dots+{u_t}\mathbb{F}_ {p^r}\)
- \(\mathbb F_q\)-linear cyclic codes over \(\mathbb F_{q^m}\): DFT approach
- Linear codes over finite chain rings
- Cyclic additive codes
- On the theory of \(\mathbb{F}_q\)-linear \(\mathbb{F}_{q^t}\)-codes
- Maximum distance codes over rings of order 4
This page was built for publication: Singleton bounds for \(R\)-additive codes
