Circuit lower bounds and linear codes.
Classification of generalized Hadamard matrices and quaternary Hermitian self-dual codes of length 18.
Codes and designs from triangular graphs and their line graphs
For any prime p, we consider p-ary linear codes obtained from the span over p of rows of incidence matrices of triangular graphs, differences of the rows and adjacency matrices of line graphs of triangular graphs. We determine parameters of the codes, minimum words and automorphism groups. We also show that the codes can be used for full permutation decoding.
Codes and projective multisets.
Codes correcteurs d'erreurs.
Codes de Goppa
Colorings and nowhere-zero flows of graphs in terms of Berlekamp's switching game.
Combinatorial aspects of code loops
The existence and uniqueness (up to equivalence defined below) of code loops was first established by R. Griess in [3]. Nevertheless, the explicit construction of code loops remained open until T. Hsu introduced the notion of symplectic cubic spaces and their Frattini extensions, and pointed out how the construction of code loops followed from the (purely combinatorial) result of O. Chein and E. Goodaire contained in [2]. Within this paper, we focus on their combinatorial construction and prove...
Completing codes
Construction of codes by lattice valued fuzzy sets.
Construction of Optimal Linear Codes by Geometric Puncturing
Dedicated to the memory of S.M. Dodunekov (1945–2012)Abstract. Geometric puncturing is a method to construct new codes. ACM Computing Classification System (1998): E.4.∗This research was partially supported by Grant-in-Aid for Scientific Research of Japan Society for the Promotion of Science under Contract Number 24540138.
Constructions of digital nets
Cycle indicators of linear groups and enumeration of linear codes. (Zyklenzeiger linearer Gruppen und Abzählung linearer Codes.)