Constant dimension codes from Riemann-Roch spaces
From MaRDI portal
Publication:1691237
Recommendations
- Riemann-Roch spaces and linear network codes
- Any network code comes from an algebraic curve taking osculating spaces
- Linear network codes based on \(R\)-modules
- Johnson type bounds for mixed dimension subspace codes
- scientific article; zbMATH DE number 4004353
- Construction of constant dimension codes in some cases
- Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
- A Rank-Metric Approach to Error Control in Random Network Coding
- Subspace codes in \(\operatorname{PG}(2N-1; q)\)
- Large constant dimension codes and lexicodes
Cites work
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- A Rank-Metric Approach to Error Control in Random Network Coding
- A note on equidistant subspace codes
- Codes and Designs Related to Lifted MRD Codes
- Coding for Errors and Erasures in Random Network Coding
- Constant-Rank Codes and Their Connection to Constant-Dimension Codes
- Error-Correcting Codes in Projective Space
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- On subspace codes
- Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
- Riemann-Roch spaces and linear network codes
Cited in
(4)
This page was built for publication: Constant dimension codes from Riemann-Roch spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1691237)