# Browsing Algebraic Combinatorics by Title

Sort by: Order: Results:

• (2014-01)
The hulls of codes from the row span over FpFp , for any prime p, of incidence matrices of connected k-regular graphs are examined, and the dimension of the hull is given in terms of the dimension of the row span ...
• (2006-04)
We determine information sets for the generalized Reed–Muller codes and use these to apply partial permutation decoding to codes from finite geometries over prime fields. We also obtain new bases of minimum-weight vectors ...
• (2006-04)
We determine information sets for the generalized Reed–Muller codes and use these to apply partial permutation decoding to codes from finite geometries over prime fields. We also obtain new bases of minimum-weight vectors ...
• (2003)
Until recently, the known symmetric nets were class-regular and therefore satisfied a certain geometric condition that defines the class of nets known as tactical symmetric nets. Thus the known symmetric nets were tactical. ...
• (2003)
Until recently, the known symmetric nets were class-regular and therefore satisfied a certain geometric condition that defines the class of nets known as tactical symmetric nets. Thus the known symmetric nets were tactical. ...
• (2008-07-06)
Rahilly [On the line structure of designs, Discrete Math. 92 (1991) 291–303] described a construction that relates any Hadamard design H on 4^m-1 points with a line spread to an affine design having the same parameters as ...
• (2012-04)
In a recent paper, Pawale [22] investigated quasi-symmetric 2-(v, k, lambda) designs with intersection numbers x > 0 and y = x + 2 with lambda > 1 and showed that under these conditions either lambda = x + 1 or lambda = x ...
• (2010)
Given an involution z in W, where W is the symmetric group of degree n, we study the relation between the subsystems of a root system for W corresponding to certain decreasing subsequences of z and the two-sided Kazhdan–Lusztig ...
• (2008-02-01)
We study the relation between certain increasing and decreasing subsequences occurring in the row form of certain elements in the symmetric group, following Schensted [C. Schensted, Longest increasing and decreasing ...
• (2008-02-01)
We study the relation between certain increasing and decreasing subsequences occurring in the row form of certain elements in the symmetric group, following Schensted [C. Schensted, Longest increasing and decreasing ...
• (2008-03)
Explicit PD-sets are found for partial permutation decoding of the generalized Reed-Muller codes from the affine geometry designs of points and lines in dimension 3 over the prime field of order p, using the information ...
• (2008-03)
Explicit PD-sets are found for partial permutation decoding of the generalized Reed-Muller codes from the affine geometry designs of points and lines in dimension 3 over the prime field of order p, using the information ...
• (2003-03)
We show that a quasi-symmetric design with intersection numbers 1 and y > 1 and a good block belongs to one of three types: (a) it has the same parameters as PG 2(4, q), the design of points and planes in projective 4-space; ...
• (2003-03)
We show that a quasi-symmetric design with intersection numbers 1 and y > 1 and a good block belongs to one of three types: (a) it has the same parameters as PG 2(4, q), the design of points and planes in projective 4-space; ...
• (2010-11-28)
We show that the first- and second-order Reed–Muller codes, and , can be used for permutation decoding by finding, within the translation group, (m−1)- and (m+1)-PD-sets for for m≥5,6, respectively, and (m−3)-PD-sets for ...
• (2010-11-28)
We show that the first- and second-order Reed–Muller codes, and , can be used for permutation decoding by finding, within the translation group, (m−1)- and (m+1)-PD-sets for for m≥5,6, respectively, and (m−3)-PD-sets for ...
• (2009-01)
We show that a construction described in [K.L. Clark, J.D. Key, M.J. de Resmini, Dual codes of translation planes, European J. Combinatorics 23 (2002) 529–538] of small-weight words in the dual codes of finite translation ...