Add to ORKGThe aim of the paper is to expose the general laws for distribution of code words over hypercube edges and to generalize the properties detected in the different code constructions. The results are as follows: theorem about distribution of code words over edges, theorem about density of linear double codes, generalization of G.S. Shapiro and D.L. Zlotnik results, consideration of improved divisions as general properties of linear and improved codes. The results and methods can be used at solving optimization problems of discrete mathematicsAvailable from VNTIC / VNTIC - Scientific & Technical Information Centre of RussiaSIGLERURussian Federatio
This bachelor's thesis is concerned with results of error-correcting codes theory, which deals with ...
The main goal of this work is to improve algebraic geometric/number theoretic constructions of error...
This thesis shows how certain classes of binary constant weight codes can be represented geometrical...
We develop an approach through geometric functional analysis to error correcting codes and ...
This paper presents the outlines of elementary error-correcting codes. The first section is an intro...
We study nonlinear binary error--correcting codes closely related to finite geometries and quadratic...
We obtain new bounds on the parameters and we give new constructions of linear error-block codes. We...
The set of all subspaces of F-q(n) is denoted by P-q(n). The subspace distance d(S)(X, Y) = dim(X) +...
A variety of new Euclidean codes are investigated. These codes are suitable for discrete-time Gaussi...
The set of all subspaces of Fqn is denoted by Pq(n). The subspace distance dS(X, Y) = dim(X) + dim(Y...
This paper emphasizes that coordinates of an error-correcting code are functions. We have incorporat...
AbstractIn this paper we use intersection theory to develop methods for obtaining lower bounds on th...
In this age of information technology, methods must be found that allow errors in data transmission ...
We examine classes of binary linear error correcting codes constructed from certain sets of lines de...
We examine classes of binary linear error correcting codes constructed from certain sets of lines de...
This bachelor's thesis is concerned with results of error-correcting codes theory, which deals with ...
The main goal of this work is to improve algebraic geometric/number theoretic constructions of error...
This thesis shows how certain classes of binary constant weight codes can be represented geometrical...
We develop an approach through geometric functional analysis to error correcting codes and ...
This paper presents the outlines of elementary error-correcting codes. The first section is an intro...
We study nonlinear binary error--correcting codes closely related to finite geometries and quadratic...
We obtain new bounds on the parameters and we give new constructions of linear error-block codes. We...
The set of all subspaces of F-q(n) is denoted by P-q(n). The subspace distance d(S)(X, Y) = dim(X) +...
A variety of new Euclidean codes are investigated. These codes are suitable for discrete-time Gaussi...
The set of all subspaces of Fqn is denoted by Pq(n). The subspace distance dS(X, Y) = dim(X) + dim(Y...
This paper emphasizes that coordinates of an error-correcting code are functions. We have incorporat...
AbstractIn this paper we use intersection theory to develop methods for obtaining lower bounds on th...
In this age of information technology, methods must be found that allow errors in data transmission ...
We examine classes of binary linear error correcting codes constructed from certain sets of lines de...
We examine classes of binary linear error correcting codes constructed from certain sets of lines de...
This bachelor's thesis is concerned with results of error-correcting codes theory, which deals with ...
The main goal of this work is to improve algebraic geometric/number theoretic constructions of error...
This thesis shows how certain classes of binary constant weight codes can be represented geometrical...