Singular linear space and its applications

DOI10.1016/J.FFA.2011.02.001zbMath1234.51008OpenAlexW2025663209MaRDI QIDQ640002

Kaishun Wang, Jun Guo, Feng-Gao Li

Publication date: 12 October 2011

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2011.02.001

zbMATH Keywords

latticeauthentication codequasi-strongly regular graphDeza digraphsingular linear space

Mathematics Subject Classification ID

Linear algebraic groups over finite fields (20G40) Association schemes, strongly regular graphs (05E30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Authentication, digital signatures and secret sharing (94A62) Other finite incidence structures (geometric aspects) (51E30)

Related Items (19)

The construction of LDPC codes based on the subspaces of singular linear space over finite field ⋮ Newly deterministic construction of compressed sensing matrices via singular linear spaces over finite fields ⋮ Nontrivial t-Intersecting Families for Vector Spaces ⋮ Class dimension of association schemes in singular linear spaces ⋮ Anzahl formulas of subspaces in symplectic spaces and their applications ⋮ Erdős-Ko-Rado theorems in certain semilattices ⋮ The Erdős-Ko-Rado theorem for singular linear spaces ⋮ Relation graphs of an association scheme based on attenuated spaces ⋮ The Hilton-Milner theorem for the distance-regular graphs of bilinear forms ⋮ The Hilton-Milner theorem for attenuated spaces ⋮ Anzahl theorems in geometry oft-singular classical groups and their applications ⋮ Error-correcting codes in attenuated space over finite fields ⋮ New construction of error-correcting pooling designs from singular linear spaces over finite fields ⋮ Bounds on subspace codes based on totally isotropic subspace in symplectic spaces and extended symplectic spaces ⋮ Quasi-regular semilattices in singular linear spaces ⋮ t-Singular Linear Spaces ⋮ Group testing with geometry of classical groups over finite fields ⋮ \(r\)-cross \(t\)-intersecting families for vector spaces ⋮ Bounds on subspace codes based on subspaces of type \((m, 1)\) in singular linear space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Suborbits of subspaces of type \((m,k)\) under finite singular general linear groups
• Lattices associated with vector spaces over a finite field
• Authentication codes and bipartite graphs
• Lattices generated by orbits of totally isotropic flats under finite affine-classical groups
• Lattices generated by two orbits of subspaces under finite classical groups
• Lattices generated by orbits of flats under finite affine-symplectic groups
• Lattices associated with totally isotropic subspaces in classical spaces
• Association schemes based on attenuated spaces
• Construction of Cartesian authentication codes from unitary geometry
• Lattices generated by orbits of subspaces under finite singular unitary group and its characteristic polynomials
• Pooling spaces and non-adaptive pooling designs
• Deza digraphs. II.
• Deza digraphs
• On quasi-strongly regular graphs
• Lattices Generated by Two Orbits of Subspaces Under Finite Singular Classical Groups
• Lattices generated by transitive sets of subspaces under finite classical groups I
• Lattices generated by transitive sets of subspaces under finite classical groups II the orthogonal case of odd characteristic
• Codes Which Detect Deception
• Lattices Generated by Orbits of Subspaces Under Finite Singular Classical Groups and Its Characteristic Polynomials
• Deza graphs: A generalization of strongly regular graph
• Lattices generated by transitive sets of subspaces under finite classical groups III the orthogonal case of even characteristic
• Lattices Generated by Orbits of Flats Under Finite Affine Groups
• On the geometricity of lattices generated by orbits of subspaces under finite classical groups

This page was built for publication: Singular linear space and its applications