On the classification of geometric codes by polynomial functions
From MaRDI portal
Publication:1904419
DOI10.1007/BF01388474zbMath0841.05013OpenAlexW2019471704MaRDI QIDQ1904419
J. W. P. Hirschfeld, David G. Glynn
Publication date: 14 July 1996
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01388474
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Combinatorial aspects of finite geometries (05B25)
Related Items (7)
The polynomial degree of the Grassmannian \(G(1,n,q)\) of lines in finite projective space \(PG(n,q)\) ⋮ An invariant for matrices and sets of points in prime characteristic ⋮ The permutation action of finite symplectic groups of odd characteristic on their standard modules. ⋮ The modular counterparts of Cayley's hyperdeterminants ⋮ Recent progress in algebraic design theory ⋮ The invariant factors of the incidence matrices of points and subspaces in 𝑃𝐺(𝑛,𝑞) and 𝐴𝐺(𝑛,𝑞) ⋮ A survey of cone representations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes
- The dimension of projective geometry codes
- A condition for the existence of ovals in PG(2,q), q even
- On Sets with Only Odd Secants in Geometries over GF(4)
- On the Number of Information Symbols in Difference-Set Cyclic Codes
- A geometric approach to a class of cyclic codes
- On the p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry
- On a class of majority-logic decodable cyclic codes
- On cyclic codes that are invariant under the general linear group
- Ovali ed altre curve nei piani di Galois di caratteristica due
- On generalized ReedMuller codes and their relatives
This page was built for publication: On the classification of geometric codes by polynomial functions