Parameterized codes over cycles
From MaRDI portal
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Recommendations
Cited in
(8)- The second generalized Hamming weight of some evaluation codes arising from a projective torus
- Projective parameterized linear codes
- Cyclic codes with parameters \([p^k,p^{k-1},p]\) and \([2p^k,p^{k-1}(p-1),d\leq p]\)
- Parameterized codes over graphs
- Codes parameterized by the edges of a bipartite graph with a perfect matching
- Codes over a subset of octonion integers
- Parameterized codes associated to the edges of some subgraphs of a simple graph
- Generalized Hamming weights and some parameterized codes
This page was built for publication: Parameterized codes over cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2922761)