2 citations · 2 across the 2 of their papers we have counts for
9 papers
Some properties of pseudomeadows
Hamid Kulosman
The purpose of this paper is to study the commutative pseudomeadows, the structure which is defined in the same way as commutative meadows, except that the existence of a multiplic…
The formula for the largest minimal distance of binary LCD codes
Seth Gannon, Hamid Kulosman
In the 2017 paper by Dougherty, Kim, Ozkaya, Sok, and Solé about the linear programming bound for LCD codes the notion was defined for binary LCD -codes.…
The condition for a cyclic code over Z4 of odd length to have a complementary dual
Seth Gannon, Hamid Kulosman
We show that a necessary and sufficient condition for a cyclic code C over Z4 of odd length to be an LCD code is that C=(f(x)) where f is a self-reciprocal polynomial in Z4[X].
Some remarks about trunks and morphisms of neural codes
Katie Christensen, Hamid Kulosman
We give intrinsic characterizations of neural rings and homomorphisms between them. Also we introduce the notion of a basic monomial code map and characterize monomial code maps as…
The number of addends in the decomposition of an element of a numerical semigroup into atoms
Hamid Kulosman
We prove that for every nonempty set of integers bigger than , which has at most three elements, there exists a numerical semigroup and an element of such that a…
A new simple example of an atomic domain which is not ACCP
Hamid Kulosman
We give a new simple example of an atomic domain which is not ACCP. Our example is a monoid domain , where is a field and is a submonoid of the additive monoid of n…