The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the BrouwerVan Eupen construction that transforms projectiveâ€¦ (More)

In this paper we present a family of ternary quasi-perfect BCH codes. These codes are of minimum distance 5 and covering radius 3. The first member of this family is the ternary quadratic-residueâ€¦ (More)

2006 IEEE Information Theory Workshop - ITW '06â€¦

2006

For any integer q we present a new bound which is a q-ary combinatorial analog of the binary Grey-Rankin bound. For any prime power q we present two infinite classes of q-ary codes which meet thisâ€¦ (More)

We consider the problem of nding the maximum possible length mâ€²(k; q) of a near-MDS code of given dimension k over the eld with q elements. We obtain the exact values of mâ€²(k; q) for q=2; 3; 4; 5.â€¦ (More)

In this paper, we present some results concerning a decomposition of binary self-dual codes having an automorphism of an order which is the product of two odd prime numbers. These results are appliedâ€¦ (More)

In this paper, we show that a set of q+a hyperplanes, q > 13, a â‰¤ (qâˆ’ 10)/4, that does not cover PG(n, q), does not cover at least qnâˆ’1âˆ’ aqnâˆ’2 points, and show that this lower bound is sharp. If theâ€¦ (More)

Let Sk be the gene ra to r ma t r ix o f a [2 k 1 ,k,2 k l ] s implex code; thus all the 2 k 1 co lumns o f S k are dis t inct non-zero b ina ry ktuples . Since g(k, 2 k1) = 2 k _ 1, the b o u n dâ€¦ (More)