Abstract: Problem statement: The point-line geometry of type D4,2 was introduced and characterized by many authors such as Shult and Buekenhout and in several researches many of geometries were considered to construct good families of codes and this forced us to present very important substructures in such geometry that are hyperplanes. Approach: We used the isomorphic classical polar space Ω+(8, F) and their combinatorics to construct the hyperplanes and the family of certain codes related to such hyperplanes. Results: We proved that each hyperplane is either the set ∆ 2 (p) which consisted of all points at a distance mostly 2 from a fixed point p or a Grassmann geometry of type A3,2 and then we presented a new family of non linear binary ...
AbstractWe study the functional codes Ch(X) defined by Lachaud in [G. Lachaud, Number of points of p...
A k-polar Grassmannian is a geometry having as pointset the set of all k-dimensional subspaces of a ...
Apart from being an interesting and exciting area in combinatorics with beautiful results, finite pr...
This thesis shows how certain classes of binary constant weight codes can be represented geometrical...
One says that Veldkamp lines exist for a point-line geometry Γ if, for any three distinct (geometric...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
There is a chain of polynomial codes that contains the simplex code of the projective plane over GF ...
Let Gamma(n) (q) denote the geometry of the hyperbolic lines of the symplectic polarspace W(2n - 1, ...
We use a geometric approach to solve an extremal problem in coding theory. Expressed in geometric la...
Abstract Certain classes of binary constant weight codes can be represented geometrically using line...
AbstractWe show that there are six isomorphism classes of hyperplanes of the dual polar space Δ=DW(5...
Jungnickel and Tonchev (Des. Codes Cryptogr. 51:131–140) used polarities of PG(2d − 1, q) to constru...
Let Cn−1(n,q) be the code arising from the incidence of points and hyperplanes in the Desarguesian p...
AbstractFor a class of parapolar spaces that includes the geometries E6,4, E7,7, and E8,1 with lines...
We study nonlinear binary error--correcting codes closely related to finite geometries and quadratic...
AbstractWe study the functional codes Ch(X) defined by Lachaud in [G. Lachaud, Number of points of p...
A k-polar Grassmannian is a geometry having as pointset the set of all k-dimensional subspaces of a ...
Apart from being an interesting and exciting area in combinatorics with beautiful results, finite pr...
This thesis shows how certain classes of binary constant weight codes can be represented geometrical...
One says that Veldkamp lines exist for a point-line geometry Γ if, for any three distinct (geometric...
A linear [n, k]-code C is a k-dimensional subspace of V (n, q), where V (n, q) denotes the n-dimensi...
There is a chain of polynomial codes that contains the simplex code of the projective plane over GF ...
Let Gamma(n) (q) denote the geometry of the hyperbolic lines of the symplectic polarspace W(2n - 1, ...
We use a geometric approach to solve an extremal problem in coding theory. Expressed in geometric la...
Abstract Certain classes of binary constant weight codes can be represented geometrically using line...
AbstractWe show that there are six isomorphism classes of hyperplanes of the dual polar space Δ=DW(5...
Jungnickel and Tonchev (Des. Codes Cryptogr. 51:131–140) used polarities of PG(2d − 1, q) to constru...
Let Cn−1(n,q) be the code arising from the incidence of points and hyperplanes in the Desarguesian p...
AbstractFor a class of parapolar spaces that includes the geometries E6,4, E7,7, and E8,1 with lines...
We study nonlinear binary error--correcting codes closely related to finite geometries and quadratic...
AbstractWe study the functional codes Ch(X) defined by Lachaud in [G. Lachaud, Number of points of p...
A k-polar Grassmannian is a geometry having as pointset the set of all k-dimensional subspaces of a ...
Apart from being an interesting and exciting area in combinatorics with beautiful results, finite pr...