The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Constacyclic codes with one and the same generator polynomial and distinct length are considered. We give a generalization of the previous result of the first author [4] for constacyclic codes. Suitable maps between
vector spaces determined by the lengths of the codes are applied. It is proven
that the weight distributions of the coset leaders don’t depend on the word
length, but on generator polynomials only. In particular, we prove that every
constacyclic code has the same weight distribution...
Асен Божилов, Недялко Ненов -
Нека G е n-върхов граф и редицата от степените на върховете му е d1, d2, . . . , dn,
а V(G) е множеството от върховете на G. Степента на върха v бележим с d(v).
Най-малкото естествено число r, за което V(G) има r-разлагане
V(G) = V1 ∪ V2 ∪ · · · ∪ Vr, Vi ∩ Vj = ∅, , i 6 = j
такова, че d(v) ≤ n − |Vi|, ∀v ∈ Vi, i = 1, 2, . . . , r е означено с ϕ(G). В тази работа
доказваме неравенството ...
Let G be a simple n-vertex graph with degree sequence d1, d2, . ....
Download Results (CSV)