On a class of constant weight codes.
On a one-parameter family of Riordan arrays and the weight distribution of MDS codes.
On a test for codes.
On block irreducible forms over Euclidean domains.
On certain codes admitting inverse semigroups as syntactic monoids.
On codes with finite interpreting delay : a defect theorem
On codes with finite interpreting delay: a defect theorem
We introduce two new classes of codes, namely adjacent codes and codes with finite interpreting delay. For each class, we establish an extension of the defect theorem.
On codes with given minimum distance and covering radius.
On codes with given minimum distance and covering radius.
On distance nonregularity of Preparata codes.
On equivalence of two tests for codes.
On extremal additive codes of length to
In this paper we consider the extremal even self-dual -additive codes. We give a complete classification for length . Under the hypothesis that at least two minimal words have the same support, we classify the codes of length and we show that in length such a code is equivalent to the unique -hermitian code with parameters [18,9,8]. We construct with the help of them some extremal -modular lattices.
On Extremal Binary Doubly-Even Self-Dual Codes of Length 88*
In this paper we present 35 new extremal binary self-dual doubly-even codes of length 88. Their inequivalence is established by invariants. Moreover, a construction of a binary self-dual [88, 44, 16] code, having an automorphism of order 21, is given.*This work was partly supported by the Norwegian Government Scholarship.
On finite principal ideal rings.
On full partial quasigroups of finite order and local cardinal maximum codes.
On Group and Nongroup Perfect Codes in q Symbols.
On identifying codes in the King grid that are robust against edge deletions.
On McEliece's theorem.
On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre.
On mixed codes with covering radius 1 and minimum distance 2.