On the binary projective codes with dimension 6
نویسندگان
چکیده
منابع مشابه
On the binary projective codes with dimension 6
All binary projective codes of dimension up to 6 are classified. Information about the number of the codes with different minimum distances and different orders of automorphism groups is given.
متن کاملOn the least covering radius of binary linear codes of dimension 6
In this work a heuristic algorithm for obtaining lower bounds on the covering radius of a linear code is developed. Using this algorithm the least covering radii of the binary linear codes of dimension 6 are determined. Upper bounds for the least covering radii of binary linear codes of dimensions 8 and 9 are derived.
متن کاملIsotropic Constant Dimension Subspace Codes
In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...
متن کاملLong Binary Linear Codes and Large Caps in Projective Space
We obtain, in principle, a complete classification of all long inextendable binary linear codes. Several related constructions and results are presented.
متن کاملWeight hierarchies of binary linear codes of dimension 4
The weight hierarchy of a binary linear [n; k] code C is the sequence (d1; d2; : : : ; dk) where dr is the smallest support of an r-dimensional subcode of C. The codes of dimension 4 are collected in classes. The possible weight hierarchies in each class are given. For one class the details of the proofs are included. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2006
ISSN: 0166-218X
DOI: 10.1016/j.dam.2006.03.004