1016 search results - page 40 / 204 » Linear error-block codes |
94
Voted
TIT
2008
15 years 15 days ago
2008
If and are nonnegative integers and F is a field, then a polynomial collection {p1, . . . , p} Z[1, . . . , ] is said to be solvable over F if there exist 1, . . . , F such t...
69
Voted
COMBINATORICS
2000
15 years 13 days ago
2000
102
Voted
DCC
2008
IEEE
16 years 5 days ago
2008
IEEE
Complete (n, r)-arcs in PG(k - 1, q) and projective (n, k, n - r)q-codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable le...
82
Voted
GLOBECOM
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, we study the rank distributions of linear codes. We give the analogous to the MacWilliams identity for the rank distributions of codes. The considerations of our pr...
106
click to vote
AAECC
2007
Springer
15 years 22 days ago
2007
Springer
We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the o...