Error-correcting codes in attenuated space over finite fields
From MaRDI portal
Publication:2011485
Recommendations
- Error-correcting codes based on totally isotropic subspaces in symplectic spaces
- Relationships of bounds for sizes of subspace codes in singular linear spaces over finite fields.
- Bounds on subspace codes based on totally isotropic subspaces in unitary spaces
- Relationships of bounds for sizes of subspace codes in singular linear spaces over finite fields.
- Error-correcting codes over an alphabet of four elements
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Association schemes based on attenuated spaces
- Codes and anticodes in the Grassman graph
- Coding for Errors and Erasures in Random Network Coding
- Error-Correcting Codes in Projective Space
- Johnson type bounds on constant dimension codes
- Linear authentication codes: bounds and constructions
- On perfect codes and related concepts
- Singular linear space and its applications
Cited in
(8)- A \(Q\)-polynomial structure for the attenuated space poset \(\mathcal{A}_q (N, M)\)
- Bounds on subspace codes based on orthogonal space over finite fields of characteristic 2
- Bounds on subspace codes based on subspaces of type (s,0,0,0) in pseudo-symplectic spaces and singular pseudo-symplectic spaces
- scientific article; zbMATH DE number 7029138 (Why is no real title available?)
- The attenuated space poset \(\mathcal{A}_q(N, M)\)
- Subspace code based on flats in affine space over finite fields
- Error-correcting codes based on totally isotropic subspaces in symplectic spaces
- Error-correcting codes based on partial linear maps of finite-dimensional vector spaces
This page was built for publication: Error-correcting codes in attenuated space over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011485)
