Construction of codes by lattice valued fuzzy sets.
Construction of codes identifying sets of vertices.
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
Convolutional codes and frequency responses.
Covering codes for Hats-on-a-line.
Creation of unequal error protection codes for two groups of symbols
This article presents problems of unequal information importance. The paper discusses constructive methods of code generation, and a constructive method of generating asymptotic UEP codes is built. An analog model of Hamming's upper bound and Hilbert's lower bound for asymptotic UEP codes is determined.
Cube-Tilings of Rn and Nonlinear Codes.
Cycle indicators of linear groups and enumeration of linear codes. (Zyklenzeiger linearer Gruppen und Abzählung linearer Codes.)
De Bruijn cycles and their application for encoding of discrete positions
Decidability of code properties
We explore the borderline between decidability and undecidability of the following question: “Let C be a class of codes. Given a machine of type X, is it decidable whether the language lies in C or not?” for codes in general, ω-codes, codes of finite and bounded deciphering delay, prefix, suffix and bi(pre)fix codes, and for finite automata equipped with different versions of push-down stores and counters.
Determinants of Legendre symbol matrices
Developing new locality results for the Prüfer code using a remarkable linear-time decoding algorithm.
Differential approach for the study of duals of algebraic-geometric codes on surfaces
The purpose of the present article is the study of duals of functional codes on algebraic surfaces. We give a direct geometrical description of them, using differentials. Even if this description is less trivial, it can be regarded as a natural extension to surfaces of the result asserting that the dual of a functional code on a curve is the differential code . We study the parameters of such codes and state a lower bound for their minimum distance. Using this bound, one can study some examples...
Digital (t,m,s)-nets and the spectral test
Disjunctive languages and compatible orders
Distance regularity of Kerdock codes.
Distances invariantes et L-cliques sur certains demi-groupes finis
Divisible Codes - A Survey
This paper surveys parts of the study of divisibility properties of codes. The survey begins with the motivating background involving polynomials over finite fields. Then it presents recent results on bounds and applications to optimal codes.
Dual codes of projective planes of order 25.